Conferences in DBLP
Victor Vianu Logic as a Query Language: From Frege to XML. [Citation Graph (0, 0)][DBLP ] Conf ] Alain Viari How Does Computer Science Change Molecular Biology? [Citation Graph (0, 0)][DBLP ] Conf ] Ching-Chi Lin , Hsueh-I Lu , I-Fan Sun Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer. [Citation Graph (0, 0)][DBLP ] Conf ] Ileana Streinu , Sue Whitesides Rectangle Visibility Graphs: Characterization, Construction, and Compaction. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Bose , Anil Maheshwari , Giri Narasimhan , Michiel H. M. Smid , Norbert Zeh Approximating Geometric Bottleneck Shortest Paths. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Langerman , William L. Steiger Optimization in Arrangements. [Citation Graph (0, 0)][DBLP ] Conf ] Pascal Tesson , Denis Thérien Complete Classifications for the Communication Complexity of Regular Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Juhani Karhumäki , Michel Latteux , Ion Petre The Commutation with Codes and Ternary Sets of Words. [Citation Graph (0, 0)][DBLP ] Conf ] Guillem Godoy , Ashish Tiwari , Rakesh M. Verma On the Confluence of Linear Shallow Term Rewrite Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Victor L. Selivanov Wadge Degrees of omega-Languages of Deterministic Turing Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Dariusz R. Kowalski , Andrzej Pelc Faster Deterministic Broadcasting in Ad Hoc Radio Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Jakoby , Maciej Liskiewicz , Rüdiger Reischuk Private Computations in Networks: Topology versus Randomness. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Erlebach , Stamatis Stefanakos On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements. [Citation Graph (0, 0)][DBLP ] Conf ] Claus-Peter Schnorr Lattice Reduction by Random Sampling and Birthday Methods. [Citation Graph (0, 0)][DBLP ] Conf ] Qi Cheng On the Ultimate Complexity of Factorials. [Citation Graph (0, 0)][DBLP ] Conf ] Xizhong Zheng , Robert Rettinger , Burchard von Braunmühl On the Effective Jordan Decomposability. [Citation Graph (0, 0)][DBLP ] Conf ] Lucian Ilie , Baozhen Shan , Sheng Yu Fast Algorithms for Extended Regular Expression Matching and Searching. [Citation Graph (0, 0)][DBLP ] Conf ] Veli Mäkinen , Gonzalo Navarro , Esko Ukkonen Algorithms for Transposition Invariant String Matching. [Citation Graph (0, 0)][DBLP ] Conf ] Anton Mityagin On the Complexity of Finding a Local Maximum of Functions on Discrete Planar Subsets. [Citation Graph (0, 0)][DBLP ] Conf ] Harry Buhrman , Lance Fortnow , Aduri Pavan Some Results on Derandomization. [Citation Graph (0, 0)][DBLP ] Conf ] Eike Kiltz On the Representation of Boolean Predicates of the Diffie-Hellman Function. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Høyer , Robert Spalek Quantum Circuits with Unbounded Fan-out. [Citation Graph (0, 0)][DBLP ] Conf ] Marek Chrobak , Jiri Sgall Analysis of the Harmonic Algorithm for Three Servers. [Citation Graph (0, 0)][DBLP ] Conf ] Nikhil Bansal , Kedar Dhamdhere , Jochen Könemann , Amitabh Sinha Non-clairvoyant Scheduling for Minimizing Mean Slowdown. [Citation Graph (0, 0)][DBLP ] Conf ] Dimitris Fotakis , Rasmus Pagh , Peter Sanders , Paul G. Spirakis Space Efficient Hash Tables with Worst Case Constant Access Time. [Citation Graph (0, 0)][DBLP ] Conf ] Hervé Brönnimann , Frédéric Cazals , Marianne Durand Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure. [Citation Graph (0, 0)][DBLP ] Conf ] Beate Bollig Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Sauerhoff Randomness versus Nondeterminism for Read-Once and Read- k Branching Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Petr Hlinený Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids. [Citation Graph (0, 0)][DBLP ] Conf ] Ricard Gavaldà , Denis Thérien Algebraic Characterizations of Small Classes of Boolean Functions. [Citation Graph (0, 0)][DBLP ] Conf ] John Hershberger , Subhash Suri , Amit M. Bhosle On the Difficulty of Some Shortest Path Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Tomás Feder , Adam Meyerson , Rajeev Motwani , Liadan O'Callaghan , Rina Panigrahy Representing Graph Metrics with Fewest Edges. [Citation Graph (0, 0)][DBLP ] Conf ] Tomás Feder , Rajeev Motwani , Liadan O'Callaghan , Chris Olston , Rina Panigrahy Computing Shortest Paths with Uncertainty. [Citation Graph (0, 0)][DBLP ] Conf ] Andrei A. Krokhin , Benoit Larose Solving Order Constraints in Logarithmic Space. [Citation Graph (0, 0)][DBLP ] Conf ] Vasco Brattka The Inversion Problem for Computable Linear Operators. [Citation Graph (0, 0)][DBLP ] Conf ] Markus Bläser Algebras of Minimal Rank over Arbitrary Fields. [Citation Graph (0, 0)][DBLP ] Conf ] Oliver Giel , Ingo Wegener Evolutionary Algorithms and the Maximum Matching Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Sankowski Alternative Algorithms for Counting All Matchings in Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Robert W. Irving , David Manlove , Sandy Scott Strong Stability in the Hospitals/Residents Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Arnaud Durand , Miki Hermann The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete. [Citation Graph (0, 0)][DBLP ] Conf ] Dietrich Kuske , Markus Lohrey Decidable Theories of Cayley-Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Szeider The Complexity of Resolution with Generalized Symmetry Rules. [Citation Graph (0, 0)][DBLP ] Conf ] Amin Coja-Oghlan , Anusch Taraz Colouring Random Graphs in Expected Polynomial Time. [Citation Graph (0, 0)][DBLP ] Conf ] Nicolas Bonichon , Cyril Gavoille , Nicolas Hanusse An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation. [Citation Graph (0, 0)][DBLP ] Conf ] Amin Coja-Oghlan Finding Large Independent Sets in Polynomial Expected Time. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Damaschke Distributed Soft Path Coloring. [Citation Graph (0, 0)][DBLP ] Conf ] Jin-yi Cai , Venkatesan T. Chakaravarthy , Lane A. Hemaspaandra , Mitsunori Ogihara Competing Provers Yield Improved Karp-Lipton Collapse Results. [Citation Graph (0, 0)][DBLP ] Conf ] Harry Buhrman , Richard Chang , Lance Fortnow One Bit of Advice. [Citation Graph (0, 0)][DBLP ] Conf ] Marcus Schaefer , Frank Stephan Strong Reductions and Immunity for Exponential Time. [Citation Graph (0, 0)][DBLP ] Conf ] Pierre McKenzie , Klaus W. Wagner The Complexity of Membership Problems for Circuits over Sets of Natural Numbers. [Citation Graph (0, 0)][DBLP ] Conf ] Wil Michiels , Jan H. M. Korst , Emile H. L. Aarts , Jan van Leeuwen Performance Ratios for the Differencing Method Applied to the Balanced Number Partitioning Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Malik Magdon-Ismail , Costas Busch , Mukkai S. Krishnamoorthy Cake-Cutting Is Not a Piece of Cake. [Citation Graph (0, 0)][DBLP ] Conf ] Kunal Talwar The Price of Truth: Frugality in Truthful Mechanisms. [Citation Graph (0, 0)][DBLP ] Conf ] Patricia Bouyer Untameable Timed Automata! [Citation Graph (0, 0)][DBLP ] Conf ] Nicolas Ollinger The Intrinsic Universality Problem of One-Dimensional Cellular Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Julien Cervelle , Enrico Formenti On Sand Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Amr Elmasry , Michael L. Fredman Adaptive Sorting and the Information Theoretic Lower Bound. [Citation Graph (0, 0)][DBLP ] Conf ] Henrik Björklund , Sven Sandberg , Sergei G. Vorobyov A Discrete Subexponential Algorithm for Parity Games. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Backes , Christian Jacobi 0002 Cryptographically Sound and Machine-Assisted Verification of Security Protocols. [Citation Graph (0, 0)][DBLP ] Conf ] Véronique Bruyère , Emmanuel Dall'Olio , Jean-François Raskin Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic. [Citation Graph (0, 0)][DBLP ] Conf ] 