Search results for "MFCS"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Klaus Wich	Characterization of Context-Free Languages with Polynomially Bounded Ambiguity.	MFCS	2001	DBLP DOI BibTeX RDF
1	Leah Epstein, Rob van Stee	Lower Bounds for On-Line Single-Machine Scheduling.	MFCS	2001	DBLP DOI BibTeX RDF
1	Hervé Fournier	Quantifier Rank for Parity of Embedded Finite Models.	MFCS	2001	DBLP DOI BibTeX RDF	Ehrenfeucht-Fraïssé games, Uniform Quantifier Elimination, Connectivity, Reachability, Parity, Constraint databases
1	Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To	On-Line Scheduling with Tight Deadlines.	MFCS	2001	DBLP DOI BibTeX RDF
1	Ahmed Bouajjani, Peter Habermehl, Richard Mayr	Automatic Verification of Recursive Procedures with One Integer Parameter.	MFCS	2001	DBLP DOI BibTeX RDF
1	Dana S. Scott	A New Category for Semantics.	MFCS	2001	DBLP DOI BibTeX RDF
1	Martin Thimm	On the Approximability of the Steiner Tree Problem.	MFCS	2001	DBLP DOI BibTeX RDF	Minimum Steiner tree, Gadget reduction, Lower bounds, Approximability
1	Pavol Duris, Ján Manuch	On the Computational Complexity of Infinite Words.	MFCS	2001	DBLP DOI BibTeX RDF
1	Felipe Cucker, Dima Grigoriev	There Are No Sparse NPW-Hard Sets.	MFCS	2001	DBLP DOI BibTeX RDF
1	Mitsunori Ogihara, Seinosuke Toda	The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs.	MFCS	2001	DBLP DOI BibTeX RDF
1	Erik D. Demaine	Playing Games with Algorithms: Algorithmic Combinatorial Game Theory.	MFCS	2001	DBLP DOI BibTeX RDF
1	Nir Piterman, Moshe Y. Vardi	From Bidirectionality to Alternation.	MFCS	2001	DBLP DOI BibTeX RDF
1	Peter Bürgisser	On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity.	MFCS	2001	DBLP DOI BibTeX RDF
1	Peter Høyer	Introduction to Recent Quantum Algorithms.	MFCS	2001	DBLP DOI BibTeX RDF
1	Giovanni Di Crescenzo	Sharing One Secret vs. Sharing Many Secrets: Tight Bounds for the Max Improvement Ratio.	MFCS	2001	DBLP DOI BibTeX RDF	Multi-Secret Sharing, Cryptography, Secret Sharing
1	Martin Hofmann 0001	The Strength of Non-size-increasing Computation (Introduction and Summary).	MFCS	2001	DBLP DOI BibTeX RDF	semantics AMS Classification: 03D15, 03C13, computational complexity, 68Q15, higher-order functions, finite model, 68Q55
1	Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege	Refined Search Tree Technique for DOMINATING SET on Planar Graphs.	MFCS	2001	DBLP DOI BibTeX RDF	planar graph, dominating set, search tree, fixed parameter algorithm
1	Sven Oliver Krumke, Willem de Paepe, Diana Poensgen, Leen Stougie	News from the Online Traveling Repairman.	MFCS	2001	DBLP DOI BibTeX RDF
1	Julien Cervelle, Bruno Durand 0001, Enrico Formenti	Algorithmic Information Theory and Cellular Automata Dynamics.	MFCS	2001	DBLP DOI BibTeX RDF	topology, cellular automata, Kolmogorov complexity, discrete dynamical systems
1	Robert Rettinger, Xizhong Zheng	Hierarchy of Monotonically Computable Real Numbers.	MFCS	2001	DBLP DOI BibTeX RDF
1	Andreas Klein 0001, Martin Kutrib	A Time Hierarchy for Bounded One-Way Cellular Automata.	MFCS	2001	DBLP DOI BibTeX RDF	time hierarchies, computational complexity, cellular automata, Models of Computation
1	Burkhard Monien, Robert Preis	Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs.	MFCS	2001	DBLP DOI BibTeX RDF	local improvement, graph partitioning, regular graphs, bisection width
1	Wolfgang Espelage, Egon Wanke	A 3-Approximation Algorithm for Movement Minimization in Conveyor Flow Shop Processing.	MFCS	2001	DBLP DOI BibTeX RDF
1	Amos Fiat	Some Recent Results on Data Mining and Search.	MFCS	2001	DBLP DOI BibTeX RDF
1	Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns	Analysis Problems for Sequential Dynamical Systems and Communicating State Machines.	MFCS	2001	DBLP DOI BibTeX RDF
1	Klaus Sutner	The Size of Power Automata.	MFCS	2001	DBLP DOI BibTeX RDF
1	Thanh Minh Hoang, Thomas Thierauf	The Complexity of the Minimal Polynomial.	MFCS	2001	DBLP DOI BibTeX RDF
1	Kazuyuki Amano, Tsukuru Hirosawa, Yusuke Watanabe, Akira Maruoka	The Computational Power of a Family of Decision Forests.	MFCS	2001	DBLP DOI BibTeX RDF
1	Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini	Converting Two-Way Nondeterministic Unary Automata into Simpler Automata.	MFCS	2001	DBLP DOI BibTeX RDF	unary languages, formal languages, finite state automata
1	Véronique Bruyère, Olivier Carton	Automata on Linear Orderings.	MFCS	2001	DBLP DOI BibTeX RDF
1	Henrik Brosenne, Matthias Homeister, Stephan Waack	Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds.	MFCS	2001	DBLP DOI BibTeX RDF
1	Jarkko Kari	Synchronizing Finite Automata on Eulerian Digraphs.	MFCS	2001	DBLP DOI BibTeX RDF
1	Albert Atserias	Improved Bounds on the Weak Pigeonhole Principle and Infinitely Many Primes from Weaker Axioms.	MFCS	2001	DBLP DOI BibTeX RDF	Weak Pigeonhole Principle, Proof Complexity, Bounded Arithmetic
1	Andris Ambainis, Arnolds Kikusts	Exact Results for Accepting Probabilities of Quantum Automata.	MFCS	2001	DBLP DOI BibTeX RDF
1	Vasco Brattka	Computable Versions of Baire's Category Theorem.	MFCS	2001	DBLP DOI BibTeX RDF	functional analysis, computable analysis
1	Markus Bläser	Computing Reciprocals of Bivariate Power Series.	MFCS	2001	DBLP DOI BibTeX RDF
1	Markus Lohrey	Word Problems for 2-Homogeneous Monoids and Symmetric Logspace.	MFCS	2001	DBLP DOI BibTeX RDF
1	Todd Ebert, Heribert Vollmer	On the Autoreducibility of Random Sequences.	MFCS	2000	DBLP DOI BibTeX RDF
1	Markus Holzer 0001, Pierre McKenzie	Alternating and Empty Alternating Auxiliary Stack Automata.	MFCS	2000	DBLP DOI BibTeX RDF
1	Werner Kuich	Formal Series over Algebras.	MFCS	2000	DBLP DOI BibTeX RDF
1	Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit 0001	Expressiveness of Updatable Timed Automata.	MFCS	2000	DBLP DOI BibTeX RDF
1	Therese C. Biedl, Brona Brejová, Tomás Vinar	Simplifying Flow Networks.	MFCS	2000	DBLP DOI BibTeX RDF
1	Francesc Comellas, Margarida Mitjana, Lata Narayanan, Jaroslav Opatrny	Optical Routing of Uniform Instances in Tori.	MFCS	2000	DBLP DOI BibTeX RDF
1	Petr Savický, Detlef Sieling	A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism.	MFCS	2000	DBLP DOI BibTeX RDF
1	David Peleg	Informative Labeling Schemes for Graphs.	MFCS	2000	DBLP DOI BibTeX RDF
1	Orna Kupferman, Moshe Y. Vardi	µ-Calculus Synthesis.	MFCS	2000	DBLP DOI BibTeX RDF
1	Ondrej Klíma 0001, Jirí Srba	Matching Modulo Associativity and Idempotency Is NP-Complete.	MFCS	2000	DBLP DOI BibTeX RDF
1	Giovanni Pighizzini	Unary Pushdown Automata and Auxiliary Space Lower Bounds.	MFCS	2000	DBLP DOI BibTeX RDF
1	Olivier Ly	Automatic Graphs and Graph D0L-Systems.	MFCS	2000	DBLP DOI BibTeX RDF
1	Thomas Buchholz, Andreas Klein 0001, Martin Kutrib	Iterative Arrays with Small Time Bounds.	MFCS	2000	DBLP DOI BibTeX RDF
1	Angelo Montanari, Alberto Policriti, Matteo Slanina	Derivability in Locally Quantified Modal Logics via Translation in Set Theory.	MFCS	2000	DBLP DOI BibTeX RDF
1	Klaus Wich	Sublinear Ambiguity.	MFCS	2000	DBLP DOI BibTeX RDF
1	Holger Petersen 0001	Separation Results for Rebound Automata.	MFCS	2000	DBLP DOI BibTeX RDF
1	Klaus Ambos-Spies	Measure Theoretic Completeness Notions for the Exponential Time Classes.	MFCS	2000	DBLP DOI BibTeX RDF
1	Alain Finkel, Grégoire Sutre	An Algorithm Constructing the Semilinear Post* for 2-Dim Reset/Transfer VASS.	MFCS	2000	DBLP DOI BibTeX RDF
1	Shmuel Zaks	On the Use of Duality and Geometry in Layouts for ATM Networks.	MFCS	2000	DBLP DOI BibTeX RDF
1	James H. Davenport	Abstract Data Types in Computer Algebra.	MFCS	2000	DBLP DOI BibTeX RDF
1	Steffen Reith, Heribert Vollmer	Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems.	MFCS	2000	DBLP DOI BibTeX RDF
1	Jesper G. Henriksen, Madhavan Mukund, K. Narayan Kumar, P. S. Thiagarajan	Regular Collections of Message Sequence Charts.	MFCS	2000	DBLP DOI BibTeX RDF
1	Phokion G. Kolaitis, Moshe Y. Vardi	0-1 Laws for Fragments of Existential Second-Order Logic: A Survey.	MFCS	2000	DBLP DOI BibTeX RDF
1	Lane A. Hemaspaandra, Mitsunori Ogihara, Gerd Wechsung	Reducing the Number of Solutions of NP Functions.	MFCS	2000	DBLP DOI BibTeX RDF
1	Thomas Schwentick	On Diving in Trees.	MFCS	2000	DBLP DOI BibTeX RDF
1	Jan Friso Groote, Jaco van de Pol	State Space Reduction Using Partial tau-Confluence.	MFCS	2000	DBLP DOI BibTeX RDF
1	Lali Barrière, Josep Fàbrega	Edge-Bisection of Chordal Rings.	MFCS	2000	DBLP DOI BibTeX RDF
1	Philippa Gardner, Lucian Wischik	Explicit Fusions.	MFCS	2000	DBLP DOI BibTeX RDF
1	Farid M. Ablayev, Aida Gainutdinova	On the Lower Bounds for One-Way Quantum Automata.	MFCS	2000	DBLP DOI BibTeX RDF
1	David A. Mix Barrington, Pierre McKenzie, Cristopher Moore, Pascal Tesson, Denis Thérien	Equation Satisfiability and Program Satisfiability for Finite Monoids.	MFCS	2000	DBLP DOI BibTeX RDF
1	Jaco van de Pol, Hans Zantema	Binary Decision Diagrams by Shard Rewriting.	MFCS	2000	DBLP DOI BibTeX RDF
1	Edith Hemaspaandra, Lane A. Hemaspaandra	Computational Politics: Electoral Systems.	MFCS	2000	DBLP DOI BibTeX RDF
1	Olivier Carton, Wolfgang Thomas	The Monadic Theory of Morphic Infinite Words and Generalizations.	MFCS	2000	DBLP DOI BibTeX RDF
1	Rostislav Caha, Petr Gregor	Embedding Fibonacci Cubes into Hypercubes with Omega(2cn) Faulty Nodes.	MFCS	2000	DBLP DOI BibTeX RDF
1	Jean Berstel, Luc Boasson	XML Grammars.	MFCS	2000	DBLP DOI BibTeX RDF
1	Hiroaki Yamamoto	An Automata-Based Recognition Algorithm for Semi-extended Regular Expressions.	MFCS	2000	DBLP DOI BibTeX RDF
1	Radu Grosu	And/Or Hierarchies and Round Abstraction.	MFCS	2000	DBLP DOI BibTeX RDF
1	Mariangiola Dezani-Ciancaglini, Furio Honsell, Yoko Motohama	Compositional Characterizations of lambda-Terms Using Intersection Types.	MFCS	2000	DBLP DOI BibTeX RDF
1	Oscar H. Ibarra, Jianwen Su, Zhe Dang, Tevfik Bultan, Richard A. Kemmerer	Conter Machines: Decidable Properties and Applications to Verification Problems.	MFCS	2000	DBLP DOI BibTeX RDF
1	Vadim V. Lozin	On a Generalization of Bi-Complement Reducible Graphs.	MFCS	2000	DBLP DOI BibTeX RDF
1	Frank S. de Boer, Marcello M. Bonsangue	A Compositional Model for Confluent Dynamic Data-Flow Networks.	MFCS	2000	DBLP DOI BibTeX RDF
1	Ugo Montanari, Marco Pistore	pi-Calculus, Structured Coalgebras, and Minimal HD-Automata.	MFCS	2000	DBLP DOI BibTeX RDF
1	Leonor Prensa Nieto, Javier Esparza	Verifying Single and Multi-mutator Garbage Collectors with Owicki-Gries in Isabelle/HOL.	MFCS	2000	DBLP DOI BibTeX RDF
1	Mogens Nielsen, Branislav Rovan (eds.)	Mathematical Foundations of Computer Science 2000, 25th International Symposium, MFCS 2000, Bratislava, Slovakia, August 28 - September 1, 2000, Proceedings	MFCS	2000	DBLP DOI BibTeX RDF
1	Kazuo Iwama, Akihiro Matsuura, Mike Paterson	A Family of NFA's Which Need 2n -alpha Deterministic States.	MFCS	2000	DBLP DOI BibTeX RDF
1	Klaus Jansen, Lorant Porkolab	Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring.	MFCS	2000	DBLP DOI BibTeX RDF
1	Ruggero Lanotte, Andrea Maggiolo-Schettini	Timed Automata with Monotonic Activities.	MFCS	2000	DBLP DOI BibTeX RDF
1	Sven Kosub	On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems.	MFCS	2000	DBLP DOI BibTeX RDF
1	Sabrina Mantaci, Vincent D. Blondel, Jean Mairesse	Bilinear Functions and Trees over the (max, +) Semiring.	MFCS	2000	DBLP DOI BibTeX RDF
1	Alexander Moshe Rabinovich, Shahar Maoz	Why so Many Temporal Logics Climb up the Trees?	MFCS	2000	DBLP DOI BibTeX RDF
1	Clelia de Felice	Factorizing Codes and Schützenberger Conjectures.	MFCS	2000	DBLP DOI BibTeX RDF
1	Beate Bollig	Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication.	MFCS	2000	DBLP DOI BibTeX RDF
1	Zoltán Ésik	Iteration Theories of Boolean Functions.	MFCS	2000	DBLP DOI BibTeX RDF
1	Grégory Lafitte, Jacques Mazoyer	The Infinite Versions of LOGSPACE != P Are Consistent with the Axioms of Set Theory.	MFCS	2000	DBLP DOI BibTeX RDF
1	Silvano Dal-Zilio, Andrew D. Gordon 0001	Region Analysis and a pi-Calculus wiht Groups.	MFCS	2000	DBLP DOI BibTeX RDF
1	Stefan Dobrev	Time and Message Optimal Leader Election in Asynchronous Oriented Complete Networks.	MFCS	2000	DBLP DOI BibTeX RDF
1	Samson Abramsky, Marina Lenisa	Axiomatizing Fully Complete Models for ML Polymorphic Types.	MFCS	2000	DBLP DOI BibTeX RDF
1	Daniel Král	Algebraic and Uniqueness Properties of Parity Ordered Binary Decision Diagrams and Their Generalization.	MFCS	2000	DBLP DOI BibTeX RDF
1	Tanguy Urvoy	Regularity of Congruential Graphs.	MFCS	2000	DBLP DOI BibTeX RDF
1	Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang	Balanced k-Colorings.	MFCS	2000	DBLP DOI BibTeX RDF
1	Dimitris Fotakis 0001, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis	NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs.	MFCS	2000	DBLP DOI BibTeX RDF
1	Arturo Carpi, Aldo de Luca	Periodic-Like Words.	MFCS	2000	DBLP DOI BibTeX RDF
1	Camil Demetrescu, Giuseppe F. Italiano	What Do We Learn from Experimental Algorithmics?	MFCS	2000	DBLP DOI BibTeX RDF

Publications at "MFCS"( http://dblp.L3S.de/Venues/MFCS )