Search results for "MFCS"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Magnús M. Halldórsson, Guy Kortsarz	Multicoloring: Problems and Techniques.	MFCS	2004	DBLP DOI BibTeX RDF
1	Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Raymond H. Putra	Universal Test for Quantum One-Way Permutations.	MFCS	2004	DBLP DOI BibTeX RDF
1	Eduardo Bonelli, Adriana B. Compagnoni, Mariangiola Dezani-Ciancaglini, Pablo Garralda	Boxed Ambients with Communication Interfaces.	MFCS	2004	DBLP DOI BibTeX RDF
1	Rodney G. Downey	Some Recent Progress in Algorithmic Randomness.	MFCS	2004	DBLP DOI BibTeX RDF
1	Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel	All Superlinear Inverse Schemes Are coNP-Hard.	MFCS	2004	DBLP DOI BibTeX RDF
1	Emo Welzl	Geometric Optimization and Unique Sink Orientations of Cubes p.	MFCS	2004	DBLP DOI BibTeX RDF
1	Martin Beaudry, José M. Fernandez 0001, Markus Holzer 0001	A Common Algebraic Description for Probabilistic and Quantum Computations (Extended Abstract).	MFCS	2004	DBLP DOI BibTeX RDF
1	Wim Martens, Frank Neven, Thomas Schwentick	Complexity of Decision Problems for Simple Regular Expressions.	MFCS	2004	DBLP DOI BibTeX RDF
1	John M. Hitchcock, María López-Valdés, Elvira Mayordomo	Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets.	MFCS	2004	DBLP DOI BibTeX RDF
1	André Gronemeier	Approximating Boolean Functions by OBDDs.	MFCS	2004	DBLP DOI BibTeX RDF
1	Victor Poupet	Simulating 3D Cellular Automata with 2D Cellular Automata.	MFCS	2004	DBLP DOI BibTeX RDF
1	Klaus Ambos-Spies, Edgar Busse	Computational Aspects of Disjunctive Sequences.	MFCS	2004	DBLP DOI BibTeX RDF
1	Benjamin Doerr, Nils Hebbinghaus, Sören Werth	Improved Bounds and Schemes for the Declustering Problem.	MFCS	2004	DBLP DOI BibTeX RDF
1	Kristoffer Arnsfelt Hansen, Peter Bro Miltersen	Some Meet-in-the-Middle Circuit Lower Bounds.	MFCS	2004	DBLP DOI BibTeX RDF
1	Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino	Generating Paths and Cuts in Multi-pole (Di)graphs.	MFCS	2004	DBLP DOI BibTeX RDF
1	Zoltán Ésik, Werner Kuich	An Algebraic Generalization of omega-Regular Languages.	MFCS	2004	DBLP DOI BibTeX RDF
1	Therese C. Biedl, Masud Hasan, Alejandro López-Ortiz	Efficient View Point Selection for Silhouettes of Convex Polyhedra.	MFCS	2004	DBLP DOI BibTeX RDF
1	Stephen D. Travers	The Complexity of Membership Problems for Circuits over Sets of Integers.	MFCS	2004	DBLP DOI BibTeX RDF
1	Alina Beygelzimer, Mitsunori Ogihara	The Enumerability of P Collapses P to NC.	MFCS	2004	DBLP DOI BibTeX RDF
1	Béatrice Bouchou, Denio Duarte, Mirian Halfeld Ferrari Alves, Dominique Laurent 0001, Martin A. Musicante	Schema Evolution for XML: A Consistency-Preserving Approach.	MFCS	2004	DBLP DOI BibTeX RDF
1	Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi	Complexity Results in Graph Reconstruction.	MFCS	2004	DBLP DOI BibTeX RDF
1	Lucian Ilie, Pascal Ochem, Jeffrey O. Shallit	A Generalization of Repetition Threshold.	MFCS	2004	DBLP DOI BibTeX RDF
1	Petr Hlinený	Crossing Number Is Hard for Cubic Graphs.	MFCS	2004	DBLP DOI BibTeX RDF	NP-completeness, Crossing number, cubic graph
1	Alexander Okhotin	The Dual of Concatenation.	MFCS	2004	DBLP DOI BibTeX RDF
1	Hugo Gimbert, Wieslaw Zielonka	When Can You Play Positionally?	MFCS	2004	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Fedor V. Fomin	Equitable Colorings of Bounded Treewidth Graphs.	MFCS	2004	DBLP DOI BibTeX RDF
1	Martin Gairing, Thomas Lücking 0001, Marios Mavronicolas, Burkhard Monien	The Price of Anarchy for Polynomial Social Cost.	MFCS	2004	DBLP DOI BibTeX RDF
1	Hans-Joachim Böckenhauer, Dirk Bongartz	Protein Folding in the HP Model on Grid Lattices with Diagonals (Extended Abstract).	MFCS	2004	DBLP DOI BibTeX RDF
1	Nadine Baumann, Ekkehard Köhler	Approximating Earliest Arrival Flows with Flow-Dependent Transit Times.	MFCS	2004	DBLP DOI BibTeX RDF
1	Therese C. Biedl, Anna Lubiw, Michael J. Spriggs	Angles and Lengths in Reconfigurations of Polygons and Polyhedra.	MFCS	2004	DBLP DOI BibTeX RDF
1	Uzi Vishkin	PRAM-On-Chip: A Quest for Not-So-Obvious Non-obviousness.	MFCS	2004	DBLP DOI BibTeX RDF
1	Matthew Brand, Sarah F. Frisken Gibson, Neal Lesh, Joe Marks, Daniel Nikovski, Ronald N. Perry, Jonathan S. Yedidia	Theory and Applied Computing: Observations and Anecdotes.	MFCS	2004	DBLP DOI BibTeX RDF
1	Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov	A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games.	MFCS	2004	DBLP DOI BibTeX RDF
1	Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	The Bidimensional Theory of Bounded-Genus Graphs.	MFCS	2004	DBLP DOI BibTeX RDF
1	Michael Domaratzki, Kai Salomaa	Decidability of Trajectory-Based Equations.	MFCS	2004	DBLP DOI BibTeX RDF
1	Zeev Nutov, Raphael Yuster	Packing Directed Cycles Efficiently.	MFCS	2004	DBLP DOI BibTeX RDF
1	Elias Koutsoupias	Congestion Games and Coordination Mechanisms.	MFCS	2004	DBLP DOI BibTeX RDF
1	Gustav Nordh	The Complexity of Equivalence and Isomorphism of Systems of Equations over Finite Groups.	MFCS	2004	DBLP DOI BibTeX RDF
1	Rob J. van Glabbeek, Gordon D. Plotkin	Event Structures for Resolvable Conflict.	MFCS	2004	DBLP DOI BibTeX RDF
1	Jerzy Tiuryn, Ryszard Rudnicki, Damian Wójtowicz	A Case Study of Genome Evolution: From Continuous to Discrete Time Model.	MFCS	2004	DBLP DOI BibTeX RDF
1	Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg	Graph Exploration by a Finite Automaton.	MFCS	2004	DBLP DOI BibTeX RDF
1	Henning Fernau, David W. Juedes	A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs.	MFCS	2004	DBLP DOI BibTeX RDF
1	Olivier Ly	Compositional Verification: Decidability Issues Using Graph Substitutions.	MFCS	2004	DBLP DOI BibTeX RDF	Tree Automata, Compositional Verification, Monadic Second-Order Logic
1	Marcel Crâsmaru, Christian Glaßer, Kenneth W. Regan, Samik Sengupta	A Protocol for Serializing Unique Strategies.	MFCS	2004	DBLP DOI BibTeX RDF
1	Vincent Bernardi, Bruno Durand 0001, Enrico Formenti, Jarkko Kari	A New Dimension Sensitive Property for Cellular Automata.	MFCS	2004	DBLP DOI BibTeX RDF
1	Libor Polák	On Pseudovarieties of Semiring Homomorphisms.	MFCS	2004	DBLP DOI BibTeX RDF	Varieties of languages, pseudovarieties of homomorphisms
1	Guillaume Theyssier	Captive Cellular Automata.	MFCS	2004	DBLP DOI BibTeX RDF
1	Elena Petre	An Elementary Proof for the Non-parametrizability of the Equation xyz=zvx.	MFCS	2004	DBLP DOI BibTeX RDF
1	Hubie Chen, Martin Pál	Optimization, Games, and Quantified Constraint Satisfaction.	MFCS	2004	DBLP DOI BibTeX RDF
1	Daniel Král, Pavel Nejedlý	Group Coloring and List Group Coloring Are Pi2P-Complete (Extended Abstract).	MFCS	2004	DBLP DOI BibTeX RDF
1	Harumichi Nishimura, Tomoyuki Yamakami	An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract).	MFCS	2004	DBLP DOI BibTeX RDF	Algorithmic argument, nonadaptive query, quantum computation, query complexity, advice
1	Pascal Weil	Algebraic Recognizability of Languages.	MFCS	2004	DBLP DOI BibTeX RDF
1	Miroslav Chlebík, Janka Chlebíková	On Approximation Hardness of the Minimum 2SAT-DELETION Problem.	MFCS	2004	DBLP DOI BibTeX RDF
1	Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia	Polynomial Time Approximation Schemes and Parameterized Complexity.	MFCS	2004	DBLP DOI BibTeX RDF
1	Yves Andre, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, Sophie Tison	Extraction and Implication of Path Constraints.	MFCS	2004	DBLP DOI BibTeX RDF
1	Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano	On NC1 Boolean Circuit Composition of Non-interactive Perfect Zero-Knowledge.	MFCS	2004	DBLP DOI BibTeX RDF
1	Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou	Online Algorithms for Disk Graphs.	MFCS	2004	DBLP DOI BibTeX RDF
1	Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin	A Hierarchy of Irreducible Sofic Shifts.	MFCS	2004	DBLP DOI BibTeX RDF	Automata and formal languages, symbolic dynamics
1	Slawomir Lasota 0001	A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes.	MFCS	2003	DBLP DOI BibTeX RDF
1	Bas Luttik	A Unique Decomposition Theorem for Ordered Monoids with Applications in Process Theory.	MFCS	2003	DBLP DOI BibTeX RDF
1	Jo Erskine Hannay, Shin-ya Katsumata, Donald Sannella	Semantic and Syntactic Approaches to Simulation Relations.	MFCS	2003	DBLP DOI BibTeX RDF
1	Leah Epstein	Two Dimensional Packing: The Power of Rotation.	MFCS	2003	DBLP DOI BibTeX RDF
1	Thomas Lücking 0001, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto	Which Is the Worst-Case Nash Equilibrium?	MFCS	2003	DBLP DOI BibTeX RDF
1	Wolfgang Merkle, Jan Reimann 0001	On Selection Functions that Do Not Preserve Normality.	MFCS	2003	DBLP DOI BibTeX RDF
1	Saeed Salehi	A Completeness Property of Wilke's Tree Algebras.	MFCS	2003	DBLP DOI BibTeX RDF
1	Conrado Martínez, Xavier Molinero	Generic Algorithms for the Generation of Combinatorial Objects.	MFCS	2003	DBLP DOI BibTeX RDF
1	Rainer Feldmann, Martin Gairing, Thomas Lücking 0001, Burkhard Monien, Manuel Rode	Selfish Routing in Non-cooperative Networks: A Survey.	MFCS	2003	DBLP DOI BibTeX RDF
1	Antonio Bucciarelli, Antonino Salibra	The Minimal Graph Model of Lambda Calculus.	MFCS	2003	DBLP DOI BibTeX RDF
1	Leah Epstein, Tamir Tassa	Approximation Schemes for the Min-Max Starting Time Problem.	MFCS	2003	DBLP DOI BibTeX RDF
1	Hubie Chen	Inverse NP Problems.	MFCS	2003	DBLP DOI BibTeX RDF
1	Gianluca De Marco, Andrzej Pelc	Randomized Algorithms for Determining the Majority on Graphs.	MFCS	2003	DBLP DOI BibTeX RDF
1	Cyril Banderier, René Beier, Kurt Mehlhorn	Smoothed Analysis of Three Combinatorial Problems.	MFCS	2003	DBLP DOI BibTeX RDF
1	Nadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot	A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum.	MFCS	2003	DBLP DOI BibTeX RDF
1	Carme Àlvarez, Maria J. Blesa, Josep Díaz, Antonio Fernández 0001, Maria J. Serna	Adversarial Models for Priority-Based Networks.	MFCS	2003	DBLP DOI BibTeX RDF
1	Christof Löding, Philipp Rohde	Solving the Sabotage Game Is PSPACE-Hard.	MFCS	2003	DBLP DOI BibTeX RDF
1	Roberto Gorrieri, Fabio Martinelli	Process Algebraic Frameworks for the Specification and Analysis of Cryptographic Protocols.	MFCS	2003	DBLP DOI BibTeX RDF
1	Wolfgang Thomas	Constructing Infinite Graphs with a Decidable MSO-Theory.	MFCS	2003	DBLP DOI BibTeX RDF
1	Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch	ACID-Unification Is NEXPTIME-Decidable.	MFCS	2003	DBLP DOI BibTeX RDF	E-Unification, Dag automata, Complexity, Tree automata, Set constraints
1	Yann Loyer, Umberto Straccia	The Approximate Well-Founded Semantics for Logic Programs with Uncertainty.	MFCS	2003	DBLP DOI BibTeX RDF
1	Klaus Meer	On the Complexity of Some Problems in Interval Arithmetic.	MFCS	2003	DBLP DOI BibTeX RDF
1	Marcin Rychlik	On Probabilistic Quantified Satisfability Games.	MFCS	2003	DBLP DOI BibTeX RDF
1	Miroslaw Kutylowski, Daniel Letkiewicz	Computing Average Value in Ad Hoc Networks.	MFCS	2003	DBLP DOI BibTeX RDF
1	Gregor Gramlich	Probabilistic and Nondeterministic Unary Automata.	MFCS	2003	DBLP DOI BibTeX RDF
1	Michele Boreale, Fabio Gadducci	Denotational Testing Semantics in Coinductive Form.	MFCS	2003	DBLP DOI BibTeX RDF	testing equivalence, process calculi, coinduction, formal power series
1	Zhi-Zhong Chen, Mitsuharu Kouno	A Linear-Time Algorithm for 7-Coloring 1-Planar Graphs.	MFCS	2003	DBLP DOI BibTeX RDF
1	Ivana Cerná, Radek Pelánek	Relating Hierarchy of Temporal Properties to Model Checking.	MFCS	2003	DBLP DOI BibTeX RDF
1	Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos	Completeness in Differential Approximation Classes.	MFCS	2003	DBLP DOI BibTeX RDF
1	Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener	On Converting CNF to DNF.	MFCS	2003	DBLP DOI BibTeX RDF
1	Hubie Chen	Arithmetic Constant-Depth Circuit Complexity Classes.	MFCS	2003	DBLP DOI BibTeX RDF
1	Stéphane Riedweg, Sophie Pinchinat	Quantified Mu-Calculus for Control Synthesis.	MFCS	2003	DBLP DOI BibTeX RDF
1	Ingo Wegener	Towards a Theory of Randomized Search Heuristics.	MFCS	2003	DBLP DOI BibTeX RDF
1	Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda	Inferring Strings from Graphs and Arrays.	MFCS	2003	DBLP DOI BibTeX RDF
1	Christian Delhommé, Teodor Knapik, D. Gnanaraj Thomas	Using Transitive-Closure Logic for Deciding Linear Properties of Monoids.	MFCS	2003	DBLP DOI BibTeX RDF	monoid presentations, transitive closure logic, string rewriting
1	Giancarlo Mauri, Alberto Leporati	On the Computational Complexity of Conservative Computing.	MFCS	2003	DBLP DOI BibTeX RDF
1	Branislav Rovan, Peter Vojtás (eds.)	Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings	MFCS	2003	DBLP DOI BibTeX RDF
1	Carlo Meghini, Yannis Tzitzikas, Nicolas Spyratos	An Abduction-Based Method for Index Relaxation in Taxonomy-Based Sources.	MFCS	2003	DBLP DOI BibTeX RDF
1	Philipp Woelfel	Symbolic Topological Sorting with OBDDS.	MFCS	2003	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos	Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms.	MFCS	2003	DBLP DOI BibTeX RDF
1	François Blanchard, Julien Cervelle, Enrico Formenti	Periodicity and Transitivity for Cellular Automata in Besicovitch Topologies.	MFCS	2003	DBLP DOI BibTeX RDF
1	Elmar Böhler, Christian Glaßer, Daniel Meister 0001	Error-Bounded Probabilistic Computations between MA and AM.	MFCS	2003	DBLP DOI BibTeX RDF

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