Conferences in DBLP
Miklós Ajtai Generating Hard Instances of the Short Basis Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Luca Cardelli Wide Area Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Kevin J. Compton , Scott Dexter Proof Techniques for Cryptographic Protocols. [Citation Graph (0, 0)][DBLP ] Conf ] Karl Crary , J. Gregory Morrisett Type Structure for Low-Level Programming Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Felipe Cucker Real Computations with Fake Numbers. [Citation Graph (0, 0)][DBLP ] Conf ] N. G. de Bruijn A Model for Associative Memory, a Basis for Thinking and Consciousness. [Citation Graph (0, 0)][DBLP ] Conf ] Abbas Edalat , Marko Krznaric Numerical Integration with Exact Real Arithmetic. [Citation Graph (0, 0)][DBLP ] Conf ] Juris Hartmanis Observations about the Nature and State of Computer Science (Keynote Address). [Citation Graph (0, 0)][DBLP ] Conf ] Grzegorz Rozenberg , Arto Salomaa DNA Computing: New Ideas and Paradigms. [Citation Graph (0, 0)][DBLP ] Conf ] Jeffrey Scott Vitter Online Data Structures in External Memory. [Citation Graph (1, 0)][DBLP ] Conf ] Osamu Watanabe From Computational Learning Theory to Discovery Science. [Citation Graph (0, 0)][DBLP ] Conf ] Eric Allender , Andris Ambainis , David A. Mix Barrington , Samir Datta , Huong LeThanh Bounded Depth Arithmetic Circuits: Counting and Closure. [Citation Graph (0, 0)][DBLP ] Conf ] Rajeev Alur , Kousha Etessami , Salvatore La Torre , Doron Peled Parametric Temporal Logic for "Model Measuring". [Citation Graph (0, 0)][DBLP ] Conf ] Rajeev Alur , Sampath Kannan , Mihalis Yannakakis Communicating Hierarchical State Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander E. Andreev , Juri L. Baskakov , Andrea E. F. Clementi , José D. P. Rolim Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Marek A. Bednarczyk , Andrzej M. Borzyszkowski General Morphisms of Petri Nets (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Berman , Marek Karpinski On Some Tighter Inapproximability Results (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Patricia Bouyer , Antoine Petit Decomposition and Composition of Timed Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Harry Buhrman , Tao Jiang , Ming Li , Paul M. B. Vitányi New Applications of the Incompressibility Method. [Citation Graph (0, 0)][DBLP ] Conf ] Luca Cardelli , Andrew D. Gordon , Giorgio Ghelli Mobility Types for Mobile Ambients. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Clote Protein Folding, the Levinthal Paradox and Rapidly Mixing Markov Chains. [Citation Graph (0, 0)][DBLP ] Conf ] Véronique Cortier , Harald Ganzinger , Florent Jacquemard , Margus Veanes Decidable Fragments of Simultaneous Rigid Reachability. [Citation Graph (0, 0)][DBLP ] Conf ] Maxime Crochemore , Filippo Mignosi , Antonio Restivo , Sergio Salemi Text Compression Using Antidictionaries. [Citation Graph (0, 0)][DBLP ] Conf ] Alfredo De Santis , Giovanni Di Crescenzo , Giuseppe Persiano Non-Interactive Zero-Knowledge: A Low-Randomness Characterization of NP. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Dickhöfer , Thomas Wilke Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Yevgeniy Dodis , Sanjeev Khanna Space Time Tradeoffs for Graph Properties. [Citation Graph (0, 0)][DBLP ] Conf ] Catherine Dufourd , Petr Jancar , Ph. Schnoebelen Boundedness of Reset P/T Nets. [Citation Graph (0, 0)][DBLP ] Conf ] Joost Engelfriet , Hendrik Jan Hoogeboom Two-Way Finite State Transducers and Monadic Second-Order Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Sergio Flesca , Sergio Greco Partially Ordered Regular Languages for Graph Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Markus Frick , Martin Grohe Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs. [Citation Graph (1, 0)][DBLP ] Conf ] Vashti Galpin Comparison of Process Algebra Equivalences Using Formats. [Citation Graph (0, 0)][DBLP ] Conf ] Cyril Gavoille , Nicolas Hanusse Compact Routing Tables for Graphs of Bounded Genus. [Citation Graph (0, 0)][DBLP ] Conf ] Georg Gottlob , Nicola Leone , Francesco Scarcello Computing LOGCFL Certificates. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Grossi , Giuseppe F. Italiano Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Arvind Gupta , Damon Kaller , Thomas C. Shermer On the Complements of Partial k-Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Mikael Hammar , Bengt J. Nilsson Approximation Results for Kinetic Variants of TSP. [Citation Graph (0, 0)][DBLP ] Conf ] Yehuda Hassin , David Peleg Distributed Probabilistic Polling and Applications to Proportionate Agreement. [Citation Graph (0, 0)][DBLP ] Conf ] Yoram Hirshfeld , Mark Jerrum Bisimulation Equivanlence Is Decidable for Normed Process Algebra. [Citation Graph (0, 0)][DBLP ] Conf ] Yoram Hirshfeld , Alexander Moshe Rabinovich A Framework for Decidable Metrical Logics. [Citation Graph (0, 0)][DBLP ] Conf ] Juraj Hromkovic , Georg Schnitger On the Power of Las Vegas II. Two-Way Finite Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuo Iwama , David Manlove , Shuichi Miyazaki , Yasufumi Morita Stable Marriage with Incomplete Lists and Ties. [Citation Graph (0, 0)][DBLP ] Conf ] Tao Jiang , Ming Li , Paul M. B. Vitányi Average-Case Complexity of Shellsort. [Citation Graph (0, 0)][DBLP ] Conf ] Dong Kyue Kim , Kunsoo Park Linear-Time Construction of Two-Dimensional Suffix Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Kirsten A Connection between the Star Problem and the Finite Power Property in Trace Monoids. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Kirsten , Jerzy Marcinkowski Two Techniques in the Area of the Star Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Krause , Petr Savický , Ingo Wegener Approximations by OBDDs and the Variable Ordering Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Antonín Kucera , Richard Mayr Simulation Preorder on Simple Process Algebras. [Citation Graph (0, 0)][DBLP ] Conf ] Cosimo Laneve , Björn Victor Solos in Concert. [Citation Graph (0, 0)][DBLP ] Conf ] Mark Lanthier , Anil Maheshwari , Jörg-Rüdiger Sack Shortest Anisotropic Paths on Terrains. [Citation Graph (0, 0)][DBLP ] Conf ] Arto Lepistö Relations between Local and Global Periodicity of Words. [Citation Graph (0, 0)][DBLP ] Conf ] Andrzej Lingas , Hans Olsson , Anna Östlin Efficient Merging, Construction, and Maintenance of Evolutionary Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Marino Miculan Formalizing a Lazy Substitution Proof System for µ-calculus in the Calculus of Inductive Constructions. [Citation Graph (0, 0)][DBLP ] Conf ] Codrin M. Nichitiu , Eric Rémila Leader Election by d Dimensional Cellular Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Rolf Niedermeier , Peter Rossmanith New Upper Bounds for MaxSat. [Citation Graph (0, 0)][DBLP ] Conf ] Vadim Olshevsky , Victor Y. Pan Polynomial and Rational Evaluation and Interpolation (with Structured Matrices). [Citation Graph (0, 0)][DBLP ] Conf ] Rasmus Pagh Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time. [Citation Graph (0, 0)][DBLP ] Conf ] Timo Peichl , Heribert Vollmer Finite Automata with Generalized Acceptance Criteria. [Citation Graph (0, 0)][DBLP ] Conf ] David Peleg , Eilon Reshef A Variant of the Arrow Distributed Directory with Low Average Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] John Power , Hayo Thielecke Closed Freyd- and kappa-categories. [Citation Graph (0, 0)][DBLP ] Conf ] Jon G. Riecke , Hayo Thielecke Typed Exeptions and Continuations Cannot Macro-Express Each Other. [Citation Graph (0, 0)][DBLP ] Conf ] Jan J. M. M. Rutten Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Sanders Accessing Multiple Sequences Through Set Associative Caches. [Citation Graph (0, 0)][DBLP ] Conf ] Géraud Sénizergues T(A) = T(B)? [Citation Graph (0, 0)][DBLP ] Conf ] Mario Szegedy Many-Valued Logics and Holographic Proofs. [Citation Graph (0, 0)][DBLP ] Conf ] Christopher Umans On the Complexity and Inapproximability of Shortest Implicant Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Weihrauch , Ning Zhong 0002 The Wave Propagator Is Turing Computable. [Citation Graph (0, 0)][DBLP ] Conf ] Gerhard J. Woeginger An FPTAS for Agreeably Weighted Variance on a Single Machine. [Citation Graph (0, 0)][DBLP ] Conf ] Alexandre Tiskin Erratum: Bulk-synchronous Parallel Multiplication of Boolean Matrices. [Citation Graph (0, 0)][DBLP ] Conf ] 