Conferences in DBLP
Jerzy Tiuryn , Ryszard Rudnicki , Damian Wójtowicz A Case Study of Genome Evolution: From Continuous to Discrete Time Model. [Citation Graph (0, 0)][DBLP ] Conf ] Magnús M. Halldórsson , Guy Kortsarz Multicoloring: Problems and Techniques. [Citation Graph (0, 0)][DBLP ] Conf ] Rodney G. Downey Some Recent Progress in Algorithmic Randomness. [Citation Graph (0, 0)][DBLP ] Conf ] Rolf Niedermeier Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Uzi Vishkin PRAM-On-Chip: A Quest for Not-So-Obvious Non-obviousness. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew Brand , Sarah F. Frisken Gibson , Neal Lesh , Joe Marks , Daniel Nikovski , Ronald B. Perry , Jonathan S. Yedidia Theory and Applied Computing: Observations and Anecdotes. [Citation Graph (0, 0)][DBLP ] Conf ] Eduardo Bonelli , Adriana B. Compagnoni , Mariangiola Dezani-Ciancaglini , Pablo Garralda Boxed Ambients with Communication Interfaces. [Citation Graph (0, 0)][DBLP ] Conf ] Pascal Weil Algebraic Recognizability of Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Emo Welzl Geometric Optimization and Unique Sink Orientations of Cubes p. [Citation Graph (0, 0)][DBLP ] Conf ] Elias Koutsoupias Congestion Games and Coordination Mechanisms. [Citation Graph (0, 0)][DBLP ] Conf ] Hans L. Bodlaender , Fedor V. Fomin Equitable Colorings of Bounded Treewidth Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , Mohammad Taghi Hajiaghayi , Dimitrios M. Thilikos The Bidimensional Theory of Bounded-Genus Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Hajo Broersma , Fedor V. Fomin , Gerhard J. Woeginger Parallel Knock-Out Schemes in Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Ioannis Caragiannis , Aleksei V. Fishkin , Christos Kaklamanis , Evi Papaioannou Online Algorithms for Disk Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Hans-Joachim Böckenhauer , Dirk Bongartz Protein Folding in the HP Model on Grid Lattices with Diagonals (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Hubie Chen , Martin Pál Optimization, Games, and Quantified Constraint Satisfaction. [Citation Graph (0, 0)][DBLP ] Conf ] Andre Gronemeier Approximating Boolean Functions by OBDDs. [Citation Graph (0, 0)][DBLP ] Conf ] Miroslav Chlebík , Janka Chlebíková On Approximation Hardness of the Minimum 2SAT-DELETION Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Král , Pavel Nejedlý Group Coloring and List Group Coloring Are Pi2 P-Complete (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Edith Hemaspaandra , Lane A. Hemaspaandra , Stanislaw P. Radziszowski , Rahul Tripathi Complexity Results in Graph Reconstruction. [Citation Graph (0, 0)][DBLP ] Conf ] Endre Boros , Khaled M. Elbassioni , Vladimir Gurvich , Leonid Khachiyan , Kazuhisa Makino Generating Paths and Cuts in Multi-pole (Di)graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Zeev Nutov , Raphael Yuster Packing Directed Cycles Efficiently. [Citation Graph (0, 0)][DBLP ] Conf ] Stephen D. Travers The Complexity of Membership Problems for Circuits over Sets of Integers. [Citation Graph (0, 0)][DBLP ] Conf ] Kristoffer Arnsfelt Hansen , Peter Bro Miltersen Some Meet-in-the-Middle Circuit Lower Bounds. [Citation Graph (0, 0)][DBLP ] Conf ] Alina Beygelzimer , Mitsunori Ogihara The Enumerability of P Collapses P to NC. [Citation Graph (0, 0)][DBLP ] Conf ] Alfredo De Santis , Giovanni Di Crescenzo , Giuseppe Persiano On NC1 Boolean Circuit Composition of Non-interactive Perfect Zero-Knowledge. [Citation Graph (0, 0)][DBLP ] Conf ] Edith Hemaspaandra , Lane A. Hemaspaandra , Harald Hempel All Superlinear Inverse Schemes Are coNP-Hard. [Citation Graph (0, 0)][DBLP ] Conf ] Gustav Nordh The Complexity of Equivalence and Isomorphism of Systems of Equations over Finite Groups. [Citation Graph (0, 0)][DBLP ] Conf ] Elmar Böhler , Christian Glaßer , Bernhard Schwarz , Klaus W. Wagner Generation Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Sebastian Bab , Arfst Nickelsen One Query Reducibilities Between Partial Information Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Vincent Bernardi , Bruno Durand , Enrico Formenti , Jarkko Kari A New Dimension Sensitive Property for Cellular Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Guillaume Theyssier Captive Cellular Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Victor Poupet Simulating 3D Cellular Automata with 2D Cellular Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Pierre Fraigniaud , David Ilcinkas , Guy Peer , Andrzej Pelc , David Peleg Graph Exploration by a Finite Automaton. [Citation Graph (0, 0)][DBLP ] Conf ] Troy Lee , Andrei E. Romashchenko On Polynomially Time Bounded Symmetry of Information. [Citation Graph (0, 0)][DBLP ] Conf ] John M. Hitchcock , María López-Valdés , Elvira Mayordomo Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Henning Fernau , David W. Juedes A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Jianer Chen , Xiuzhen Huang , Iyad A. Kanj , Ge Xia Polynomial Time Approximation Schemes and Parameterized Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Yann Loyer , Umberto Straccia Epistemic Foundation of the Well-Founded Semantics over Bilattices. [Citation Graph (0, 0)][DBLP ] Conf ] Ruggero Lanotte , Andrea Maggiolo-Schettini , Adriano Peron Structural Model Checking for Communicating Hierarchical Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Olivier Ly Compositional Verification: Decidability Issues Using Graph Substitutions. [Citation Graph (0, 0)][DBLP ] Conf ] Rob J. van Glabbeek , Gordon D. Plotkin Event Structures for Resolvable Conflict. [Citation Graph (0, 0)][DBLP ] Conf ] Leah Epstein , Tamir Tassa Optimal Preemptive Scheduling for General Target Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Gairing , Thomas Lücking , Marios Mavronicolas , Burkhard Monien The Price of Anarchy for Polynomial Social Cost. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Elsässer , Ulf Lorenz , Thomas Sauerwald Agent-Based Information Handling in Large Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Nadine Baumann , Ekkehard Köhler Approximating Earliest Arrival Flows with Flow-Dependent Transit Times. [Citation Graph (0, 0)][DBLP ] Conf ] Marie-Pierre Béal , Francesca Fiorenzi , Dominique Perrin A Hierarchy of Irreducible Sofic Shifts. [Citation Graph (0, 0)][DBLP ] Conf ] Alexei Lisitsa , Igor Potapov Membership and Reachability Problems for Row-Monomial Transformations. [Citation Graph (0, 0)][DBLP ] Conf ] Libor Polák On Pseudovarieties of Semiring Homomorphisms. [Citation Graph (0, 0)][DBLP ] Conf ] Zoltán Ésik , Werner Kuich An Algebraic Generalization of omega-Regular Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Marcel Crâsmaru , Christian Glaßer , Kenneth W. Regan , Samik Sengupta A Protocol for Serializing Unique Strategies. [Citation Graph (0, 0)][DBLP ] Conf ] Henrik Björklund , Sven Sandberg , Sergei G. Vorobyov A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games. [Citation Graph (0, 0)][DBLP ] Conf ] Hugo Gimbert , Wieslaw Zielonka When Can You Play Positionally? [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Okhotin The Dual of Concatenation. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Ambos-Spies , Edgar Busse Computational Aspects of Disjunctive Sequences. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Domaratzki , Kai Salomaa Decidability of Trajectory-Based Equations. [Citation Graph (0, 0)][DBLP ] Conf ] Therese C. Biedl , Masud Hasan , Alejandro López-Ortiz Efficient View Point Selection for Silhouettes of Convex Polyhedra. [Citation Graph (0, 0)][DBLP ] Conf ] Therese C. Biedl , Anna Lubiw , Michael J. Spriggs Angles and Lengths in Reconfigurations of Polygons and Polyhedra. [Citation Graph (0, 0)][DBLP ] Conf ] Benjamin Doerr , Nils Hebbinghaus , Sören Werth Improved Bounds and Schemes for the Declustering Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Petr Hlinený Crossing Number Is Hard for Cubic Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Victor L. Selivanov , Klaus W. Wagner A Reducibility for the Dot-Depth Hierarchy. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Wich Sublogarithmic Ambiguity. [Citation Graph (0, 0)][DBLP ] Conf ] Elena Petre An Elementary Proof for the Non-parametrizability of the Equation xyz=zvx. [Citation Graph (0, 0)][DBLP ] Conf ] Lucian Ilie , Pascal Ochem , Jeffrey Shallit A Generalization of Repetition Threshold. [Citation Graph (0, 0)][DBLP ] Conf ] Harumichi Nishimura , Tomoyuki Yamakami An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Akinori Kawachi , Hirotada Kobayashi , Takeshi Koshiba , Raymond H. Putra Universal Test for Quantum One-Way Permutations. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Beaudry , José M. Fernandez , Markus Holzer A Common Algebraic Description for Probabilistic and Quantum Computations (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Yves Andre , Anne-Cécile Caron , Denis Debarbieux , Yves Roos , Sophie Tison Extraction and Implication of Path Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Béatrice Bouchou , Denio Duarte , Mirian Halfeld Ferrari Alves , Dominique Laurent , Martin A. Musicante Schema Evolution for XML: A Consistency-Preserving Approach. [Citation Graph (0, 0)][DBLP ] Conf ] Wim Martens , Frank Neven , Thomas Schwentick Complexity of Decision Problems for Simple Regular Expressions. [Citation Graph (0, 0)][DBLP ] Conf ] 