Tools

LEADER 08108cam a2200901 a 4500

001 ocm44850349;

003 OCoLC;

005 20260127093955.0;

008 000819s2000 gw a b 100 0 engsd;

015 a| GBA0565142| bnb;

015 a| 00,N32,05212| dnb;

016 7 a| 9594070572| DE-101;

019 a| 45305415a| 741250645a| 960152331a| 1171265643a| 1225819401;

020 a| 3540679014;

020 a| 9783540679011;

020 z| 3540679001;

029 0 a| OHXb| har005135296;

029 1 a| AU@b| 000021777786;

029 1 a| AU@b| 000022104930;

029 1 a| AU@b| 000025947375;

029 1 a| DEBBGb| BV013279866;

029 1 a| DEBSZb| 086740008;

029 1 a| NLGGCb| 197930026;

029 1 a| NZ1b| 5826480;

035 a| (Sirsi) o44850349;

049 a| EREE;

050 14 a| QA76.9.M35b| S96 2000;

072 7 a| QA2| lcco;

082 04 a| 004.01512| 211| https://id.oclc.org/worldcat/ddc/E3rkXgvBmpCjvwXfv6YBRTCd9V;

084 a| 54.102| bcl;

084 a| SS 48002| rvk;

084 a| 272| sdnb;

084 a| 282| sdnb;

084 a| DAT 500f2| stub;

111 2 a| Symposium on Mathematical Foundations of Computer Science (1972- )n| (25th :d| 2000 :c| Bratislava, Slovakia)?| UNAUTHORIZED;

245 10 a| Mathematical foundations of computer science 2000 :b| 25th international symposium, MFCS 2000, Bratislava, Slovakia, August 28-September 1, 2000 : proceedings /c| Mogens Nielsen, Branislav Rovan (eds.).;

246 30 a| MFCS 2000;

300 a| xiii, 710 pages :b| illustrations ;c| 24 cm.;

336 a| textb| txt2| rdacontent;

337 a| unmediatedb| n2| rdamedia;

338 a| volumeb| nc2| rdacarrier;

490 1 a| Lecture notes in computer science,x| 0302-9743 ;v| 1893;

530 a| Also available via the World Wide Web.;

504 a| Includes bibliographical references.;

505 0 a| Invited Talks -- Region Analysis and a ?-Calculus with Groups -- Abstract Data Types in Computer Algebra -- What Do We Learn from Experimental Algorithmics? -- And/Or Hierarchies and Round Abstraction -- Computational Politics: Electoral Systems -- 0-1 Laws for Fragments of Existential Second-Order Logic: A Survey -- On Algorithms and Interaction -- On the Use of Duality and Geometry in Layouts for ATM Networks -- Contributed Papers -- On the Lower Bounds for One-Way Quantum Automata -- Axiomatizing Fully Complete Models for ML Polymorphic Types -- Measure Theoretic Completeness Notions for the Exponential Time Classes -- Edge-Bisection of Chordal Rings -- Equation Satisfiability and Program Satisfiability for Finite Monoids -- XML Grammars -- Simplifying Flow Networks -- Balanced k-Colorings -- A Compositional Model for Confluent Dynamic Data-Flow Networks -- Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication -- Expressiveness of Updatable Timed Automata -- Iterative Arrays with Small Time Bounds -- Embedding Fibonacci Cubes into Hypercubes with ?(2cn) Faulty Nodes -- Periodic-Like Words -- The Monadic Theory of Morphic Infinite Words and Generalizations -- Optical Routing of Uniform Instances in Tori -- Factorizing Codes and Scht| zenberger Conjectures -- Compositional Characterizations of ?-Terms Using Intersection Types -- Time and Message Optimal Leader Election in Asynchronous Oriented Complete Networks -- Subtractive Reductions and Complete Problems for Counting Complexity Classes -- On the Autoreducibility of Random Sequences -- Iteration Theories of Boolean Functions -- An Algorithm Constructing the Semilinear Post for 2-Dim Reset/Transfer VASS -- NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs -- Explicit Fusions -- State Space Reduction Using Partial ?-Confluence -- Reducing the Number of Solutions of NP Functions -- Regular Collections of Message Sequence Charts -- Alternating and Empty Alternating Auxiliary Stack Automata -- Counter Machines: Decidable Properties and Applications to Verification Problems -- A Family of NFA's Which Need 2n -- ? Deterministic States -- Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring -- Matching Modulo Associativity and Idempotency Is NP-Complete -- On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems -- Algebraic and Uniqueness Properties of Parity Ordered Binary Decision Diagrams and Their Generalization -- Formal Series over Algebras -- ?-Calculus Synthesis -- The Infinite Versions of LogSpace ? P Are Consistent with the Axioms of Set Theory -- Timed Automata with Monotonic Activities -- On a Generalization of Bi-Complement Reducible Graphs -- Automatic Graphs and Graph D0L-Systems -- Bilinear Functions and Trees over the (max, +) Semiring -- Derivability in Locally Quantified Modal Logics via Translation in Set Theory -- ?-Calculus, Structured Coalgebras, and Minimal HD-Automata -- Informative Labeling Schemes for Graphs -- Separation Results for Rebound Automata -- Unary Pushdown Automata and Auxiliary Space Lower Bounds -- Binary Decision Diagrams by Shared Rewriting -- Verifying Single and Multi-mutator Garbage Collectors with Owicki-Gries in Isabelle/HOL -- Why so Many Temporal Logics Climb up the Trees? -- Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems -- A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism -- On Diving in Trees Thomas Schwentick -- Abstract Syntax and Variable Binding for Linear Binders -- Regularity of Congruential Graphs -- Sublinear Ambiguity -- An Automata-Based Recognition Algorithm for Semi-extended Regular Expressions.;

