Conferences in DBLP
Jan A. Bergstra , Inge Bethke Polarized Process Algebra and Program Equivalence. [Citation Graph (0, 0)][DBLP ] Conf ] Anne Condon Problems on RNA Secondary Structure Prediction and Design. [Citation Graph (0, 0)][DBLP ] Conf ] Amos Fiat Some Issues Regarding Search, Censorship, and Anonymity in Peer to Peer Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Petra Mutzel The SPQR-Tree Data Structure in Graph Drawing. [Citation Graph (0, 0)][DBLP ] Conf ] Doron Peled Model Checking and Testing Combined. [Citation Graph (0, 0)][DBLP ] Conf ] Moshe Y. Vardi Logic and Automata: A Match Made in Heaven. [Citation Graph (0, 0)][DBLP ] Conf ] Juraj Hromkovic , Georg Schnitger Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes. [Citation Graph (0, 0)][DBLP ] Conf ] Annalisa De Bonis , Leszek Gasieniec , Ugo Vaccaro Generalized Framework for Selectors with Applications in Optimal Group Testing. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Bleichenbacher , Aggelos Kiayias , Moti Yung Decoding of Interleaved Reed Solomon Codes over Noisy Data. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Blom , Wan Fokkink , Sumit Nain On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces. [Citation Graph (0, 0)][DBLP ] Conf ] Daniele Gorla , Rosario Pugliese Resource Access and Mobility Control with Dynamic Privileges Acquisition. [Citation Graph (0, 0)][DBLP ] Conf ] Nadia Busi , Maurizio Gabbrielli , Gianluigi Zavattaro Replication vs. Recursive Definitions in Channel Based Calculi. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander A. Ageev , Yinyu Ye , Jiawei Zhang Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Markus Bläser An Improved Approximation Algorithm for the Asymmetric TSP with Strengthened Triangle Inequality. [Citation Graph (0, 0)][DBLP ] Conf ] Rajiv Gandhi , Eran Halperin , Samir Khuller , Guy Kortsarz , Aravind Srinivasan An Improved Approximation Algorithm for Vertex Cover with Hard Capacities. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjeev Arora , Kevin L. Chang Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Chandra Chekuri , Sudipto Guha , Joseph Naor Approximating Steiner k-Cuts. [Citation Graph (0, 0)][DBLP ] Conf ] Amin Coja-Oghlan , Cristopher Moore , Vishal Sanwalani MAX k-CUT and Approximating the Chromatic Number of Random Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Elkin , Guy Kortsarz Approximation Algorithm for Directed Telephone Multicast Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Davide Ancona , Sonia Fagorzi , Eugenio Moggi , Elena Zucca Mixin Modules and Computational Effects. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Okhotin Decision Problems for Language Equations with Boolean Operations. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Bruni , José Meseguer Generalized Rewrite Theories. [Citation Graph (0, 0)][DBLP ] Conf ] Luis Antunes , Lance Fortnow Sophistication Revisited. [Citation Graph (0, 0)][DBLP ] Conf ] John M. Hitchcock , Jack H. Lutz , Elvira Mayordomo Scaled Dimension and Nonuniform Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Høyer , Michele Mosca , Ronald de Wolf Quantum Search on Bounded-Error Inputs. [Citation Graph (0, 0)][DBLP ] Conf ] Rahul Jain , Jaikumar Radhakrishnan , Pranab Sen A Direct Sum Theorem in Communication Complexity via Message Compression. [Citation Graph (0, 0)][DBLP ] Conf ] Gianni Franceschini , Roberto Grossi Optimal Cache-Oblivious Implicit Dictionaries. [Citation Graph (0, 0)][DBLP ] Conf ] Anna Gál , Peter Bro Miltersen The Cell Probe Complexity of Succinct Data Structures. [Citation Graph (0, 0)][DBLP ] Conf ] J. Ian Munro , Rajeev Raman , Venkatesh Raman , S. Srinivasa Rao Succinct Representations of Permutations. [Citation Graph (0, 0)][DBLP ] Conf ] Rajeev Raman , S. Srinivasa Rao Succinct Dynamic Dictionaries and Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Amos Korman , David Peleg Labeling Schemes for Weighted Dynamic Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Surender Baswana , Sandeep Sen A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n1+1/k ) Size in Weighted Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Hall , Steffen Hippler , Martin Skutella Multicommodity Flows over Time: Efficient Algorithms and Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Chandra Chekuri , Marcelo Mydlarz , F. Bruce Shepherd Multicommodity Demand Flow in a Tree. [Citation Graph (0, 0)][DBLP ] Conf ] Manfred Droste , Dietrich Kuske Skew and Infinitary Formal Power Series. [Citation Graph (0, 0)][DBLP ] Conf ] Juraj Hromkovic , Georg Schnitger Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser's Separation. [Citation Graph (0, 0)][DBLP ] Conf ] François Denis , Yann Esposito Residual Languages and Probabilistic Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Mariëlle Stoelinga , Frits W. Vaandrager A Testing Scenario for Probabilistic Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Géraud Sénizergues The Equivalence Problem for t-Turn DPDA Is Co-NP. [Citation Graph (0, 0)][DBLP ] Conf ] Markus Holzer , Martin Kutrib Flip-Pushdown Automata: k+1 Pushdown Reversals Are Better than k. [Citation Graph (0, 0)][DBLP ] Conf ] Eyal Even-Dar , Alexander Kesselman , Yishay Mansour Convergence Time to Nash Equilibria. [Citation Graph (0, 0)][DBLP ] Conf ] Rainer Feldmann , Martin Gairing , Thomas Lücking , Burkhard Monien , Manuel Rode Nashification and the Coordination Ratio for a Selfish Routing Game. [Citation Graph (0, 0)][DBLP ] Conf ] Vipul Bansal , Aseem Agrawal , Varun S. Malhotra Stable Marriages with Multiple Partners: Efficient Search for an Optimal Solution. [Citation Graph (0, 0)][DBLP ] Conf ] Endre Boros , Khaled M. Elbassioni , Vladimir Gurvich , Leonid Khachiyan , Kazuhisa Makino An Intersection Inequality for Discrete Distributions and Related Generation Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Thierry Cachat Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Mayr Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Massimo Merro , Francesco Zappa Nardelli Bisimulation Proof Methods for Mobile Ambients. [Citation Graph (0, 0)][DBLP ] Conf ] Arnaud Carayol , Thomas Colcombet On Equivalent Representations of Infinite Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Arnold Schönhage Adaptive Raising Strategies Optimizing Relative Efficiency. [Citation Graph (0, 0)][DBLP ] Conf ] René Sitters , Leen Stougie , Willem de Paepe A Competitive Algorithm for the General 2-Server Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Dimitris Fotakis On the Competitive Ratio for Online Facility Location. [Citation Graph (0, 0)][DBLP ] Conf ] Susanne Albers , Rob van Stee A Study of Integrated Document and Connection Caching. [Citation Graph (0, 0)][DBLP ] Conf ] Gaoyan Xie , Zhe Dang , Oscar H. Ibarra A Solvable Class of Quadratic Diophantine Equations with Applications to Verification of Infinite-State Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Felix Klaedtke , Harald Rueß Monadic Second-Order Logics with Cardinalities. [Citation Graph (0, 0)][DBLP ] Conf ] Orna Kupferman , Moshe Y. Vardi Pi2 cap Sigma2 equiv AFMC. [Citation Graph (0, 0)][DBLP ] Conf ] Tatiana Rybina , Andrei Voronkov Upper Bounds for a Theory of Queues. [Citation Graph (0, 0)][DBLP ] Conf ] Noam Berger , Béla Bollobás , Christian Borgs , Jennifer T. Chayes , Oliver Riordan Degree Distribution of the FKP Network Model. [Citation Graph (0, 0)][DBLP ] Conf ] Vincent D. Blondel , Paul Van Dooren Similarity Matrices for Pairs of Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Randeep Bhatia , Julia Chuzhoy , Ari Freund , Joseph Naor Algorithmic Aspects of Bandwidth Trading. [Citation Graph (0, 0)][DBLP ] Conf ] Jan Johannsen , Martin Lange CTL+ Is Complete for Double Exponential Time. [Citation Graph (0, 0)][DBLP ] Conf ] Salvatore La Torre , Margherita Napoli , Mimmo Parente , Gennaro Parlato Hierarchical and Recursive State Machines with Context-Dependent Properties. [Citation Graph (0, 0)][DBLP ] Conf ] Ph. Schnoebelen Oracle Circuits for Branching-Time Model Checking. [Citation Graph (0, 0)][DBLP ] Conf ] Luisa Gargano , Mikael Hammar There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them). [Citation Graph (0, 0)][DBLP ] Conf ] Jirí Fiala , Daniël Paulusma The Computational Complexity of the Role Assignment Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , Fedor V. Fomin , Mohammad Taghi Hajiaghayi , Dimitrios M. Thilikos Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Jianer Chen , Iyad A. Kanj , Ljubomir Perkovic , Eric Sedgwick , Ge Xia Genus Characterizes the Complexity of Graph Problems: Some Tight Results. [Citation Graph (0, 0)][DBLP ] Conf ] Cindy Eisner , Dana Fisman , John Havlicek , Anthony McIsaac , David Van Campenhout The Definition of a Temporal Clock Operator. [Citation Graph (0, 0)][DBLP ] Conf ] Zena M. Ariola , Hugo Herbelin Minimal Classical Logic and Control Operators. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas A. Henzinger , Ranjit Jhala , Rupak Majumdar Counterexample-Guided Control. [Citation Graph (0, 0)][DBLP ] Conf ] Jo Erskine Hannay Axiomatic Criteria for Quotients and Subobjects for Higher-Order Data Types. [Citation Graph (0, 0)][DBLP ] Conf ] Yossi Matias , Ely Porat Efficient Pebbling for List Traversal Synopses. [Citation Graph (0, 0)][DBLP ] Conf ] Amihood Amir , Yonatan Aumann , Richard Cole , Moshe Lewenstein , Ely Porat Function Matching: Algorithms, Applications, and a Lower Bound. [Citation Graph (0, 0)][DBLP ] Conf ] Juha Kärkkäinen , Peter Sanders Simple Linear Work Suffix Array Construction. [Citation Graph (0, 0)][DBLP ] Conf ] Francisco Gutiérrez , Blas C. Ruiz Expansion Postponement via Cut Elimination in Sequent Calculi for Pure Type Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Michele Bugliesi , Silvia Crafa , Amela Prelic , Vladimiro Sassone Secrecy in Untrusted Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Arkadev Chattopadhyay , Denis Thérien Locally Commutative Categories. [Citation Graph (0, 0)][DBLP ] Conf ] Ernst-Erich Doberkat Semi-pullbacks and Bisimulations in Categories of Stochastic Relations. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Moshe Rabinovich Quantitative Analysis of Probabilistic Lossy Channel Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Luca de Alfaro , Thomas A. Henzinger , Rupak Majumdar Discounting the Future in Systems Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Luca de Alfaro , Marco Faella Information Flow in Concurrent Games. [Citation Graph (0, 0)][DBLP ] Conf ] Satoshi Ikeda , Izumi Kubo , Norihiro Okumoto , Masafumi Yamashita Impact of Local Topological Information on Random Walks on Finite Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Jens Jägersküpper Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Dominique Poulalhon , Gilles Schaeffer Optimal Coding and Sampling of Triangulations. [Citation Graph (0, 0)][DBLP ] Conf ] Manuel Bodirsky , Clemens Gröpl , Mihyun Kang Generating Labeled Planar Graphs Uniformly at Random. [Citation Graph (0, 0)][DBLP ] Conf ] Pierluigi Crescenzi , Giorgio Gambosi , Gaia Nicosia , Paolo Penna , Walter Unger Online Load Balancing Made Simple: Greedy Strikes Back. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Naor , Hadas Shachnai , Tami Tamir Real-Time Scheduling with a Budget. [Citation Graph (0, 0)][DBLP ] Conf ] Brian C. Dean , Michel X. Goemans Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , André Brinkmann , Christian Scheideler Anycasting in Adversarial Systems: Routing and Admission Control. [Citation Graph (0, 0)][DBLP ] Conf ] Sergei Bespamyatnikh , Michael Segal Dynamic Algorithms for Approximating Interdistances. [Citation Graph (0, 0)][DBLP ] Conf ] Mark Cieliebak , Paola Flocchini , Giuseppe Prencipe , Nicola Santoro Solving the Robots Gathering Problem. [Citation Graph (0, 0)][DBLP ] Conf ] 