Conferences in DBLP
Serge Abiteboul A Calculus and Algebra for Distributed Data Management. [Citation Graph (0, 0)][DBLP ] Conf ] Moshe Y. Vardi The Büchi Complementation Saga. [Citation Graph (0, 0)][DBLP ] Conf ] Dorothea Wagner , Thomas Willhalm Speed-Up Techniques for Shortest-Path Computations. [Citation Graph (0, 0)][DBLP ] Conf ] Bruno Courcelle , Andrew Twigg Compact Forbidden-Set Routing. [Citation Graph (0, 0)][DBLP ] Conf ] Manfred Kunde A New Bound for Pure Greedy Hot Potato Routing. [Citation Graph (0, 0)][DBLP ] Conf ] Ioannis Caragiannis Wavelength Management in WDM Rings to Maximize the Number of Connections. [Citation Graph (0, 0)][DBLP ] Conf ] Jean Berstel , Luc Boasson , Olivier Carton , Isabelle Fagnot A First Investigation of Sturmian Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Sylvain Lombardy On the Size of the Universal Automaton of a Regular Language. [Citation Graph (0, 0)][DBLP ] Conf ] Francine Blanchet-Sadri , Joshua D. Gafni , Kevin H. Wilson Correlations of Partial Words. [Citation Graph (0, 0)][DBLP ] Conf ] Eldar Fischer , Orly Yahalom Testing Convexity Properties of Tree Colorings. [Citation Graph (0, 0)][DBLP ] Conf ] Amin Coja-Oghlan , Michael Krivelevich , Dan Vilenchik Why Almost All k -Colorable Graphs Are Easy. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Bürgisser On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds. [Citation Graph (0, 0)][DBLP ] Conf ] Troy Lee A New Rank Technique for Formula Size Lower Bounds. [Citation Graph (0, 0)][DBLP ] Conf ] Ilan Newman , Yuri Rabinovich Hard Metrics from Cayley Graphs of Abelian Groups. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Elsässer , Thomas Sauerwald Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Adrian Dumitrescu , Csaba D. Tóth Light Orthogonal Networks with Constant Geometric Dilation. [Citation Graph (0, 0)][DBLP ] Conf ] Dietmar Berwanger Admissibility in Infinite Games. [Citation Graph (0, 0)][DBLP ] Conf ] Hugo Gimbert Pure Stationary Optimal Strategies in Markov Decision Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Felix Brandt , Felix A. Fischer , Markus Holzer Symmetries and the Complexity of Pure Nash Equilibrium. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Král Computing Representations of Matroids of Bounded Branch-Width. [Citation Graph (0, 0)][DBLP ] Conf ] Pinar Heggernes , Karol Suchan , Ioan Todinca , Yngve Villanger Characterizing Minimal Interval Completions. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Glaßer , Alan L. Selman , Stephen D. Travers , Klaus W. Wagner The Complexity of Unions of Disjoint Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Laurent Bienvenu Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Funke , Sören Laue Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Hundt , Maciej Liskiewicz On the Complexity of Affine Image Matching. [Citation Graph (0, 0)][DBLP ] Conf ] Javier Esparza , Stefan Kiefer , Michael Luttenberger On Fixed Point Equations over Commutative Semirings. [Citation Graph (0, 0)][DBLP ] Conf ] Andrea Sattler-Klein An Exponential Lower Bound for Prefix Gröbner Bases in Free Monoid Rings. [Citation Graph (0, 0)][DBLP ] Conf ] Hans L. Bodlaender A Cubic Kernel for Feedback Vertex Set. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Damaschke The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting. [Citation Graph (0, 0)][DBLP ] Conf ] Marc Tedder , Derek G. Corneil An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Enrico Formenti , Petr Kurka A Search Algorithm for the Maximal Attractor of a Cellular Automaton. [Citation Graph (0, 0)][DBLP ] Conf ] Grégory Lafitte , Michael Weiss Universal Tilings. [Citation Graph (0, 0)][DBLP ] Conf ] Alberto Bertoni , Massimiliano Goldwurm , Violetta Lonati On the Complexity of Unary Tiling-Recognizable Picture Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Hans-Ulrich Simon A Characterization of Strong Learnability in the Statistical Query Model. [Citation Graph (0, 0)][DBLP ] Conf ] Jan Poland On the Consistency of Discrete Bayesian Learning. [Citation Graph (0, 0)][DBLP ] Conf ] Pascal Koiran , Sylvain Perifel VPSPACE and a Transfer Theorem over the Reals. [Citation Graph (0, 0)][DBLP ] Conf ] Jin-yi Cai , Pinyan Lu On Symmetric Signatures in Holographic Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Benjamin Doerr Randomly Rounding Rationals with Cardinality Constraints and Derandomizations. [Citation Graph (0, 0)][DBLP ] Conf ] Chien-Chung Huang Cheating to Get Better Roommates in a Random Stable Matching. [Citation Graph (0, 0)][DBLP ] Conf ] Costas Busch , Srikanta Tirthapura A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window. [Citation Graph (0, 0)][DBLP ] Conf ] Nutan Limaye , Meena Mahajan , B. V. Raghavendra Rao Arithmetizing Classes Around NC 1 and L. [Citation Graph (0, 0)][DBLP ] Conf ] Manindra Agrawal , Thanh Minh Hoang , Thomas Thierauf The Polynomially Bounded Perfect Matching Problem Is in NC 2 . [Citation Graph (0, 0)][DBLP ] Conf ] Arkadev Chattopadhyay , Andreas Krebs , Michal Koucký , Mario Szegedy , Pascal Tesson , Denis Thérien Languages with Bounded Multiparty Communication Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Telikepalli Kavitha , Kurt Mehlhorn , Dimitrios Michail New Approximation Algorithms for Minimum Cycle Bases of Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Iman Hajirasouliha , Hossein Jowhari , Ravi Kumar , Ravi Sundaram On Completing Latin Squares. [Citation Graph (0, 0)][DBLP ] Conf ] Artur Czumaj , Christian Sohler Small Space Representations for Metric Min-Sum k -Clustering and Their Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Davide Bresolin , Angelo Montanari , Pietro Sala An Optimal Tableau-Based Decision Algorithm for Propositional Neighborhood Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Schwentick , Volker Weber Bounded-Variable Fragments of Hybrid Logics. [Citation Graph (0, 0)][DBLP ] Conf ] Lutz Schröder , Dirk Pattinson Rank-1 Modal Logics Are Coalgebraic. [Citation Graph (0, 0)][DBLP ] Conf ] Gábor Ivanyos , Luc Sanselme , Miklos Santha An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew M. Childs , Aram Wettroth Harrow , Pawel Wocjan Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Masahito Hayashi , Kazuo Iwama , Harumichi Nishimura , Rudy Raymond Harry Putra , Shigeru Yamashita Quantum Network Coding. [Citation Graph (0, 0)][DBLP ] Conf ] Mikolaj Bojanczyk , Piotr Hoffman Reachability in Unions of Commutative Rewriting Systems Is Decidable. [Citation Graph (0, 0)][DBLP ] Conf ] Sergiu Bursuc , Hubert Comon-Lundh , Stéphanie Delaune Associative-Commutative Deducibility Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Ralf Küsters , Tomasz Truderung On the Automatic Analysis of Recursive Security Protocols with XOR. [Citation Graph (0, 0)][DBLP ] Conf ] Iftah Gamzu , Danny Segev Improved Online Algorithms for the Sorting Buffer Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Janina Brenner , Guido Schäfer Cost Sharing Methods for Makespan and Completion Time Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Oleg Verbitsky Planar Graphs: Logical Complexity and Parallel Isomorphism Tests. [Citation Graph (0, 0)][DBLP ] Conf ] Henning Schnoor , Ilka Schnoor Enumerating All Solutions for Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP ] Conf ] 