650 0 a| Computer sciencex| Mathematicsv| Congresses.=| ^A248247;

650 7 a| Computer sciencex| Mathematics.2| fast0| (OCoLC)fst00872460;

650 7 a| Theoretische Informatik.2| gnd0| (DE-588)4196735-5;

650 7 a| Kongress.2| gnd0| (DE-588)4130470-6;

650 17 a| Grondslagen.2| gtt;

650 7 a| Teoria da computacao.2| larpcal;

650 7 a| Matematica da computacao.2| larpcal;

650 7 a| Linguagem de programacao (outras)2| larpcal;

650 7 a| Computer sciencex| Mathematicsx| Congresses.2| nli;

650 7 a| Computational complexityx| Congresses.2| nli;

650 7 a| Informatiquex| Mathématiquesx| Congrès.2| ram;

655 4 a| Kongressz| Preßburgy| 2000.;

655 7 a| Conference papers and proceedings.2| fast0| (OCoLC)fst01423772;

655 7 a| Preßburg (2000)2| swd;

700 1 a| Nielsen, M.q| (Mogens),d| 1949-1| https://id.oclc.org/worldcat/entity/E39PCjFDY8FpTttQTTwQHtvdV3=| ^A370530;

700 1 a| Rovan, B.q| (Branislav)1| https://id.oclc.org/worldcat/entity/E39PCjv6tD38tqFw87VQb67gGb=| ^A206771;

830 0 a| Lecture notes in computer science ;v| 1893.=| ^A466336;

856 41 3| SpringerLinku| https://doi.org/10.1007/3-540-44612-5;

856 41 3| Table of contentsu| http://swbplus.bsz-bw.de/bsz086740008inh.htm;

856 41 u| http://link.springer-ny.com/link/service/series/0558/tocs/t1893.htmz| Restricted to Springer LINK subscribers;

856 41 u| http://link.springer.com/10.1007/3-540-44612-5z| eBook available for UOIT via SpringerLink. Click link to access;

856 4 3| Coveru| http://swbplus.bsz-bw.de/bsz086740008cov.htm;

856 4 3| Kapitel 1u| http://swbplus.bsz-bw.de/bsz086740008kap.htm;

938 a| Baker & Taylorb| BKTYc| 112.00d| 112.00i| 3540679014n| 0003600661s| active;

938 a| Brodartb| BRODn| 56287518c| $102.00;

938 a| Otto Harrassowitzb| HARRn| har005135296;

994 a| C0b| ERE;

596 a| 1;

998 a| 774142;

999 a| QA76.9.M35 S96 2000w| LCc| 1i| 30372010938337d| 3/18/2013f| 3/18/2013g| 1l| JGESm| JOYNERp| $85.68r| Ys| Yt| JGESBKu| 11/17/2000x| BOOKz| JSTACKSo| .STAFF. 0;

Mathematical foundations of computer science 2000 : 25th international symposium, MFCS 2000, Bratislava, Slovakia, August 28-September 1, 2000 : proceedings / Mogens Nielsen, Branislav Rovan (eds.).

Author/creator	Symposium on Mathematical Foundations of Computer Science (1972- )
Other author	Nielsen, M. (Mogens), 1949-
Other author	Rovan, B. (Branislav)
Format	Book
Publication Info	Berlin ; New York : Springer, ©2000.
Description	xiii, 710 pages : illustrations ; 24 cm.
Supplemental Content	SpringerLink
Supplemental Content	Table of contents
Supplemental Content	Restricted to Springer LINK subscribers
Supplemental Content	eBook available for UOIT via SpringerLink. Click link to access
Supplemental Content	Cover
Supplemental Content	Kapitel 1
Subjects	Computer science--Mathematics. --Congresses.

