Conferences in DBLP
Yonit Kesten , Amir Pnueli , Li-on Raviv Algorithmic Verification of Linear Temporal Logic Specifications. [Citation Graph (0, 0)][DBLP ] Conf ] Bernd Borchert , Dietrich Kuske , Frank Stephan On Existentially First-Order Definable Languages and Their Relation to NP. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-François Raymond , Pascal Tesson , Denis Thérien An Algebraic Approach to Communication Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Rajeev Alur , Kenneth L. McMillan , Doron Peled Deciding Global Partial-Order Properties. [Citation Graph (0, 0)][DBLP ] Conf ] Xinxin Liu , Scott A. Smolka Simple Linear-Time Algorithms for Minimal Fixed Points (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Thore Husfeldt , Theis Rauhe Hardness Results for Dynamic Problems by Extensions of Fredman and Saks' Chronogram Method. [Citation Graph (0, 0)][DBLP ] Conf ] Torben Hagerup Simpler and Faster Dictionaries on the AC0 RAM. [Citation Graph (0, 0)][DBLP ] Conf ] Slawomir Lasota Partial-Congruence Factorization of Bisimilarity Induced by Open Maps. [Citation Graph (0, 0)][DBLP ] Conf ] Catherine Dufourd , Alain Finkel , Ph. Schnoebelen Reset Nets Between Decidability and Undecidability. [Citation Graph (0, 0)][DBLP ] Conf ] Mark H. Overmars Geometric Algorithms for Robotic Manipulation. [Citation Graph (0, 0)][DBLP ] Conf ] Richie Chih-Nan Chuang , Ashim Garg , Xin He , Ming-Yang Kao , Hsueh-I Lu Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses. [Citation Graph (0, 0)][DBLP ] Conf ] Thorsten Graf , Kamakoti Veezhinathan Reducing Simple Polygons to Triangles - A Proof for an Improved Conjecture. [Citation Graph (0, 0)][DBLP ] Conf ] Igor Walukiewicz Difficult Configurations - On the Complexity of LTrL. [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Boigelot , Stéphane Rassart , Pierre Wolper On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] David Peleg Distributed Matroid Basis Completion via Elimination Upcast and Distributed Correction of Minimum-Weight Spanning Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Magnús M. Halldórsson , Jan Kratochvíl , Jan Arne Telle Independent Sets with Domination Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Madhavan Mukund , K. Narayan Kumar , Jaikumar Radhakrishnan , Milind A. Sohoni Robust Asynchronous Protocols Are Finite-State. [Citation Graph (0, 0)][DBLP ] Conf ] Petr Jancar , Antonín Kucera , Richard Mayr Deciding Bisimulation-Like Equivalences with Finite-State Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Avi Wigderson Do Probabilistic Algorithms Outperform Deterministic Ones? [Citation Graph (0, 0)][DBLP ] Conf ] Vince Grolmusz A Degree-Decreasing Lemma for (MOD q - MOD p) Circuits. [Citation Graph (0, 0)][DBLP ] Conf ] Chi-Jen Lu Improved Pseudorandom Generators for Combinatorial Rectangles. [Citation Graph (0, 0)][DBLP ] Conf ] Amir Pnueli , Ofer Strichman , Michael Siegel Translation Validation for Synchronous Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Vladimir A. Zakharov An Efficient and Unified Approach to the Decidability of Equivalence of Propositional Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Stasys Jukna , Stanislav Zák On Branching Programs With Bounded Uncertainty (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Amir M. Ben-Amram , Holger Petersen CONS-Free Programs with Tree Input (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Paolo Baldan , Andrea Corradini , Ugo Montanari Concatenable Graph Processes: Relating Processes and Derivation Traces. [Citation Graph (0, 0)][DBLP ] Conf ] Fabio Gadducci , Ugo Montanari Axioms for Contextual Net Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew M. Pitts Existential Types: Logical Relations and Operational Equivalence. [Citation Graph (0, 0)][DBLP ] Conf ] Conrado Martínez , Salvador Roura Optimal Sampling Strategies in Quicksort. [Citation Graph (0, 0)][DBLP ] Conf ] Martin E. Dyer , Catherine S. Greenhill A Genuinely Polynomial-Time Algorithms for Sampling Two-Rowed Contingency Tables. [Citation Graph (0, 0)][DBLP ] Conf ] John Power , Giuseppe Rosolini A Modular Approach to Denotational Semantics. [Citation Graph (0, 0)][DBLP ] Conf ] Pasquale Malacaria , Chris Hankin Generalised Flowcharts and Games. [Citation Graph (0, 0)][DBLP ] Conf ] Ming-Yang Kao , Jie Wang Efficient Minimization of Numerical Summation Errors. [Citation Graph (0, 0)][DBLP ] Conf ] Cristina Bazgan , Miklos Santha , Zsolt Tuza Efficient Approximation Algorithms for the Subset-Sums Equality Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Eduardo Giménez Structural Recursive Definitions in Type Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Denis Lugiez A Good Class of Tree Automata and Application to Inductive Theorem Proving. [Citation Graph (0, 0)][DBLP ] Conf ] Juhani Karhumäki , Arto Lepistö , Wojciech Plandowski Locally Periodic Infinite Words and a Chaotic Behaviour. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Eric Pin Bridges for Concatenation Hierarchies. [Citation Graph (0, 0)][DBLP ] Conf ] Huimin Lin Complete Proof Systems for Observation Congruences in Finite-Control pi-Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Björn Victor , Joachim Parrow Concurrent Constraints in the Fusion Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Michele d'Amico , Giovanni Manzini , Luciano Margara On Computing the Entropy of Cellular Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Adam L. Buchsbaum , Raffaele Giancarlo , Jeffery Westbrook On the Determinization of Weighted Finite Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Alexandre Tiskin Bulk-Synchronous Parallel Multiplication of Boolean Matrices. [Citation Graph (0, 0)][DBLP ] Conf ] Hélène Touzet A Complex Example of a Simplifying Rewrite System. [Citation Graph (0, 0)][DBLP ] Conf ] Paul-André Melliès On a Duality Between Kruskal and Dershowitz Theorems. [Citation Graph (0, 0)][DBLP ] Conf ] Daria Walukiewicz A Total AC-Compatible Reduction Ordering on Higher-Order Terms. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas A. Henzinger Model Checking Game Properties of Multi-agent Systems (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Luisa Gargano Limited Wavelength Conversion in All-Optical Tree Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Shiva Chaudhuri , K. V. Subrahmanyam , Frank Wagner , Christos D. Zaroliagis Computing Mimicking Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Christel Baier , Joost-Pieter Katoen , Diego Latella Metric Semantics for True Concurrent Real Time. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas A. Henzinger , Jean-François Raskin , Pierre-Yves Schobbens The Regular Real-Time Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Serafino Cicerone , Gabriele Di Stefano , Michele Flammini Static and Dynamic Low-Congested Interval Routing Schemes. [Citation Graph (0, 0)][DBLP ] Conf ] Doug Cook , Vance Faber , Madhav V. Marathe , Aravind Srinivasan , Yoram J. Sussmann Low-Bandwidth Routing and Electrical Power Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Fritz Henglein , Jakob Rehof Constraint Automata and the Complexity of Recursive Subtype Entailment. [Citation Graph (0, 0)][DBLP ] Conf ] Moshe Y. Vardi Reasoning about The Past with Two-Way Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Leslie G. Valiant A Neuroidal Architecture for Cognitive Computation. [Citation Graph (0, 0)][DBLP ] Conf ] David Peleg , Eilon Reshef Deterministic Polylog Approximation for Minimum Communication Spanning Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Artur Czumaj , Andrzej Lingas A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Sewell Global/Local Subtyping and Capability Inference for a Distributed pi-calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Zhoujun Li , Huowang Chen Checking Strong/Weak Bisimulation Equivalences and Observation Congruence for the pi-Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Dario Bini , Gianna M. Del Corso , Giovanni Manzini , Luciano Margara Inversion of Circulant Matrices over Zm . [Citation Graph (0, 0)][DBLP ] Conf ] Wojciech Plandowski , Wojciech Rytter Application of Lempel-Ziv Encodings to the Solution of Words Equations. [Citation Graph (0, 0)][DBLP ] Conf ] Neil Ghani , Valeria de Paiva , Eike Ritter Explicit Substitutions for Constructive Necessity. [Citation Graph (0, 0)][DBLP ] Conf ] Gilles Barthe The Relevance of Proof-Irrelevance. [Citation Graph (0, 0)][DBLP ] Conf ] Gilles Brassard New Horizons in Quantum Information Processing. [Citation Graph (0, 0)][DBLP ] Conf ] Ivan Damgård , Birgit Pfitzmann Sequential Iteration of Interactive Arguments and an Efficient Zero-Knowledge Argument for NP. [Citation Graph (0, 0)][DBLP ] Conf ] Alfredo De Santis , Giovanni Di Crescenzo , Giuseppe Persiano , Moti Yung Image Density is Complete for Non-Interactive-SZK (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Peter Hertling , Klaus Weihrauch Randomness Spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Antonio Bucciarelli , Ivano Salvo Totality, Definability and Boolean Ciruits. [Citation Graph (0, 0)][DBLP ] Conf ] Gilles Brassard , Peter Høyer , Alain Tapp Quantum Counting. [Citation Graph (0, 0)][DBLP ] Conf ] Tatsuya Akutsu , Mutsunori Yagiura On the Complexity of Deriving Score Functions from Examples for Problems in Molecular Biology. [Citation Graph (0, 0)][DBLP ] Conf ] Cédric Fournet , Georges Gonthier A Hierarchy of Equivalences for Asynchronous Calculi. [Citation Graph (0, 0)][DBLP ] Conf ] Massimo Merro , Davide Sangiorgi On Asynchrony in Name-Passing Calculi. [Citation Graph (0, 0)][DBLP ] Conf ] Martín Abadi Protection in Programming-Language Translations. [Citation Graph (0, 0)][DBLP ] Conf ] Holger Petersen , John Michael Robson Efficient Simulations by Queue Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Pavol Duris , Tomasz Jurdzinski , Miroslaw Kutylowski , Krzysztof Lorys Power of Cooperation and Multihead Finite Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Olivier Danvy A Simple Solution to Type Specialization. [Citation Graph (0, 0)][DBLP ] Conf ] Walid Taha , Zine-El-Abidine Benaissa , Tim Sheard Multi-Stage Programming: Axiomatization and Type Safety. [Citation Graph (0, 0)][DBLP ] Conf ] 