Conferences in DBLP
Yan Zong Ding , Michael O. Rabin Hyper-Encryption and Everlasting Security. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Scheideler Models and Techniques for Communication in Dynamic Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Gilles Dowek What Is a Theory? [Citation Graph (0, 0)][DBLP ] Conf ] Pierre Fraigniaud , Cyril Gavoille A Space Lower Bound for Routing in Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Amos Korman , David Peleg , Yoav Rodeh Labeling Schemes for Dynamic Tree Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Micah Adler , Adi Rosén Tight Bounds for the Performance of Longest-in-System on DAGs. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Jansen Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Benjamin Doerr Balanced Coloring: Equally Easy for All Numbers of Colors? [Citation Graph (0, 0)][DBLP ] Conf ] Johannes Köbler , Jacobo Torán The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3. [Citation Graph (0, 0)][DBLP ] Conf ] Endre Boros , Vladimir Gurvich , Leonid Khachiyan , Kazuhisa Makino On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Khaled M. Elbassioni On Dualization in Products of Forests. [Citation Graph (0, 0)][DBLP ] Conf ] Renaud Lepère , Christophe Rapine An Asymptotic O(ln rho/ln ln rho)-Approximation Algorithm for the Scheduling Problem with Duplication on Large Communication Delay Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Hannah Bast Scheduling at Twilight the Easy Way. [Citation Graph (0, 0)][DBLP ] Conf ] Alain Darte , Guillaume Huard Complexity of Multi-dimensional Loop Alignment. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Hofmeister , Uwe Schöning , Rainer Schuler , Osamu Watanabe A Probabilistic 3-SAT Algorithm Further Improved. [Citation Graph (0, 0)][DBLP ] Conf ] Ulf Lorenz , Burkhard Monien The Secret of Selective Game Tree Search, When Using Random-Error Evaluations. [Citation Graph (0, 0)][DBLP ] Conf ] Victor Y. Pan Randomized Acceleration of Fundamental Matrix Computations. [Citation Graph (0, 0)][DBLP ] Conf ] L. Sunil Chandran , L. Shankar Ram Approximations for ATSP with Parametrized Triangle Inequality. [Citation Graph (0, 0)][DBLP ] Conf ] Joachim Giesen , Matthias John A New Diagram from Disks in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Langerman , Pat Morin , Michael A. Soss Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles. [Citation Graph (0, 0)][DBLP ] Conf ] Michael R. Fellows , Jens Gramm , Rolf Niedermeier On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Rolf Backofen , N. S. Narayanaswamy , Firas Swidan On the Complexity of Protein Similarity Search under mRNA Structure Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Manuel Bodirsky , Martin Kutz Pure Dominance Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Høyer , Ronald de Wolf Improved Quantum Communication Complexity Bounds for Disjointness and Equality. [Citation Graph (0, 0)][DBLP ] Conf ] Harumichi Nishimura On Quantum Computation with Some Restricted Amplitudes. [Citation Graph (0, 0)][DBLP ] Conf ] Mark Adcock , Richard Cleve A Quantum Goldreich-Levin Theorem with Cryptographic Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Hartmut Klauck On Quantum and Approximate Privacy. [Citation Graph (0, 0)][DBLP ] Conf ] Mart de Graaf , Ronald de Wolf On Quantum Versions of the Yao Principle. [Citation Graph (0, 0)][DBLP ] Conf ] Jörg Flum , Martin Grohe Describing Parameterized Complexity Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Krause On the Computational Power of Boolean Decision Lists. [Citation Graph (0, 0)][DBLP ] Conf ] Hans-Ulrich Simon How Many Missing Answers Can Be Tolerated by Query Learners? [Citation Graph (0, 0)][DBLP ] Conf ] Shin Aida , Marcel Crâsmaru , Kenneth W. Regan , Osamu Watanabe Games with a Uniqueness Property. [Citation Graph (0, 0)][DBLP ] Conf ] Aduri Pavan , Alan L. Selman Bi-Immunity Separates Strong NP-Completeness Notions. [Citation Graph (0, 0)][DBLP ] Conf ] Dima Grigoriev , Edward A. Hirsch , Dmitrii V. Pasechnik Complexity of Semi-algebraic Proofs. [Citation Graph (0, 0)][DBLP ] Conf ] Philipp Woelfel A Lower Bound Technique for Restricted Branching Programs and Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Andrei A. Krokhin , Peter Jeavons , Peter Jonsson The Complexity of Constraints on Intervals and Lengths. [Citation Graph (0, 0)][DBLP ] Conf ] Denis Thérien , Thomas Wilke Nesting Until and Since in Linear Temporal Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Till Tantau Comparing Verboseness for Finite Automata and Turing Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Krob , Jean Mairesse , Ioannis Michos On the Average Parallelism in Trace Monoids. [Citation Graph (0, 0)][DBLP ] Conf ] Dietrich Kuske A Further Step towards a Theory of Regular MSC Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Volker Diekert , Markus Lohrey Existential and Positive Theories of Equations in Graph Products. [Citation Graph (0, 0)][DBLP ] Conf ] Holger Petersen The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL. [Citation Graph (0, 0)][DBLP ] Conf ] Rémi Morin Recognizable Sets of Message Sequence Charts. [Citation Graph (0, 0)][DBLP ] Conf ] Jirí Srba Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard. [Citation Graph (0, 0)][DBLP ] Conf ] Marie-Pierre Béal , Dominique Perrin On the Enumerative Sequences of Regular Languages on k Symbols. [Citation Graph (0, 0)][DBLP ] Conf ] Christof Löding Ground Tree Rewriting Graphs of Bounded Tree Width. [Citation Graph (0, 0)][DBLP ] Conf ] Deepak D'Souza , P. Madhusudan Timed Control Synthesis for External Specifications. [Citation Graph (0, 0)][DBLP ] Conf ] Jos C. M. Baeten , Erik P. de Vink Axiomatizing GSOS with Termination. [Citation Graph (0, 0)][DBLP ] Conf ] Achim Blumensath Axiomatising Tree-Interpretable Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Emanuel Kieronski EXPSPACE-Complete Variant of Guarded Fragment with Transitivity. [Citation Graph (0, 0)][DBLP ] Conf ] Stéphane Demri , François Laroussinie , Ph. Schnoebelen A Parametric Analysis of the State Explosion Problem in Model Checking. [Citation Graph (0, 0)][DBLP ] Conf ] Markus Frick Generalized Model-Checking over Locally Tree-Decomposable Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Grohe , György Turán Learnability and Definability in Trees and Similar Structures. [Citation Graph (0, 0)][DBLP ] Conf ] 