Conferences in DBLP
John H. Reif Molecular Assembly and Computation: From Theory to Experimental Demonstrations. [Citation Graph (0, 0)][DBLP ] Conf ] Madhav V. Marathe Towards a Predictive Computational Complexity Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew M. Pitts Equivariant Syntax and Semantics. [Citation Graph (0, 0)][DBLP ] Conf ] Géraud Sénizergues L(A) = L(B)? Decidability Results from Complete Formal Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Alberto Del Lungo , Andrea Frosini , Maurice Nivat , Laurent Vuillon Discrete Tomography: Reconstruction under Periodicity Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Heikki Mannila Local and Global Methods in Data Mining: Basic Techniques and Open Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Manuel V. Hermenegildo , Germán Puebla , Francisco Bueno , Pedro López-García Program Debugging and Validation Using Semantic Approximations and Partial Specifications. [Citation Graph (0, 0)][DBLP ] Conf ] Lars Engebretsen , Jonas Holmerin , Alexander Russell Inapproximability Results for Equations over Finite Groups. [Citation Graph (0, 0)][DBLP ] Conf ] Seth Pettie A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Colcombet On Families of Graphs Having a Decidable First Order Theory with Reachability. [Citation Graph (0, 0)][DBLP ] Conf ] Alex Fabrikant , Elias Koutsoupias , Christos H. Papadimitriou Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet. [Citation Graph (0, 0)][DBLP ] Conf ] Dimitris Fotakis , Spyros C. Kontogiannis , Elias Koutsoupias , Marios Mavronicolas , Paul G. Spirakis The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjeev Khanna , Joseph Naor , Danny Raz Control Message Aggregation in Group Communication Protocols. [Citation Graph (0, 0)][DBLP ] Conf ] Tomasz Jurdzinski , Krzysztof Lorys Church-Rosser Languages vs. UCFL. [Citation Graph (0, 0)][DBLP ] Conf ] Sebastian Bala Intersection of Regular Languages and Star Hierarchy. [Citation Graph (0, 0)][DBLP ] Conf ] Sylvain Lombardy On the Construction of Reversible Automata for Reversible Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Amr Elmasry Priority Queues, Pairing, and Adaptive Sorting. [Citation Graph (0, 0)][DBLP ] Conf ] Michael A. Bender , Richard Cole , Rajeev Raman Exponential Structures for Efficient Cache-Oblivious Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Russell Impagliazzo , Nathan Segerlind Bounded-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations. [Citation Graph (0, 0)][DBLP ] Conf ] Juan Luis Esteban , Nicola Galesi , Jochen Messner On the Complexity of Resolution with Bounded Conjunctions. [Citation Graph (0, 0)][DBLP ] Conf ] Aggelos Kiayias , Moti Yung Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes. [Citation Graph (0, 0)][DBLP ] Conf ] Yuval Ishai , Eyal Kushilevitz Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials. [Citation Graph (0, 0)][DBLP ] Conf ] Dima Grigoriev , Edward A. Hirsch , Dmitrii V. Pasechnik Exponential Lower Bound for Static Semi-algebraic Proofs. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Jakoby , Maciej Liskiewicz Paths Problems in Symmetric Logarithmic Space. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Damaschke Scheduling Search Procedures. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuo Iwama , Shiro Taketomi Removable Online Knapsack Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Leah Epstein , Steven S. Seiden , Rob van Stee New Bounds for Variable-Sized and Resource Augmented Online Bin Packing. [Citation Graph (0, 0)][DBLP ] Conf ] Nicolas Ollinger The Quest for Small Universal Cellular Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Christophe Papazian , Eric Rémila Hyperbolic Recognition by Graph Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Farid M. Ablayev , Cristopher Moore , Chris Pollett Quantum and Stochastic Branching Programs of Bounded Width. [Citation Graph (0, 0)][DBLP ] Conf ] Luisa Gargano , Pavol Hell , Ladislav Stacho , Ugo Vaccaro Spanning Trees with Bounded Number of Branch Vertices. [Citation Graph (0, 0)][DBLP ] Conf ] René Beier , Peter Sanders , Naveen Sivadasan Energy Optimal Routing in Radio Networks Using Geometric Data Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Malin Christersson , Leszek Gasieniec , Andrzej Lingas Gossiping with Bounded Size Messages in ad hoc Radio Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang Merkle The Kolmogorov-Loveland Stochastic Sequences Are Not Closed under Selecting Subsequences. [Citation Graph (0, 0)][DBLP ] Conf ] Robert A. Hearn , Erik D. Demaine The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Víctor Dalmau Constraint Satisfaction Problems in Non-deterministic Logarithmic Space. [Citation Graph (0, 0)][DBLP ] Conf ] Gerth Stølting Brodal , Rolf Fagerberg Cache Oblivious Distribution Sweeping. [Citation Graph (0, 0)][DBLP ] Conf ] Anna Östlin , Rasmus Pagh One-Probe Search. [Citation Graph (0, 0)][DBLP ] Conf ] Moses Charikar , Piotr Indyk , Rina Panigrahy New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Keye Martin , Michael W. Mislove , James Worrell Measuring the Probabilistic Powerdomain. [Citation Graph (0, 0)][DBLP ] Conf ] C.-H. Luke Ong , Pietro Di Gianantonio Games Characterizing Levy-Longo Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Andrej Bauer , Martín Hötzel Escardó , Alex K. Simpson Comparing Functional Paradigms for Exact Real-Number Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Philippe Duchon , Philippe Flajolet , Guy Louchard , Gilles Schaeffer Random Sampling from Boltzmann Principles. [Citation Graph (0, 0)][DBLP ] Conf ] Amalia Duch , Conrado Martínez On the Average Performance of Orthogonal Range Search in Multidimensional Data Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Marco Kick Bialgebraic Modelling of Timed Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Franck van Breugel , Steven Shalit , James Worrell Testing Labelled Markov Processes. [Citation Graph (0, 0)][DBLP ] Conf ] John M. Hitchcock , Jack H. Lutz Why Computational Complexity Requires Stricter Martingales. [Citation Graph (0, 0)][DBLP ] Conf ] John M. Hitchcock Correspondence Principles for Effective Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] José Meseguer , Grigore Rosu A Total Approach to Partial Algebraic Specification. [Citation Graph (0, 0)][DBLP ] Conf ] Markus Lohrey , Pedro R. D'Argenio , Holger Hermanns Axiomatising Divergence. [Citation Graph (0, 0)][DBLP ] Conf ] Luca Cardelli , Philippa Gardner , Giorgio Ghelli A Spatial Logic for Querying Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Tomasz Radzik Improving Time Bounds on Maximum Generalised Flow Computations by Contracting the Network. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Berman , Marek Karpinski Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION. [Citation Graph (0, 0)][DBLP ] Conf ] Camil Demetrescu , Giuseppe F. Italiano Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas A. Henzinger , Sriram C. Krishnan , Orna Kupferman , Freddy Y. C. Mang Synthesis of Uninitialized Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Blaise Genest , Anca Muscholl , Helmut Seidl , Marc Zeitoun Infinite-State High-Level MSCs: Model-Checking and Realizability. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Wich Universal Inherence of Cycle-Free Context-Free Ambiguity Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Sudipto Guha , Piotr Indyk , S. Muthukrishnan , Martin Strauss Histogramming Data Streams with Fast Per-Item Processing. [Citation Graph (0, 0)][DBLP ] Conf ] Moses Charikar , Kevin Chen , Martin Farach-Colton Finding Frequent Items in Data Streams. [Citation Graph (0, 0)][DBLP ] Conf ] Thierry Cachat Symbolic Strategy Synthesis for Games on Pushdown Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Jirí Srba Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard. [Citation Graph (0, 0)][DBLP ] Conf ] Gerth Stølting Brodal , Rune B. Lyngsø , Anna Östlin , Christian N. S. Pedersen Solving the String Statistics Problem in Time O(n log n). [Citation Graph (0, 0)][DBLP ] Conf ] Xiaotie Deng , Guojun Li , Zimao Li , Bin Ma , Lusheng Wang A PTAS for Distinguishing (Sub)string Selection. [Citation Graph (0, 0)][DBLP ] Conf ] Dietrich Kuske , Markus Lohrey On the Theory of One-Step Rewriting in Trace Monoids. [Citation Graph (0, 0)][DBLP ] Conf ] Michal Bielecki , Jan Hidders , Jan Paredaens , Jerzy Tyszkiewicz , Jan Van den Bussche Navigating with a Browser. [Citation Graph (0, 0)][DBLP ] Conf ] V. S. Anil Kumar , Madhav V. Marathe Improved Results for Stackelberg Scheduling Strategies. [Citation Graph (0, 0)][DBLP ] Conf ] Udo Adamy , Christoph Ambühl , R. Sai Anand , Thomas Erlebach Call Control in Rings. [Citation Graph (0, 0)][DBLP ] Conf ] Marek Chrobak , Leah Epstein , John Noga , Jiri Sgall , Rob van Stee , Tomás Tichý , Nodari Vakhania Preemptive Scheduling in Overloaded Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Juhani Karhumäki , Leonid P. Lisovik The Equivalence Problem of Finite Substitutions on ab* c, with Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Colin Stirling Deciding DPDA Equivalence Is Primitive Recursive. [Citation Graph (0, 0)][DBLP ] Conf ] Mikolaj Bojanczyk Two-Way Alternating Automata and Finite Models. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Berman , Marek Karpinski , Yakov Nekrich Approximating Huffman Codes in Parallel. [Citation Graph (0, 0)][DBLP ] Conf ] Carlo Fantozzi , Andrea Pietracaprina , Geppino Pucci Seamless Integration of Parallelism and Memory Hierarchy. [Citation Graph (0, 0)][DBLP ] Conf ] Noam Nisan The Communication Complexity of Approximate Set Packing and Covering. [Citation Graph (0, 0)][DBLP ] Conf ] Benjamin Doerr Antirandomizing the Wrong Game. [Citation Graph (0, 0)][DBLP ] Conf ] Karhan Akcoglu , Petros Drineas , Ming-Yang Kao Fast Universalization of Investment Strategies with Provably Good Relative Returns. [Citation Graph (0, 0)][DBLP ] Conf ] Micah Adler , Harald Räcke , Naveen Sivadasan , Christian Sohler , Berthold Vöcking Randomized Pursuit-Evasion in Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] J. B. Wells The Essence of Principal Typings. [Citation Graph (0, 0)][DBLP ] Conf ] Bharat Adsul , Milind A. Sohoni Complete and Tractable Local Linear Time Temporal Logics over Traces. [Citation Graph (0, 0)][DBLP ] Conf ] Paul Gastin , Madhavan Mukund An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP ] Conf ] Vasco Brattka Random Numbers and an Incomplete Immune Recursive Set. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Hertling A Banach-Mazur Computable But Not Markov Computable Function on the Computable Real Numbers. [Citation Graph (0, 0)][DBLP ] Conf ] Artur Czumaj , Andrzej Lingas , Hairong Zhao Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Björklund , Thore Husfeldt Finding a Path of Superlogarithmic Length. [Citation Graph (0, 0)][DBLP ] Conf ] Ryuhei Uehara Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Jonas Holmerin Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Yoshiharu Kohayakawa , Brendan Nagle , Vojtech Rödl Efficient Testing of Hypergraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Xiaodong Wu , Danny Z. Chen Optimal Net Surface Problems with Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Nicolas Bonichon , Bertrand Le Saëc , Mohamed Mosbah Wagner's Theorem on Realizers. [Citation Graph (0, 0)][DBLP ] Conf ] Vincenzo Liberatore Circular Arrangements. [Citation Graph (0, 0)][DBLP ] Conf ] 