Portion of title	MFCS 2000
Series	Lecture notes in computer science, 0302-9743 ; 1893 Lecture notes in computer science ; 1893. ^A466336
Contents	Invited Talks -- Region Analysis and a ?-Calculus with Groups -- Abstract Data Types in Computer Algebra -- What Do We Learn from Experimental Algorithmics? -- And/Or Hierarchies and Round Abstraction -- Computational Politics: Electoral Systems -- 0-1 Laws for Fragments of Existential Second-Order Logic: A Survey -- On Algorithms and Interaction -- On the Use of Duality and Geometry in Layouts for ATM Networks -- Contributed Papers -- On the Lower Bounds for One-Way Quantum Automata -- Axiomatizing Fully Complete Models for ML Polymorphic Types -- Measure Theoretic Completeness Notions for the Exponential Time Classes -- Edge-Bisection of Chordal Rings -- Equation Satisfiability and Program Satisfiability for Finite Monoids -- XML Grammars -- Simplifying Flow Networks -- Balanced k-Colorings -- A Compositional Model for Confluent Dynamic Data-Flow Networks -- Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication -- Expressiveness of Updatable Timed Automata -- Iterative Arrays with Small Time Bounds -- Embedding Fibonacci Cubes into Hypercubes with ?(2cn) Faulty Nodes -- Periodic-Like Words -- The Monadic Theory of Morphic Infinite Words and Generalizations -- Optical Routing of Uniform Instances in Tori -- Factorizing Codes and Sch zenberger Conjectures -- Compositional Characterizations of ?-Terms Using Intersection Types -- Time and Message Optimal Leader Election in Asynchronous Oriented Complete Networks -- Subtractive Reductions and Complete Problems for Counting Complexity Classes -- On the Autoreducibility of Random Sequences -- Iteration Theories of Boolean Functions -- An Algorithm Constructing the Semilinear Post for 2-Dim Reset/Transfer VASS -- NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs -- Explicit Fusions -- State Space Reduction Using Partial ?-Confluence -- Reducing the Number of Solutions of NP Functions -- Regular Collections of Message Sequence Charts -- Alternating and Empty Alternating Auxiliary Stack Automata -- Counter Machines: Decidable Properties and Applications to Verification Problems -- A Family of NFA's Which Need 2n -- ? Deterministic States -- Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring -- Matching Modulo Associativity and Idempotency Is NP-Complete -- On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems -- Algebraic and Uniqueness Properties of Parity Ordered Binary Decision Diagrams and Their Generalization -- Formal Series over Algebras -- ?-Calculus Synthesis -- The Infinite Versions of LogSpace ? P Are Consistent with the Axioms of Set Theory -- Timed Automata with Monotonic Activities -- On a Generalization of Bi-Complement Reducible Graphs -- Automatic Graphs and Graph D0L-Systems -- Bilinear Functions and Trees over the (max, +) Semiring -- Derivability in Locally Quantified Modal Logics via Translation in Set Theory -- ?-Calculus, Structured Coalgebras, and Minimal HD-Automata -- Informative Labeling Schemes for Graphs -- Separation Results for Rebound Automata -- Unary Pushdown Automata and Auxiliary Space Lower Bounds -- Binary Decision Diagrams by Shared Rewriting -- Verifying Single and Multi-mutator Garbage Collectors with Owicki-Gries in Isabelle/HOL -- Why so Many Temporal Logics Climb up the Trees? -- Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems -- A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism -- On Diving in Trees Thomas Schwentick -- Abstract Syntax and Variable Binding for Linear Binders -- Regularity of Congruential Graphs -- Sublinear Ambiguity -- An Automata-Based Recognition Algorithm for Semi-extended Regular Expressions.
Bibliography note	Includes bibliographical references.
Other forms	Also available via the World Wide Web.
Genre/form	Kongress Preßburg 2000.
Genre/form	Conference papers and proceedings.
Genre/form	Preßburg (2000)
ISBN	3540679014
ISBN	9783540679011

Availability

Library	Location	Call Number	Status	Item Actions
Joyner	General Stacks	QA76.9.M35 S96 2000	✔ Available	Place Hold

Mathematical foundations of computer science 2000 : 25th international symposium, MFCS 2000, Bratislava, Slovakia, August 28-September 1, 2000 : proceedings / Mogens Nielsen, Branislav Rovan (eds.).

Click here for more information about this title

Availability