Search results for "MFCS"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Dirk Nowotka, Jirí Srba	Height-Deterministic Pushdown Automata.	MFCS	2007	DBLP DOI BibTeX RDF
1	Christoph Behle, Andreas Krebs, Mark Mercer	Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids.	MFCS	2007	DBLP DOI BibTeX RDF
1	Travis Gagie, Giovanni Manzini	Space-Conscious Compression.	MFCS	2007	DBLP DOI BibTeX RDF
1	Maxime Crochemore, Lucian Ilie	Analysis of Maximal Repetitions in Strings.	MFCS	2007	DBLP DOI BibTeX RDF	repetitions in strings, maximal repetitions, maximal periodicities, sum of exponents, runs, Combinatorics on words
1	Leslie G. Valiant	Evolvability.	MFCS	2007	DBLP DOI BibTeX RDF
1	Esko Ukkonen	Structural Analysis of Gapped Motifs of a String.	MFCS	2007	DBLP DOI BibTeX RDF
1	Jirí Adámek, Stefan Milius, Jirí Velebil	What Are Iteration Theories?	MFCS	2007	DBLP DOI BibTeX RDF
1	Gábor Kun, Jaroslav Nesetril	NP by Means of Lifts and Shadows.	MFCS	2007	DBLP DOI BibTeX RDF	duality, Constraint Satisfaction Problem, homomorphism, Digraph, NP
1	Yvonne Bleischwitz, Burkhard Monien, Florian Schoppmann, Karsten Tiemann	The Power of Two Prices: Beyond Cross-Monotonicity.	MFCS	2007	DBLP DOI BibTeX RDF
1	Joaquim Gabarró, Alina García, Maria J. Serna	On the Complexity of Game Isomorphism.	MFCS	2007	DBLP DOI BibTeX RDF	Game isomorphism, boolean isomorphism, computational complexity, graph isomorphism, boolean formulas, succinct representations
1	Elias Koutsoupias, Angelina Vidali	A Lower Bound of 1+phi for Truthful Scheduling Mechanisms.	MFCS	2007	DBLP DOI BibTeX RDF
1	C.-H. Luke Ong	Hierarchies of Infinite Structures Generated by Pushdown Automata and Recursion Schemes.	MFCS	2007	DBLP DOI BibTeX RDF
1	Fabian Wagner	Hardness Results for Tournament Isomorphism and Automorphism.	MFCS	2007	DBLP DOI BibTeX RDF
1	Gerth Stølting Brodal, Allan Grønlund Jørgensen	A Linear Time Algorithm for the k Maximal Sums Problem.	MFCS	2007	DBLP DOI BibTeX RDF
1	John Case, Samuel E. Moelius	Properties Complementary to Program Self-reference.	MFCS	2007	DBLP DOI BibTeX RDF	Computability Theory, Programming Language Semantics, Self-Reference
1	Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci	Efficient Provably-Secure Hierarchical Key Assignment Schemes.	MFCS	2007	DBLP DOI BibTeX RDF
1	Luc Longpré, Pierre McKenzie	The Complexity of Solitaire.	MFCS	2007	DBLP DOI BibTeX RDF
1	Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini	Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems.	MFCS	2007	DBLP DOI BibTeX RDF
1	Riko Jacob	Optimal Randomized Comparison Based Algorithms for Collision.	MFCS	2007	DBLP DOI BibTeX RDF
1	Gábor Salamon	Approximation Algorithms for the Maximum Internal Spanning Tree Problem.	MFCS	2007	DBLP DOI BibTeX RDF	Spanning tree leaves, Approximation algorithm, Hamiltonian path
1	Evangelos Kranakis, Michel Paquette, Andrzej Pelc	Communication in Networks with Random Dependent Faults.	MFCS	2007	DBLP DOI BibTeX RDF	dependent faults, crash faults, Fault-tolerance, communication, network connectivity
1	Pascal Koiran, Sylvain Perifel	VPSPACE and a Transfer Theorem over the Complex Field.	MFCS	2007	DBLP DOI BibTeX RDF
1	Vittorio Bilò, Michele Flammini	Extending the Notion of Rationality of Selfish Agents: Second Order Nash Equilibria.	MFCS	2007	DBLP DOI BibTeX RDF
1	Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis	Expander Properties and the Cover Time of Random Intersection Graphs.	MFCS	2007	DBLP DOI BibTeX RDF
1	Christof Löding, Alex Spelten	Transition Graphs of Rewriting Systems over Unranked Trees.	MFCS	2007	DBLP DOI BibTeX RDF	Infinite graphs, unranked trees, rewriting, reachability
1	Antoine Meyer	Traces of Term-Automatic Graphs.	MFCS	2007	DBLP DOI BibTeX RDF
1	Rodolfo Carvajal, Martín Matamala, Ivan Rapaport, Nicolas Schabanel	Small Alliances in Graphs.	MFCS	2007	DBLP DOI BibTeX RDF
1	Kasper Pedersen	Dobrushin Conditions for Systematic Scan with Block Dynamics.	MFCS	2007	DBLP DOI BibTeX RDF
1	Klaus Jansen, Roberto Solis-Oba	New Approximability Results for 2-Dimensional Packing Problems.	MFCS	2007	DBLP DOI BibTeX RDF
1	Markus Bläser, Andreas Meyer de Voltaire	Semisimple Algebras of Almost Minimal Rank over the Reals.	MFCS	2007	DBLP DOI BibTeX RDF
1	Nicolas Bedon, Chloe Rispal	Series-Parallel Languages on Scattered and Countable Posets.	MFCS	2007	DBLP DOI BibTeX RDF
1	Klaus Meer, Martin Ziegler 0001	Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation.	MFCS	2007	DBLP DOI BibTeX RDF
1	Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff	Exact Algorithms for L (2, 1)-Labeling of Graphs.	MFCS	2007	DBLP DOI BibTeX RDF
1	Anuj Dawar	Finite Model Theory on Tame Classes of Structures.	MFCS	2007	DBLP DOI BibTeX RDF
1	Yo-Sub Han, Kai Salomaa	State Complexity of Basic Operations on Suffix-Free Regular Languages.	MFCS	2007	DBLP DOI BibTeX RDF
1	Martin Delacourt, Victor Poupet	Real Time Language Recognition on 2D Cellular Automata: Dealing with Non-convex Neighborhoods.	MFCS	2007	DBLP DOI BibTeX RDF
1	Maxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman	Finding Patterns in Given Intervals.	MFCS	2007	DBLP DOI BibTeX RDF
1	Vasek Chvátal	How To Be Fickle.	MFCS	2007	DBLP DOI BibTeX RDF
1	Paul S. Bonsma, Luis Cereceda	Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances.	MFCS	2007	DBLP DOI BibTeX RDF	vertex-recolouring, colour graph, superpolynomial distance, PSPACE-complete
1	Andreas Brandstädt, Peter Wagner 0002	On ( k , l)-Leaf Powers.	MFCS	2007	DBLP DOI BibTeX RDF	(k and ?) -leaf powers, leaf roots, strictly chordal graphs, linear time algorithms, leaf powers
1	Julien Cervelle, Pierre Guillon 0001	Towards a Rice Theorem on Traces of Cellular Automata.	MFCS	2007	DBLP DOI BibTeX RDF	cellular automata, computability, decidability, formal languages, symbolic dynamics, Discrete-time dynamical systems
1	Rupert J. Hartung, Claus-Peter Schnorr	Public Key Identification Based on the Equivalence of Quadratic Forms.	MFCS	2007	DBLP DOI BibTeX RDF
1	Elias Koutsoupias, Panagiota N. Panagopoulou, Paul G. Spirakis	Selfish Load Balancing Under Partial Knowledge.	MFCS	2007	DBLP DOI BibTeX RDF
1	Foto N. Afrati	Rewriting Conjunctive Queries Determined by Views.	MFCS	2007	DBLP DOI BibTeX RDF
1	Spyros C. Kontogiannis, Paul G. Spirakis	Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach.	MFCS	2007	DBLP DOI BibTeX RDF
1	Seiichiro Tani	An Improved Claw Finding Algorithm Using Quantum Walk.	MFCS	2007	DBLP DOI BibTeX RDF	oracle computation, Quantum computing, query complexity
1	Marios Mavronicolas, Igal Milchtaich, Burkhard Monien, Karsten Tiemann	Congestion Games with Player-Specific Constants.	MFCS	2007	DBLP DOI BibTeX RDF
1	Sorin Constantinescu, Lucian Ilie	The Lempel-Ziv Complexity of Fixed Points of Morphisms.	MFCS	2006	DBLP DOI BibTeX RDF
1	Laurent Boyer 0001, Victor Poupet, Guillaume Theyssier	On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures.	MFCS	2006	DBLP DOI BibTeX RDF
1	Norbert Dojer	Learning Bayesian Networks Does Not Have to Be NP-Hard.	MFCS	2006	DBLP DOI BibTeX RDF
1	Miroslaw Dynia, Jaroslaw Kutylowski, Friedhelm Meyer auf der Heide, Christian Schindelhauer	Smart Robot Teams Exploring Sparse Trees.	MFCS	2006	DBLP DOI BibTeX RDF
1	Dexter Kozen	On the Representation of Kleene Algebras with Tests.	MFCS	2006	DBLP DOI BibTeX RDF
1	Qi Cheng 0001	On Comparing Sums of Square Roots of Small Integers.	MFCS	2006	DBLP DOI BibTeX RDF
1	Robert Elsässer	Toward the Eigenvalue Power Law.	MFCS	2006	DBLP DOI BibTeX RDF
1	Jianer Chen, Iyad A. Kanj, Ge Xia	Improved Parameterized Upper Bounds for Vertex Cover.	MFCS	2006	DBLP DOI BibTeX RDF
1	Beat Gfeller, Leon Peeters, Birgitta Weber, Peter Widmayer	Online Single Machine Batch Scheduling.	MFCS	2006	DBLP DOI BibTeX RDF	Scheduling, competitive ratio, batching, online analysis
1	Damian Wójtowicz, Jerzy Tiuryn	On Genome Evolution with Innovation.	MFCS	2006	DBLP DOI BibTeX RDF
1	Giuseppe Persiano, Ivan Visconti	On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String Model.	MFCS	2006	DBLP DOI BibTeX RDF
1	Francine Blanchet-Sadri, D. Dakota Blair, Rebeca V. Lewis	Equations on Partial Words.	MFCS	2006	DBLP DOI BibTeX RDF
1	Luisa Gargano, Adele A. Rescigno	Optimally Fast Data Gathering in Sensor Networks.	MFCS	2006	DBLP DOI BibTeX RDF
1	Arnaud Carayol, Didier Caucal	The Kleene Equality for Graphs.	MFCS	2006	DBLP DOI BibTeX RDF
1	Ondrej Klíma 0001, Benoît Larose, Pascal Tesson	Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture.	MFCS	2006	DBLP DOI BibTeX RDF
1	Lance Fortnow, Mitsunori Ogihara	Very Sparse Leaf Languages.	MFCS	2006	DBLP DOI BibTeX RDF
1	Joan Boyar, René Peralta 0001	Concrete Multiplicative Complexity of Symmetric Functions.	MFCS	2006	DBLP DOI BibTeX RDF
1	Holger Spakowski, Rahul Tripathi	Hierarchical Unambiguity.	MFCS	2006	DBLP DOI BibTeX RDF
1	André Gronemeier	NOF-Multiparty Information Complexity Bounds for Pointer Jumping.	MFCS	2006	DBLP DOI BibTeX RDF
1	Refael Hassin, Jérôme Monnot, Danny Segev	Approximation Algorithms and Hardness Results for Labeled Connectivity Problems.	MFCS	2006	DBLP DOI BibTeX RDF
1	Sasanka Roy, Arindam Karmakar, Sandip Das 0001, Subhas C. Nandy	Constrained Minimum Enclosing Circle with Center on a Query Line Segment.	MFCS	2006	DBLP DOI BibTeX RDF
1	Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack	Approximate Shortest Path Queries on Weighted Polyhedral Surfaces.	MFCS	2006	DBLP DOI BibTeX RDF
1	Rodrigo S. C. Leão, Valmir Carneiro Barbosa	Minimal Chordal Sense of Direction and Circulant Graphs.	MFCS	2006	DBLP DOI BibTeX RDF	Chordal sense of direction, Cayley graphs, Circulant graphs
1	Wael El Oraiby, Dominique Schmitt	k-Sets of Convex Inclusion Chains of Planar Point Sets.	MFCS	2006	DBLP DOI BibTeX RDF
1	Martin Kutrib, Andreas Malcher	Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability.	MFCS	2006	DBLP DOI BibTeX RDF
1	Marios Mavronicolas, Loizos Michael, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis	The Price of Defense.	MFCS	2006	DBLP DOI BibTeX RDF
1	Jean Berstel, Alessandra Savelli	Crochemore Factorization of Sturmian and Other Infinite Words.	MFCS	2006	DBLP DOI BibTeX RDF
1	Kazuo Iwama, Hiroki Morizumi	Reductions for Monotone Boolean Circuits.	MFCS	2006	DBLP DOI BibTeX RDF
1	Yury Lifshits, Markus Lohrey	Querying and Embedding Compressed Texts.	MFCS	2006	DBLP DOI BibTeX RDF
1	Ulrik Brandes, Jürgen Lerner	Coloring Random 3-Colorable Graphs with Non-uniform Edge Probabilities.	MFCS	2006	DBLP DOI BibTeX RDF
1	Sergey Goncharov 0001, Lutz Schröder, Till Mossakowski	Completeness of Global Evaluation Logic.	MFCS	2006	DBLP DOI BibTeX RDF
1	Alessandra Cherubini, Pawel Gawrychowski, Andrzej Kisielewicz 0001, Brunetto Piochi	A Combinatorial Approach to Collapsing Words.	MFCS	2006	DBLP DOI BibTeX RDF
1	Vikraman Arvind, Piyush P. Kurur	A Polynomial Time Nilpotence Test for Galois Groups and Related Results.	MFCS	2006	DBLP DOI BibTeX RDF
1	Richard Beigel, William I. Gasarch, James Glenn	The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems.	MFCS	2006	DBLP DOI BibTeX RDF
1	Martin Grohe	The Structure of Tractable Constraint Satisfaction Problems.	MFCS	2006	DBLP DOI BibTeX RDF
1	Aris Pagourtzis, Stathis Zachos	The Complexity of Counting Functions with Easy Decision Version.	MFCS	2006	DBLP DOI BibTeX RDF
1	Christian Glaßer, Stephen D. Travers	Machines that Can Output Empty Words.	MFCS	2006	DBLP DOI BibTeX RDF
1	A. N. Trahtman	An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Cerny Conjecture.	MFCS	2006	DBLP DOI BibTeX RDF
1	Arturo Carpi	On the Repetition Threshold for Large Alphabets.	MFCS	2006	DBLP DOI BibTeX RDF
1	Oswin Aichholzer, Clemens Huemer, Sarah Kappes, Bettina Speckmann, Csaba D. Tóth	Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles.	MFCS	2006	DBLP DOI BibTeX RDF
1	Guillaume Malod, Natacha Portier	Characterizing Valiant's Algebraic Complexity Classes.	MFCS	2006	DBLP DOI BibTeX RDF	Valiant’s theory, skew circuits, polynomials, Determinant, arithmetic circuits, Permanent, Algebraic complexity
1	Volker Diekert, Markus Lohrey, Alexander Miller	Partially Commutative Inverse Monoids.	MFCS	2006	DBLP DOI BibTeX RDF
1	Angelo Fanelli 0001, Michele Flammini, Giovanna Melideo, Luca Moscardelli	Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves.	MFCS	2006	DBLP DOI BibTeX RDF	limited number of best responses, Multicast, price of anarchy, Nash equilibria
1	Christopher M. Homan, Lane A. Hemaspaandra	Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners.	MFCS	2006	DBLP DOI BibTeX RDF
1	Cyril Allauzen, Mehryar Mohri	A Unified Construction of the Glushkov, Follow, and Antimirov Automata.	MFCS	2006	DBLP DOI BibTeX RDF
1	María López-Valdés	Lempel-Ziv Dimension for Lempel-Ziv Compression.	MFCS	2006	DBLP DOI BibTeX RDF
1	Fredrik Kuivinen	Approximability of Bounded Occurrence Max Ones.	MFCS	2006	DBLP DOI BibTeX RDF	Bounded occurrence, Max Ones, Approximability, Matching, Constraint satisfaction problems
1	Cyril Gavoille	Distributed Data Structures: A Survey on Informative Labeling Schemes.	MFCS	2006	DBLP DOI BibTeX RDF	data-structures, distributed algorithm, graphs, labeling scheme
1	Alexander E. Kostin	A Reachability Algorithm for General Petri Nets Based on Transition Invariants.	MFCS	2006	DBLP DOI BibTeX RDF	transition invariants, Petri nets, reachability
1	Michael Domaratzki, Kai Salomaa	Lower Bounds for the Transition Complexity of NFAs.	MFCS	2006	DBLP DOI BibTeX RDF
1	Herman Geuvers, Iris Loeb	From Deduction Graphs to Proof Nets: Boxes and Sharing in the Graphical Presentation of Deductions.	MFCS	2006	DBLP DOI BibTeX RDF
1	Peter Jonsson, Gustav Nordh	Generalised Integer Programming Based on Logically Defined Relations.	MFCS	2006	DBLP DOI BibTeX RDF
1	Yoram Hirshfeld, Alexander Moshe Rabinovich	An Expressive Temporal Logic for Real Time.	MFCS	2006	DBLP DOI BibTeX RDF

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