- Edith Hemaspaandra, Lane A. Hemaspaandra
:
Computational Politics: Electoral Systems. MFCS 2000: 64-83 - Lane A. Hemaspaandra
, Mitsunori Ogihara
, Gerd Wechsung:
Reducing the Number of Solutions of NP Functions. MFCS 2000: 394-404 - Jesper G. Henriksen, Madhavan Mukund, K. Narayan Kumar, P. S. Thiagarajan:
Regular Collections of Message Sequence Charts. MFCS 2000: 405-414 - Markus Holzer
, Pierre McKenzie:
Alternating and Empty Alternating Auxiliary Stack Automata. MFCS 2000: 415-425 - Oscar H. Ibarra, Jianwen Su, Zhe Dang, Tevfik Bultan, Richard A. Kemmerer:
Conter Machines: Decidable Properties and Applications to Verification Problems. MFCS 2000: 426-435 - Kazuo Iwama, Akihiro Matsuura, Mike Paterson:
A Family of NFA's Which Need 2n -alpha Deterministic States. MFCS 2000: 436-445 - Klaus Jansen, Lorant Porkolab:
Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring. MFCS 2000: 446-455 - Ondrej Klíma, Jirí Srba:
Matching Modulo Associativity and Idempotency Is NP-Complete. MFCS 2000: 456-466 - Phokion G. Kolaitis, Moshe Y. Vardi:
0-1 Laws for Fragments of Existential Second-Order Logic: A Survey. MFCS 2000: 84-98 - Sven Kosub
:
On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems. MFCS 2000: 467-476 - Daniel Král
:
Algebraic and Uniqueness Properties of Parity Ordered Binary Decision Diagrams and Their Generalization. MFCS 2000: 477-487 - Werner Kuich:
Formal Series over Algebras. MFCS 2000: 488-496 - Orna Kupferman, Moshe Y. Vardi:
µ-Calculus Synthesis. MFCS 2000: 497-507 - Grégory Lafitte, Jacques Mazoyer:
The Infinite Versions of LOGSPACE != P Are Consistent with the Axioms of Set Theory. MFCS 2000: 508-517 - Ruggero Lanotte
, Andrea Maggiolo-Schettini:
Timed Automata with Monotonic Activities. MFCS 2000: 518-527 - Jan van Leeuwen, Jirí Wiedermann
:
On Algorithms and Interaction. MFCS 2000: 99-113 - Vadim V. Lozin
:
On a Generalization of Bi-Complement Reducible Graphs. MFCS 2000: 528-538 - Olivier Ly:
Automatic Graphs and Graph D0L-Systems. MFCS 2000: 539-548 - Sabrina Mantaci, Vincent D. Blondel, Jean Mairesse:
Bilinear Functions and Trees over the (max, +) Semiring. MFCS 2000: 549-558 - Ugo Montanari, Marco Pistore
:
pi-Calculus, Structured Coalgebras, and Minimal HD-Automata. MFCS 2000: 569-578 - Angelo Montanari, Alberto Policriti, Matteo Slanina:
Derivability in Locally Quantified Modal Logics via Translation in Set Theory. MFCS 2000: 559-568 - Leonor Prensa Nieto, Javier Esparza
:
Verifying Single and Multi-mutator Garbage Collectors with Owicki-Gries in Isabelle/HOL. MFCS 2000: 619-628 - David Peleg:
Informative Labeling Schemes for Graphs. MFCS 2000: 579-588 - Holger Petersen:
Separation Results for Rebound Automata. MFCS 2000: 589-598 - Giovanni Pighizzini:
Unary Pushdown Automata and Auxiliary Space Lower Bounds. MFCS 2000: 599-608 - Jaco van de Pol, Hans Zantema:
Binary Decision Diagrams by Shard Rewriting. MFCS 2000: 609-618 - Alexander Moshe Rabinovich
, Shahar Maoz:
Why so Many Temporal Logics Climb up the Trees? MFCS 2000: 629-639 - Steffen Reith, Heribert Vollmer
:
Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems. MFCS 2000: 640-649 - Petr Savický, Detlef Sieling:
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism. MFCS 2000: 650-659 - Thomas Schwentick:
On Diving in Trees. MFCS 2000: 660-669