Conferences in DBLP
Samson Abramsky Game Semantics: Achievements and Prospects. [Citation Graph (0, 0)][DBLP ] Conf ] Lars Engebretsen , Jonas Holmerin Clique Is Hard to Approximate within n 1-o (1) . [Citation Graph (0, 0)][DBLP ] Conf ] Michael Krivelevich , Van H. Vu Approximating the Independence Number and the Chromatic Number in Expected Polynominal Time. [Citation Graph (0, 0)][DBLP ] Conf ] Cristiano Calcagno , Eugenio Moggi , Walid Taha Closed Types as a Simple Approach to Safe Imperative Multi-stage Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Alan Mycroft , Richard Sharp A Statically Allocated Parallel Functional Language. [Citation Graph (0, 0)][DBLP ] Conf ] Seth Pettie , Vijaya Ramachandran An Optimal Minimum Spanning Tree Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Torben Hagerup Improved Shortest Paths on the Word RAM. [Citation Graph (0, 0)][DBLP ] Conf ] Stephen Alstrup , Jacob Holm Improved Algorithms for Finding Level Ancestors in Dynamic Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Gordon D. Plotkin , John Power , Donald Sannella , Robert D. Tennent Lax Logical Relations. [Citation Graph (0, 0)][DBLP ] Conf ] Dan R. Ghica , Guy McCusker Reasoning about Idealized ALGOL Using Regular Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Keye Martin The Measurement Process in Domain Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Gregor Engels , Reiko Heckel Graph Transformation as a Conceptual and Formal Framework for System Modeling and Model Evolution. [Citation Graph (0, 0)][DBLP ] Conf ] Albert Atserias , Nicola Galesi , Ricard Gavaldà Monotone Proofs of the Pigeon Hole Principle. [Citation Graph (0, 0)][DBLP ] Conf ] Gerald Lüttgen , Michael Mendler Fully-Abstract Statecharts Semantics via Intuitionistic Kripke Models. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Bruni , Vladimiro Sassone Algebraic Models for Contextual Nets. [Citation Graph (0, 0)][DBLP ] Conf ] Beate Bollig , Ingo Wegener Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Juraj Hromkovic , Juhani Karhumäki , Hartmut Klauck , Georg Schnitger , Sebastian Seibert Measures of Nondeterminism in Finite Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Volker Diekert , Paul Gastin LTL Is Expressively Complete for Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP ] Conf ] Ben C. Moszkowski An Automata-Theoretic Completeness Proof for Interval Temporal Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Johan Håstad Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms? [Citation Graph (0, 0)][DBLP ] Conf ] Evgeny Dantsin , Andreas Goerdt , Edward A. Hirsch , Uwe Schöning Deterministic Algorithms for k -SAT Based on Covering Codes and Local Search. [Citation Graph (0, 0)][DBLP ] Conf ] Johannes Blömer Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices. [Citation Graph (0, 0)][DBLP ] Conf ] Leonid Libkin Variable Independence, Quantifier Elimination, and Constraint Representations. [Citation Graph (0, 0)][DBLP ] Conf ] Andrei A. Bulatov , Andrei A. Krokhin , Peter Jeavons Constraint Satisfaction Problems and Finite Algebras. [Citation Graph (0, 0)][DBLP ] Conf ] Steven S. Seiden An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing. [Citation Graph (0, 0)][DBLP ] Conf ] János Csirik , Gerhard J. Woeginger Resource Augmentation for Online Bounded Space Bin Packing. [Citation Graph (0, 0)][DBLP ] Conf ] Christoph Ambühl , Bernd Gärtner , Bernhard von Stengel Optimal Projective Algorithms for the List Update Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Antonín Kucera Efficient Verification Algorithms for One-Counter Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Mayr On the Complexity of Bisimulation Problems for Basic Parallel Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Denis Lugiez , Ph. Schnoebelen Decidable First-Order Transition Logics for PA-Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Riccardo Focardi , Roberto Gorrieri , Fabio Martinelli Non Interference for the Analysis of Cryptographic Protocols. [Citation Graph (0, 0)][DBLP ] Conf ] Ali Akhavi , Brigitte Vallée Average Bit-Complexity of Euclidean Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Cyril Banderier , Philippe Flajolet , Gilles Schaeffer , Michèle Soria Planar Maps and Airy Phenomena. [Citation Graph (0, 0)][DBLP ] Conf ] Barbara König Analysing Input/Output-Capabilities of Mobile Processes with a Generic Type System. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew Hennessy , James Riely Information Flow vs. Resource Access in the Asynchronous Pi-Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Richard M. Karp The Genomics Revolution and Its Challenges for Algorithmic Research. [Citation Graph (0, 0)][DBLP ] Conf ] Zohar Manna , Henny Sipma Alternating the Temporal Picture for Safety. [Citation Graph (0, 0)][DBLP ] Conf ] Alfredo De Santis , Giovanni Di Crescenzo , Giuseppe Persiano Necessary and Sufficient Assumptions for Non-iterative Zero-Knowledge Proofs of Knowledge for All NP Relations. [Citation Graph (0, 0)][DBLP ] Conf ] William Aiello , Sandeep N. Bhatt , Rafail Ostrovsky , Sivaramakrishnan Rajagopalan Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP. [Citation Graph (0, 0)][DBLP ] Conf ] Javier Esparza , Keijo Heljanko A New Unfolding Approach to LTL Model Checking. [Citation Graph (0, 0)][DBLP ] Conf ] B. Meenakshi , Ramaswamy Ramanujam Reasoning about Message Passing in Finite State Environments. [Citation Graph (0, 0)][DBLP ] Conf ] Olivier Baudron , David Pointcheval , Jacques Stern Extended Notions of Security for Multicast Public Key Cryptosystems. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Cachin , Jan Camenisch , Joe Kilian , Joy Müller One-Round Secure Computation and Secure Autonomous Mobile Agents. [Citation Graph (0, 0)][DBLP ] Conf ] Birgit Baum-Waidner , Michael Waidner Round-Optimal and Abuse Free Optimistic Multi-party Contract Signing. [Citation Graph (0, 0)][DBLP ] Conf ] Juhani Karhumäki , Ion Petre On the Centralizer of a Finite Set. [Citation Graph (0, 0)][DBLP ] Conf ] Frank Neven , Thomas Schwentick On the Power of Tree-Walking Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Marie-Pierre Béal , Olivier Carton Determinization of Transducers over Infinite Words. [Citation Graph (0, 0)][DBLP ] Conf ] Kurt Mehlhorn Constraint Programming and Graph Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Haim Kaplan , Michael Krivelevich , Dahlia Malkhi , Julien P. Stern Scalable Secure Storage when Half the System Is Faulty. [Citation Graph (0, 0)][DBLP ] Conf ] Endre Boros , Vladimir Gurvich , Leonid Khachiyan , Kazuhisa Makino Generating Partial and Multiple Transversals of a Hypergraph. [Citation Graph (0, 0)][DBLP ] Conf ] José Espírito Santo Revisiting the Correspondence between Cut Elimination and Normalisation. [Citation Graph (0, 0)][DBLP ] Conf ] Reinhard Pichler Negation Elimination from Simple Equational Formulae. [Citation Graph (0, 0)][DBLP ] Conf ] V. S. Anil Kumar , Sunil Arya , H. Ramesh Hardness of Set Cover with Intersection 1. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Elkin , David Peleg Strong Inapproximability of the Basic k -Spanner Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Dietrich Kuske Infinite Series-Parallel Posets: Logic and Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Tomasz Fryderyk Urbanski On Deciding if Deterministic Rabin Language Is in Büchi Class. [Citation Graph (0, 0)][DBLP ] Conf ] Jesper G. Henriksen , Madhavan Mukund , K. Narayan Kumar , P. S. Thiagarajan On Message Sequence Graphs and Finitely Generated Regular MSC Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Oded Goldreich Pseudorandomness. [Citation Graph (0, 0)][DBLP ] Conf ] Leslie Ann Goldberg , Mark Jerrum , Sampath Kannan , Mike Paterson A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols. [Citation Graph (0, 0)][DBLP ] Conf ] Bogdan S. Chlebus , Leszek Gasieniec , Anna Östlin , John Michael Robson Deterministic Radio Broadcasting. [Citation Graph (0, 0)][DBLP ] Conf ] Wan Fokkink , S. P. Luttik An omega -Complete Equational Specification of Interleaving. [Citation Graph (0, 0)][DBLP ] Conf ] Mario Bravetti , Roberto Gorrieri A Complete Axiomatization for Observational Congruence of Prioritized Finite-State Behaviors. [Citation Graph (0, 0)][DBLP ] Conf ] Micah Adler , Faith E. Fich , Leslie Ann Goldberg , Mike Paterson Tight Size Bounds for Packet Headers in Narrow Meshes. [Citation Graph (0, 0)][DBLP ] Conf ] Luciano Margara , Janos Simon Wavelength Assignment Problem on All-Optical Networks with k Fibres per Link. [Citation Graph (0, 0)][DBLP ] Conf ] Christel Baier , Boudewijn R. Haverkort , Holger Hermanns , Joost-Pieter Katoen On the Logical Characterisation of Performability Properties. [Citation Graph (0, 0)][DBLP ] Conf ] Olivier Bournez , Oded Maler On the Representation of Timed Polyhedra. [Citation Graph (0, 0)][DBLP ] Conf ] Andrei Z. Broder Min-wise Independent Permutations: Theory and Practice. [Citation Graph (0, 0)][DBLP ] Conf ] Michael A. Bender , Dana Ron Testing Acyclicity of Directed Graphs in Sublinear Time. [Citation Graph (0, 0)][DBLP ] Conf ] Hristo Djidjev Computing the Girth of a Planar Graph. [Citation Graph (0, 0)][DBLP ] Conf ] Hervé Fournier , Pascal Koiran Lower Bounds Are Not Easier over the Reals: Inside PH. [Citation Graph (0, 0)][DBLP ] Conf ] Ganesh Baliga , John Case , Wolfgang Merkle , Frank Stephan Unlearning Helps. [Citation Graph (0, 0)][DBLP ] Conf ] Artur Czumaj , Andrzej Lingas Fast Approximation Schemes for Euclidean Multi-connectivity Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Michelangelo Grigni Approximate TSP in Graphs with Forbidden Minors. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Jansen , Lorant Porkolab Polynominal Time Approximation Schemes for General Multiprocessor Job Shop Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Pierre McKenzie , Thomas Schwentick , Denis Thérien , Heribert Vollmer The Many Faces of a Translation. [Citation Graph (0, 0)][DBLP ] Conf ] Jack H. Lutz Gales and the Constructive Dimension of Individual Sequences. [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang Merkle The Global Power of Additional Queries to p-Random Oracles. [Citation Graph (0, 0)][DBLP ] Conf ] Josh Buresh-Oppenheim , Matthew Clegg , Russell Impagliazzo , Toniann Pitassi Homogenization and the Polynominal Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] 