Conferences in DBLP
Silvano Dal-Zilio , Andrew D. Gordon Region Analysis and a pi-Calculus wiht Groups. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:1-20 [Conf ] James H. Davenport Abstract Data Types in Computer Algebra. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:21-35 [Conf ] Camil Demetrescu , Giuseppe F. Italiano What Do We Learn from Experimental Algorithmics? [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:36-51 [Conf ] Radu Grosu And/Or Hierarchies and Round Abstraction. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:52-63 [Conf ] Edith Hemaspaandra , Lane A. Hemaspaandra Computational Politics: Electoral Systems. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:64-83 [Conf ] Phokion G. Kolaitis , Moshe Y. Vardi 0-1 Laws for Fragments of Existential Second-Order Logic: A Survey. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:84-98 [Conf ] Jan van Leeuwen , Jirí Wiedermann On Algorithms and Interaction. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:99-113 [Conf ] Shmuel Zaks On the Use of Duality and Geometry in Layouts for ATM Networks. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:114-131 [Conf ] Farid M. Ablayev , Aida Gainutdinova On the Lower Bounds for One-Way Quantum Automata. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:132-140 [Conf ] Samson Abramsky , Marina Lenisa Axiomatizing Fully Complete Models for ML Polymorphic Types. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:141-151 [Conf ] Klaus Ambos-Spies Measure Theoretic Completeness Notions for the Exponential Time Classes. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:152-161 [Conf ] Lali Barrière , Josep Fàbrega Edge-Bisection of Chordal Rings. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:162-171 [Conf ] David A. Mix Barrington , Pierre McKenzie , Cristopher Moore , Pascal Tesson , Denis Thérien Equation Satisfiability and Program Satisfiability for Finite Monoids. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:172-181 [Conf ] Jean Berstel , Luc Boasson XML Grammars. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:182-191 [Conf ] Therese C. Biedl , Brona Brejová , Tomás Vinar Simplifying Flow Networks. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:192-201 [Conf ] Therese C. Biedl , Eowyn Cenek , Timothy M. Chan , Erik D. Demaine , Martin L. Demaine , Rudolf Fleischer , Ming-wei Wang Balanced k -Colorings. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:202-211 [Conf ] Frank S. de Boer , Marcello M. Bonsangue A Compositional Model for Confluent Dynamic Data-Flow Networks. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:212-221 [Conf ] Beate Bollig Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:222-231 [Conf ] Patricia Bouyer , Catherine Dufourd , Emmanuel Fleury , Antoine Petit Expressiveness of Updatable Timed Automata. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:232-242 [Conf ] Thomas Buchholz , Andreas Klein , Martin Kutrib Iterative Arrays with Small Time Bounds. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:243-252 [Conf ] Rostislav Caha , Petr Gregor Embedding Fibonacci Cubes into Hypercubes with Omega (2^{cn} ) Faulty Nodes. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:253-263 [Conf ] Arturo Carpi , Aldo de Luca Periodic-Like Words. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:264-274 [Conf ] Olivier Carton , Wolfgang Thomas The Monadic Theory of Morphic Infinite Words and Generalizations. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:275-284 [Conf ] Francesc Comellas , Margarida Mitjana , Lata Narayanan , Jaroslav Opatrny Optical Routing of Uniform Instances in Tori. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:285-294 [Conf ] Clelia de Felice Factorizing Codes and Schützenberger Conjectures. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:295-303 [Conf ] Mariangiola Dezani-Ciancaglini , Furio Honsell , Yoko Motohama Compositional Characterizations of lambda-Terms Using Intersection Types. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:304-313 [Conf ] Stefan Dobrev Time and Message Optimal Leader Election in Asynchronous Oriented Complete Networks. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:314-322 [Conf ] Arnaud Durand , Miki Hermann , Phokion G. Kolaitis Subtractive Reductions and Complete Problems for Counting Complexity Classes. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:323-332 [Conf ] Todd Ebert , Heribert Vollmer On the Autoreducibility of Random Sequences. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:333-342 [Conf ] Zoltán Ésik Iteration Theories of Boolean Functions. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:343-352 [Conf ] Alain Finkel , Grégoire Sutre An Algorithm Constructing the Semilinear Post^{*} for 2-Dim Reset/Transfer VASS. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:353-362 [Conf ] Dimitris Fotakis , Sotiris E. Nikoletseas , Vicky G. Papadopoulou , Paul G. Spirakis NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:363-372 [Conf ] Philippa Gardner , Lucian Wischik Explicit Fusions. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:373-382 [Conf ] Jan Friso Groote , Jaco van de Pol State Space Reduction Using Partial tau-Confluence. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:383-393 [Conf ] Lane A. Hemaspaandra , Mitsunori Ogihara , Gerd Wechsung Reducing the Number of Solutions of NP Functions. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:394-404 [Conf ] Jesper G. Henriksen , Madhavan Mukund , K. Narayan Kumar , P. S. Thiagarajan Regular Collections of Message Sequence Charts. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:405-414 [Conf ] Markus Holzer , Pierre McKenzie Alternating and Empty Alternating Auxiliary Stack Automata. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:415-425 [Conf ] Oscar H. Ibarra , Jianwen Su , Zhe Dang , Tevfik Bultan , Richard A. Kemmerer Conter Machines: Decidable Properties and Applications to Verification Problems. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:426-435 [Conf ] Kazuo Iwama , Akihiro Matsuura , Mike Paterson A Family of NFA's Which Need 2^{n} -alpha Deterministic States. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:436-445 [Conf ] Klaus Jansen , Lorant Porkolab Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:446-455 [Conf ] Ondrej Klíma , Jirí Srba Matching Modulo Associativity and Idempotency Is NP-Complete. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:456-466 [Conf ] Sven Kosub On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:467-476 [Conf ] Daniel Král Algebraic an Uniqueness Properties of Parity Ordered Binary Decision Diagrams and Their Generalization. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:477-487 [Conf ] Werner Kuich Formal Series over Algebras. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:488-496 [Conf ] Orna Kupferman , Moshe Y. Vardi µ-Calculus Synthesis. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:497-507 [Conf ] Grégory Lafitte , Jacques Mazoyer The Infinite Versions of LOGSPACE != P Are Consistent with the Axioms of Set Theory. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:508-517 [Conf ] Ruggero Lanotte , Andrea Maggiolo-Schettini Timed Automata with Monotonic Activities. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:518-527 [Conf ] Vadim V. Lozin On a Generalization of Bi-Complement Reducible Graphs. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:528-538 [Conf ] Olivier Ly Automatic Graphs and Graph D 0L -Systems. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:539-548 [Conf ] Sabrina Mantaci , Vincent D. Blondel , Jean Mairesse Bilinear Functions and Trees over the (max, +) Semiring. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:549-558 [Conf ] Angelo Montanari , Alberto Policriti , Matteo Slanina Derivability in Locally Quantified Modal Logics via Translation in Set Theory. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:559-568 [Conf ] Ugo Montanari , Marco Pistore pi-Calculus, Structured Coalgebras, and Minimal HD-Automata. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:569-578 [Conf ] David Peleg Informative Labeling Schemes for Graphs. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:579-588 [Conf ] Holger Petersen Separation Results for Rebound Automata. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:589-598 [Conf ] Giovanni Pighizzini Unary Pushdown Automata and Auxiliary Space Lower Bounds. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:599-608 [Conf ] Jaco van de Pol , Hans Zantema Binary Decision Diagrams by Shard Rewriting. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:609-618 [Conf ] Leonor Prensa Nieto , Javier Esparza Verifying Single and Multi-mutator Garbage Collectors with Owicki-Gries in Isabelle/HOL. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:619-628 [Conf ] Alexander Moshe Rabinovich , Shahar Maoz Why so Many Temporal Logics Climb up the Trees? [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:629-639 [Conf ] Steffen Reith , Heribert Vollmer Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:640-649 [Conf ] Petr Savický , Detlef Sieling A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:650-659 [Conf ] Thomas Schwentick On Diving in Trees. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:660-669 [Conf ] Miki Tanaka Abstract Syntax and Variable Binding for Linear Binders. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:670-679 [Conf ] Tanguy Urvoy Regularity of Congruential Graphs. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:680-689 [Conf ] Klaus Wich Sublinear Ambiguity. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:690-698 [Conf ] Hiroaki Yamamoto An Automata-Based Recognition Algorithm for Semi-extended Regular Expressions. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:699-708 [Conf ]