- 2000
- Farid M. Ablayev, Aida Gainutdinova:
On the Lower Bounds for One-Way Quantum Automata. MFCS 2000: 132-140 - Samson Abramsky
, Marina Lenisa:
Axiomatizing Fully Complete Models for ML Polymorphic Types. MFCS 2000: 141-151 - Klaus Ambos-Spies:
Measure Theoretic Completeness Notions for the Exponential Time Classes. MFCS 2000: 152-161 - Lali Barrière, Josep Fàbrega
:
Edge-Bisection of Chordal Rings. MFCS 2000: 162-171 - David A. Mix Barrington, Pierre McKenzie, Cristopher Moore, Pascal Tesson, Denis Thérien:
Equation Satisfiability and Program Satisfiability for Finite Monoids. MFCS 2000: 172-181 - Jean Berstel, Luc Boasson:
XML Grammars. MFCS 2000: 182-191 - Therese C. Biedl, Brona Brejová
, Tomás Vinar
:
Simplifying Flow Networks. MFCS 2000: 192-201 - Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang:
Balanced k-Colorings. MFCS 2000: 202-211 - Frank S. de Boer, Marcello M. Bonsangue
:
A Compositional Model for Confluent Dynamic Data-Flow Networks. MFCS 2000: 212-221 - Beate Bollig:
Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. MFCS 2000: 222-231 - Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit:
Expressiveness of Updatable Timed Automata. MFCS 2000: 232-242 - Thomas Buchholz, Andreas Klein, Martin Kutrib
:
Iterative Arrays with Small Time Bounds. MFCS 2000: 243-252 - Rostislav Caha, Petr Gregor
:
Embedding Fibonacci Cubes into Hypercubes with Omega(2cn) Faulty Nodes. MFCS 2000: 253-263 - Arturo Carpi, Aldo de Luca:
Periodic-Like Words. MFCS 2000: 264-274 - Olivier Carton
, Wolfgang Thomas:
The Monadic Theory of Morphic Infinite Words and Generalizations. MFCS 2000: 275-284 - Francesc Comellas, Margarida Mitjana
, Lata Narayanan, Jaroslav Opatrny:
Optical Routing of Uniform Instances in Tori. MFCS 2000: 285-294 - Silvano Dal-Zilio
, Andrew D. Gordon:
Region Analysis and a pi-Calculus wiht Groups. MFCS 2000: 1-20 - James H. Davenport
:
Abstract Data Types in Computer Algebra. MFCS 2000: 21-35 - Camil Demetrescu, Giuseppe F. Italiano
:
What Do We Learn from Experimental Algorithmics? MFCS 2000: 36-51 - Mariangiola Dezani-Ciancaglini, Furio Honsell, Yoko Motohama:
Compositional Characterizations of lambda-Terms Using Intersection Types. MFCS 2000: 304-313 - Stefan Dobrev:
Time and Message Optimal Leader Election in Asynchronous Oriented Complete Networks. MFCS 2000: 314-322 - Arnaud Durand, Miki Hermann, Phokion G. Kolaitis:
Subtractive Reductions and Complete Problems for Counting Complexity Classes. MFCS 2000: 323-332 - Todd Ebert, Heribert Vollmer
:
On the Autoreducibility of Random Sequences. MFCS 2000: 333-342 - Zoltán Ésik:
Iteration Theories of Boolean Functions. MFCS 2000: 343-352 - Clelia de Felice
:
Factorizing Codes and Schützenberger Conjectures. MFCS 2000: 295-303 - Alain Finkel, Grégoire Sutre:
An Algorithm Constructing the Semilinear Post* for 2-Dim Reset/Transfer VASS. MFCS 2000: 353-362 - Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis:
NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs. MFCS 2000: 363-372 - Philippa Gardner, Lucian Wischik:
Explicit Fusions. MFCS 2000: 373-382 - Jan Friso Groote
, Jaco van de Pol:
State Space Reduction Using Partial tau-Confluence. MFCS 2000: 383-393 - Radu Grosu:
And/Or Hierarchies and Round Abstraction. MFCS 2000: 52-63