Conferences in DBLP
Christos H. Papadimitriou Algorithms, Games, and the Internet. [Citation Graph (0, 0)][DBLP ] Conf ] Boris A. Trakhtenbrot Automata, Circuits, and Hybrids: Facets of Continuous Time. [Citation Graph (0, 0)][DBLP ] Conf ] Ahmed Bouajjani Languages, Rewriting Systems, and Verification of Infinite-State Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Große-Rhode Integrating Semantics for Object-Oriented System Models. [Citation Graph (0, 0)][DBLP ] Conf ] Mogens Nielsen Modelling with Partial Orders - Why and Why Not? [Citation Graph (0, 0)][DBLP ] Conf ] Ingo Wegener Theoretical Aspects of Evolutionary Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Markus Bläser Improvements of the Alder-Strassen Bound: Algebras with Nonzero Radical. [Citation Graph (0, 0)][DBLP ] Conf ] Endre Boros , Khaled M. Elbassioni , Vladimir Gurvich , Leonid Khachiyan , Kazuhisa Makino On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities. [Citation Graph (0, 0)][DBLP ] Conf ] William Hesse Division Is in Uniform TC0 . [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Lars Arge , Octavian Procopiuc , Jeffrey Scott Vitter A Framework for Index Bulk Loading and Dynamization. [Citation Graph (0, 0)][DBLP ] Conf ] Gianfranco Bilardi , Enoch Peserico A Characterization of Temporal Locality and Its Portability across Memory Hierarchies. [Citation Graph (0, 0)][DBLP ] Conf ] Gerth Stølting Brodal , Rolf Fagerberg , Christian N. S. Pedersen , Anna Östlin The Complexity of Constructing Evolutionary Trees Using Experiments. [Citation Graph (0, 0)][DBLP ] Conf ] Philippe Flajolet , Yves Guivarc'h , Wojciech Szpankowski , Brigitte Vallée Hidden Pattern Statistics. [Citation Graph (0, 0)][DBLP ] Conf ] Kunihiko Sadakane , Nadia Takki-Chebihi , Takeshi Tokuyama Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence. [Citation Graph (0, 0)][DBLP ] Conf ] Alexandre Tiskin All-Pairs Shortest Paths Computation in the BSP Model. [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle , Ronitt Rubinfeld , Luca Trevisan Approximating the Minimum Spanning Tree Weight in Sublinear Time. [Citation Graph (0, 0)][DBLP ] Conf ] Lars Engebretsen , Marek Karpinski Approximation Hardness of TSP with Bounded Metrics. [Citation Graph (0, 0)][DBLP ] Conf ] Uriel Feige , Michael Langberg The RPR2 Rounding Technique for Semidefinite Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Rajiv Gandhi , Samir Khuller , Aravind Srinivasan Approximation Algorithms for Partial Covering Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Steven S. Seiden On the Online Bin Packing Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Mikkel Thorup Quick k-Median, k-Center, and Facility Location for Sparse Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Jochen Alber , Henning Fernau , Rolf Niedermeier Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Liming Cai , David W. Juedes Subexponential Parameterized Algorithms Collapse the W-Hierarchy. [Citation Graph (0, 0)][DBLP ] Conf ] Amit Chakrabarti , Subhash Khot Improved Lower Bounds on the Randomized Complexity of Graph Properties. [Citation Graph (0, 0)][DBLP ] Conf ] Yevgeniy Dodis New Imperfect Random Source with Applications to Coin-Flipping. [Citation Graph (0, 0)][DBLP ] Conf ] Joel Friedman , Andreas Goerdt Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Fürer Weisfeiler-Lehman Refinement Requires at Least a Linear Number of Iterations. [Citation Graph (0, 0)][DBLP ] Conf ] Oded Goldreich , Salil P. Vadhan , Avi Wigderson On Interactive Proofs with a Laconic Prover. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Høyer , Jan Neerbek , Yaoyun Shi Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness. [Citation Graph (0, 0)][DBLP ] Conf ] Pranab Sen , Srinivasan Venkatesh Lower Bounds in the Quantum Cell Probe Model. [Citation Graph (0, 0)][DBLP ] Conf ] Emanuele Bandini , Roberto Segala Axiomatizations for Probabilistic Bisimulation. [Citation Graph (0, 0)][DBLP ] Conf ] Gérard Boudol , Ilaria Castellani Noninterference for Concurrent Programs. [Citation Graph (0, 0)][DBLP ] Conf ] P. Madhusudan , P. S. Thiagarajan Distributed Controller Synthesis for Local Specifications. [Citation Graph (0, 0)][DBLP ] Conf ] Davide Sangiorgi , Andrea Valente A Distributed Abstract Machine for Safe Ambients. [Citation Graph (0, 0)][DBLP ] Conf ] Franck van Breugel , James Worrell Towards Quantitative Verification of Probabilistic Transition Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Zhangjian Li , Shin-Ichi Nakano Efficient Generation of Plane Triangulations without Repetitions. [Citation Graph (0, 0)][DBLP ] Conf ] Guo-Hui Lin , Zhi-Zhong Chen , Tao Jiang , Jianjun Wen The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations. [Citation Graph (0, 0)][DBLP ] Conf ] Sang-Min Park , Jae-Ha Lee , Kyung-Yong Chwa Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher. [Citation Graph (0, 0)][DBLP ] Conf ] Salvador Roura A New Method for Balancing Binary Search Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Graham Cormode , S. Muthukrishnan , Süleyman Cenk Sahinalp Permutation Editing and Matching via Embeddings. [Citation Graph (0, 0)][DBLP ] Conf ] Artur Czumaj , Christian Sohler Testing Hypergraph Coloring. [Citation Graph (0, 0)][DBLP ] Conf ] Shuji Isobe , Xiao Zhou , Takao Nishizeki Total Colorings of Degenerated Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Luciano Margara , Janos Simon Decidable Properties of Graphs of All-Optical Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Nabil H. Mustafa , Aleksandar Pekec Majority Consensus and the Local Majority Rule. [Citation Graph (0, 0)][DBLP ] Conf ] Volker Diekert , Anca Muscholl Solvability of Equations in Free Partially Commutative Groups Is Decidable. [Citation Graph (0, 0)][DBLP ] Conf ] Manfred Droste , Guo-Qiang Zhang Rational Transformations of Formal Power Series. [Citation Graph (0, 0)][DBLP ] Conf ] Sébastien Ferenczi , Charles Holton , Luca Q. Zamboni Combinatorics of Three-Interval Exchanges. [Citation Graph (0, 0)][DBLP ] Conf ] Tero Harju , Oscar H. Ibarra , Juhani Karhumäki , Arto Salomaa Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Kirsten The Star Problem in Trace Monoids: Reductions Beyond C4. [Citation Graph (0, 0)][DBLP ] Conf ] Michal Kunc The Trace Coding Problem Is Undecidable. [Citation Graph (0, 0)][DBLP ] Conf ] Eric Rivals , Sven Rahmann Combinatorics of Periods in Strings. [Citation Graph (0, 0)][DBLP ] Conf ] Priti Shankar , P. N. A. Kumar , Harmeet Singh , B. Sundar Rajan Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct. [Citation Graph (0, 0)][DBLP ] Conf ] Parosh Aziz Abdulla , Luc Boasson , Ahmed Bouajjani Effective Lossy Queue Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Benedikt , Patrice Godefroid , Thomas W. Reps Model Checking of Unrestricted Hierarchical State Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Michele Boreale Symbolic Trace Analysis of Cryptographic Protocols. [Citation Graph (0, 0)][DBLP ] Conf ] Hubert Comon , Véronique Cortier , John Mitchell Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols. [Citation Graph (0, 0)][DBLP ] Conf ] Kousha Etessami , Thomas Wilke , Rebecca A. Schuller Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Georg Gottlob , Reinhard Pichler Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width. [Citation Graph (0, 0)][DBLP ] Conf ] Anca Muscholl , Doron Peled From Finite State Communication Protocols to High-Level Message Sequence Charts. [Citation Graph (0, 0)][DBLP ] Conf ] Ioannis Caragiannis , Afonso Ferreira , Christos Kaklamanis , Stephane Perennes , Hervé Rivano Fractional Path Coloring with Applications to WDM Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Edith Cohen , Eran Halperin , Haim Kaplan Performance Aspects of Distributed Caches Using TTL-Based Consistency. [Citation Graph (0, 0)][DBLP ] Conf ] Pierre Fraigniaud , Cyril Gavoille Routing in Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Jessen T. Havill Online Packet Routing on Linear Arrays and Rings. [Citation Graph (0, 0)][DBLP ] Conf ] Jop F. Sibeyn Faster Gossiping on Butterflies. [Citation Graph (0, 0)][DBLP ] Conf ] Rajeev Alur , Kousha Etessami , Mihalis Yannakakis Realizability and Verification of MSC Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] P. Madhusudan Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Patrick Maier A Set-Theoretic Framework for Assume-Guarantee Reasoning. [Citation Graph (0, 0)][DBLP ] Conf ] Mahesh Viswanathan , Ramesh Viswanathan Foundations for Circular Compositional Reasoning. [Citation Graph (0, 0)][DBLP ] Conf ] Chandra Chekuri , Sanjeev Khanna A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Marek Chrobak , János Csirik , Csanád Imreh , John Noga , Jiri Sgall , Gerhard J. Woeginger The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts. [Citation Graph (0, 0)][DBLP ] Conf ] Aleksei V. Fishkin , Klaus Jansen , Lorant Porkolab On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates. [Citation Graph (0, 0)][DBLP ] Conf ] Gerhard J. Woeginger On the Approximability of Average Completion Time Scheduling under Precedence Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Birgit Baum-Waidner Optimistic Asynchronous Multi-party Contract Signing with Reduced Number of Rounds. [Citation Graph (0, 0)][DBLP ] Conf ] Amos Beimel , Yuval Ishai Information-Theoretic Private Information Retrieval: A Unified Construction. [Citation Graph (0, 0)][DBLP ] Conf ] Joan Feigenbaum , Yuval Ishai , Tal Malkin , Kobbi Nissim , Martin Strauss , Rebecca N. Wright Secure Multiparty Computation of Approximations. [Citation Graph (0, 0)][DBLP ] Conf ] Aggelos Kiayias , Moti Yung Secure Games with Polynomial Expressions. [Citation Graph (0, 0)][DBLP ] Conf ] Miquel Bofill , Guillem Godoy On the Completeness of Arbitrary Selection Strategies for Paramodulation. [Citation Graph (0, 0)][DBLP ] Conf ] Furio Honsell , Marino Miculan , Ivan Scagnetto An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS. [Citation Graph (0, 0)][DBLP ] Conf ] Konstantin Korovin , Andrei Voronkov Knuth-Bendix Constraint Solving Is NP-Complete. [Citation Graph (0, 0)][DBLP ] Conf ] Lutz Schröder , Till Mossakowski , Andrzej Tarlecki Amalgamation in CASL via Enriched Signatures. [Citation Graph (0, 0)][DBLP ] Conf ] Albert Atserias , Maria Luisa Bonet , Juan Luis Esteban Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution. [Citation Graph (0, 0)][DBLP ] Conf ] Harry Buhrman , John Tromp , Paul M. B. Vitányi Time and Space Bounds for Reversible Simulation. [Citation Graph (0, 0)][DBLP ] Conf ] Jack Jie Dai , James I. Lathrop , Jack H. Lutz , Elvira Mayordomo Finite-State Dimension. [Citation Graph (0, 0)][DBLP ] Conf ] Lane A. Hemaspaandra , Sven Kosub , Klaus W. Wagner The Complexity of Computing the Size of an Interval. [Citation Graph (0, 0)][DBLP ] Conf ] Tomasz Jurdzinski , Miroslaw Kutylowski Communication Gap for Finite Memory Devices. [Citation Graph (0, 0)][DBLP ] Conf ] Rocco A. Servedio Separating Quantum and Classical Learning. [Citation Graph (0, 0)][DBLP ] Conf ] 