MFCS B

67 papers

YearTitle / Authors
2007A Linear Time Algorithm for the
Gerth Stølting Brodal, Allan Grønlund Jørgensen
2007A Lower Bound of 1+
Elias Koutsoupias, Angelina Vidali
2007Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems.
Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini
2007An Improved Claw Finding Algorithm Using Quantum Walk.
Seiichiro Tani
2007Analysis of Maximal Repetitions in Strings.
Maxime Crochemore, Lucian Ilie
2007Approximation Algorithms for the Maximum Internal Spanning Tree Problem.
Gábor Salamon
2007Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete.
Jaroslav Nesetril, Mark H. Siggers
2007Communication in Networks with Random Dependent Faults.
Evangelos Kranakis, Michel Paquette, Andrzej Pelc
2007Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument.
Rahul Tripathi
2007Congestion Games with Player-Specific Constants.
Marios Mavronicolas, Igal Milchtaich, Burkhard Monien, Karsten Tiemann
2007Dobrushin Conditions for Systematic Scan with Block Dynamics.
Kasper Pedersen
2007Dynamic Matchings in Convex Bipartite Graphs.
Gerth Stølting Brodal, Loukas Georgiadis, Kristoffer Arnsfelt Hansen, Irit Katriel
2007Efficient Provably-Secure Hierarchical Key Assignment Schemes.
Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci
2007Evolvability.
Leslie G. Valiant
2007Exact Algorithms for
Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
2007Expander Properties and the Cover Time of Random Intersection Graphs.
Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis
2007Extending the Notion of Rationality of Selfish Agents: Second Order Nash Equilibria.
Vittorio Bilò, Michele Flammini
2007Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances.
Paul S. Bonsma, Luis Cereceda
2007Finding Patterns in Given Intervals.
Maxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman
2007Finite Model Theory on Tame Classes of Structures.
Anuj Dawar
2007Hardness Results for Tournament Isomorphism and Automorphism.
Fabian Wagner
2007Height-Deterministic Pushdown Automata.
Dirk Nowotka, Jirí Srba
2007Hierarchies of Infinite Structures Generated by Pushdown Automata and Recursion Schemes.
C.-H. Luke Ong
2007How To Be Fickle.
Vasek Chvátal
2007Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids.
Christoph Behle, Andreas Krebs, Mark Mercer
2007Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings
Ludek Kucera, Antonín Kucera
2007Minimizing Variants of Visibly Pushdown Automata.
Patrick Chervet, Igor Walukiewicz
2007Minimum Cycle Bases in Graphs Algorithms and Applications.
Kurt Mehlhorn
2007NP by Means of Lifts and Shadows.
Gábor Kun, Jaroslav Nesetril
2007Nearly Private Information Retrieval.
Amit Chakrabarti, Anna Shubina
2007New Approximability Results for 2-Dimensional Packing Problems.
Klaus Jansen, Roberto Solis-Oba
2007On (
Andreas Brandstädt, Peter Wagner
2007On Approximation of Bookmark Assignments.
Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono
2007On Time Lookahead Algorithms for the Online Data Acknowledgement Problem.
Csanád Imreh, Tamás Németh
2007On the Complexity of Computing Treelength.
Daniel Lokshtanov
2007On the Complexity of Game Isomorphism.
Joaquim Gabarró, Alina García, Maria J. Serna
2007Online and Offline Access to Short Lists.
Torben Hagerup
2007Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults.
Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
2007Optimal Randomized Comparison Based Algorithms for Collision.
Riko Jacob
2007Packing and Squeezing Subgraphs into Planar Graphs.
Fabrizio Frati, Markus Geyer, Michael Kaufmann
2007Progresses in the Analysis of Stochastic 2D Cellular Automata: A Study of Asynchronous 2D Minority.
Damien Regnault, Nicolas Schabanel, Eric Thierry
2007Properties Complementary to Program Self-reference.
John Case, Samuel E. Moelius
2007Public Key Identification Based on the Equivalence of Quadratic Forms.
Rupert J. Hartung, Claus-Peter Schnorr
2007Randomized and Approximation Algorithms for Blue-Red Matching.
Christos Nomikos, Aris Pagourtzis, Stathis Zachos
2007Reachability Problems in Quaternion Matrix and Rotation Semigroups.
Paul Bell, Igor Potapov
2007Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation.
Klaus Meer, Martin Ziegler
2007Real Time Language Recognition on 2D Cellular Automata: Dealing with Non-convex Neighborhoods.
Martin Delacourt, Victor Poupet
2007Relating Complete and Partial Solution for Problems Similar to Graph Automorphism.
Takayuki Nagoya, Seinosuke Toda
2007Rewriting Conjunctive Queries Determined by Views.
Foto N. Afrati
2007Selfish Load Balancing Under Partial Knowledge.
Elias Koutsoupias, Panagiota N. Panagopoulou, Paul G. Spirakis
2007Semisimple Algebras of Almost Minimal Rank over the Reals.
Markus Bläser, Andreas Meyer de Voltaire
2007Series-Parallel Languages on Scattered and Countable Posets.
Nicolas Bedon, Chloe Rispal
2007Shuffle Expressions and Words with Nested Data.
Henrik Björklund, Mikolaj Bojanczyk
2007Small Alliances in Graphs.
Rodolfo Carvajal, Martín Matamala, Ivan Rapaport, Nicolas Schabanel
2007Space-Conscious Compression.
Travis Gagie, Giovanni Manzini
2007State Complexity of Basic Operations on Suffix-Free Regular Languages.
Yo-Sub Han, Kai Salomaa
2007Structural Analysis of Gapped Motifs of a String.
Esko Ukkonen
2007The Complexity of Solitaire.
Luc Longpré, Pierre McKenzie
2007The Maximum Solution Problem on Graphs.
Peter Jonsson, Gustav Nordh, Johan Thapper
2007The Power of Two Prices: Beyond Cross-Monotonicity.
Yvonne Bleischwitz, Burkhard Monien, Florian Schoppmann, Karsten Tiemann
2007Towards a Rice Theorem on Traces of Cellular Automata.
Julien Cervelle, Pierre Guillon
2007Traces of Term-Automatic Graphs.
Antoine Meyer
2007Transition Graphs of Rewriting Systems over Unranked Trees.
Christof Löding, Alex Spelten
2007Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs.
William Duckworth, Michele Zito
2007VPSPACE and a Transfer Theorem over the Complex Field.
Pascal Koiran, Sylvain Perifel
2007Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach.
Spyros C. Kontogiannis, Paul G. Spirakis
2007What Are Iteration Theories?
Jirí Adámek, Stefan Milius, Jirí Velebil