Search results for "ICALP"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Daniel Bleichenbacher, Aggelos Kiayias, Moti Yung	Decoding of Interleaved Reed Solomon Codes over Noisy Data.	ICALP	2003	DBLP DOI BibTeX RDF
1	Susanne Albers, Rob van Stee	A Study of Integrated Document and Connection Caching.	ICALP	2003	DBLP DOI BibTeX RDF
1	Philippe Schnoebelen	Oracle Circuits for Branching-Time Model Checking.	ICALP	2003	DBLP DOI BibTeX RDF
1	François Denis, Yann Esposito	Residual Languages and Probabilistic Automata.	ICALP	2003	DBLP DOI BibTeX RDF
1	Sanjeev Arora, Kevin L. Chang	Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem.	ICALP	2003	DBLP DOI BibTeX RDF
1	Stefan Blom, Wan J. Fokkink, Sumit Nain	On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces.	ICALP	2003	DBLP DOI BibTeX RDF
1	Anne Condon	Problems on RNA Secondary Structure Prediction and Design.	ICALP	2003	DBLP DOI BibTeX RDF
1	Zena M. Ariola, Hugo Herbelin	Minimal Classical Logic and Control Operators.	ICALP	2003	DBLP DOI BibTeX RDF
1	Vipul Bansal, Aseem Agrawal, Varun S. Malhotra	Stable Marriages with Multiple Partners: Efficient Search for an Optimal Solution.	ICALP	2003	DBLP DOI BibTeX RDF
1	Michele Bugliesi, Silvia Crafa, Amela Prelic, Vladimiro Sassone	Secrecy in Untrusted Networks.	ICALP	2003	DBLP DOI BibTeX RDF
1	Chandra Chekuri, Sudipto Guha, Joseph Naor	Approximating Steiner k-Cuts.	ICALP	2003	DBLP DOI BibTeX RDF	Multiway Cut, $k$-Cut, Steiner tree, minimum cut, primal-dual
1	Surender Baswana, Sandeep Sen	A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n1+1/k) Size in Weighted Graphs.	ICALP	2003	DBLP DOI BibTeX RDF	Randomized algorithms, Shortest path, Graph algorithms
1	Brian C. Dean, Michel X. Goemans	Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling.	ICALP	2003	DBLP DOI BibTeX RDF
1	Alex Fabrikant, Elias Koutsoupias, Christos H. Papadimitriou	Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet.	ICALP	2002	DBLP DOI BibTeX RDF
1	José Meseguer 0001, Grigore Rosu	A Total Approach to Partial Algebraic Specification.	ICALP	2002	DBLP DOI BibTeX RDF
1	Michael A. Bender, Richard Cole 0001, Rajeev Raman	Exponential Structures for Efficient Cache-Oblivious Algorithms.	ICALP	2002	DBLP DOI BibTeX RDF
1	Thomas A. Henzinger, Sriram C. Krishnan, Orna Kupferman, Freddy Y. C. Mang	Synthesis of Uninitialized Systems.	ICALP	2002	DBLP DOI BibTeX RDF
1	Piotr Berman, Marek Karpinski, Yakov Nekrich	Approximating Huffman Codes in Parallel.	ICALP	2002	DBLP DOI BibTeX RDF	Parallel Algorithms, Approximation Algorithms, Huffman Codes
1	Markus Lohrey, Pedro R. D'Argenio, Holger Hermanns	Axiomatising Divergence.	ICALP	2002	DBLP DOI BibTeX RDF
1	Sudipto Guha, Piotr Indyk, S. Muthukrishnan 0001, Martin Strauss 0001	Histogramming Data Streams with Fast Per-Item Processing.	ICALP	2002	DBLP DOI BibTeX RDF
1	Benjamin Doerr	Antirandomizing the Wrong Game.	ICALP	2002	DBLP DOI BibTeX RDF	Games, randomization, derandomization
1	Jirí Srba	Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard.	ICALP	2002	DBLP DOI BibTeX RDF
1	Lars Engebretsen, Jonas Holmerin, Alexander Russell	Inapproximability Results for Equations over Finite Groups.	ICALP	2002	DBLP DOI BibTeX RDF
1	Amalia Duch, Conrado Martínez	On the Average Performance of Orthogonal Range Search in Multidimensional Data Structures.	ICALP	2002	DBLP DOI BibTeX RDF
1	Nicolas Ollinger	The Quest for Small Universal Cellular Automata.	ICALP	2002	DBLP DOI BibTeX RDF
1	Seth Pettie	A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs.	ICALP	2002	DBLP DOI BibTeX RDF
1	Géraud Sénizergues	L(A) = L(B)? Decidability Results from Complete Formal Systems.	ICALP	2002	DBLP DOI BibTeX RDF
1	C.-H. Luke Ong, Pietro Di Gianantonio	Games Characterizing Levy-Longo Trees.	ICALP	2002	DBLP DOI BibTeX RDF
1	Vasco Brattka	Random Numbers and an Incomplete Immune Recursive Set.	ICALP	2002	DBLP DOI BibTeX RDF	r.e. closed sets, immune sets, Kolmogorov complexity, random numbers, Computable analysis
1	Juhani Karhumäki, Leonid P. Lisovik	The Equivalence Problem of Finite Substitutions on ab*c, with Applications.	ICALP	2002	DBLP DOI BibTeX RDF
1	Kazuo Iwama, Shiro Taketomi	Removable Online Knapsack Problems.	ICALP	2002	DBLP DOI BibTeX RDF
1	Wolfgang Merkle	The Kolmogorov-Loveland Stochastic Sequences Are Not Closed under Selecting Subsequences.	ICALP	2002	DBLP DOI BibTeX RDF
1	René Beier, Peter Sanders 0001, Naveen Sivadasan	Energy Optimal Routing in Radio Networks Using Geometric Data Structures.	ICALP	2002	DBLP DOI BibTeX RDF
1	Thierry Cachat	Symbolic Strategy Synthesis for Games on Pushdown Graphs.	ICALP	2002	DBLP DOI BibTeX RDF
1	Gerth Stølting Brodal, Rune B. Lyngsø, Anna Östlin, Christian N. S. Pedersen	Solving the String Statistics Problem in Time O(n log n).	ICALP	2002	DBLP DOI BibTeX RDF
1	John M. Hitchcock, Jack H. Lutz	Why Computational Complexity Requires Stricter Martingales.	ICALP	2002	DBLP DOI BibTeX RDF
1	Sanjeev Khanna, Joseph Naor, Danny Raz	Control Message Aggregation in Group Communication Protocols.	ICALP	2002	DBLP DOI BibTeX RDF
1	Peter Damaschke	Scheduling Search Procedures.	ICALP	2002	DBLP DOI BibTeX RDF
1	Gerth Stølting Brodal, Rolf Fagerberg	Cache Oblivious Distribution Sweeping.	ICALP	2002	DBLP DOI BibTeX RDF
1	Manuel V. Hermenegildo, Germán Puebla, Francisco Bueno, Pedro López-García 0001	Program Debugging and Validation Using Semantic Approximations and Partial Specifications.	ICALP	2002	DBLP DOI BibTeX RDF
1	Franck van Breugel, Steven Shalit, James Worrell 0001	Testing Labelled Markov Processes.	ICALP	2002	DBLP DOI BibTeX RDF
1	V. S. Anil Kumar 0001, Madhav V. Marathe	Improved Results for Stackelberg Scheduling Strategies.	ICALP	2002	DBLP DOI BibTeX RDF
1	Anna Östlin, Rasmus Pagh	One-Probe Search.	ICALP	2002	DBLP DOI BibTeX RDF
1	Vincenzo Liberatore	Circular Arrangements.	ICALP	2002	DBLP DOI BibTeX RDF	scheduling, Approximation algorithms, multicast, combinatorial optimization, broadcast disks
1	Tomasz Radzik	Improving Time Bounds on Maximum Generalised Flow Computations by Contracting the Network.	ICALP	2002	DBLP DOI BibTeX RDF
1	Marek Chrobak, Leah Epstein, John Noga, Jirí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania	Preemptive Scheduling in Overloaded Systems.	ICALP	2002	DBLP DOI BibTeX RDF
1	Andrej Bauer, Martín Hötzel Escardó, Alex K. Simpson	Comparing Functional Paradigms for Exact Real-Number Computation.	ICALP	2002	DBLP DOI BibTeX RDF
1	Sebastian Bala	Intersection of Regular Languages and Star Hierarchy.	ICALP	2002	DBLP DOI BibTeX RDF
1	Udo Adamy, Christoph Ambühl, R. Sai Anand, Thomas Erlebach	Call Control in Rings.	ICALP	2002	DBLP DOI BibTeX RDF
1	Colin Stirling	Deciding DPDA Equivalence Is Primitive Recursive.	ICALP	2002	DBLP DOI BibTeX RDF
1	Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah 0001	Wagner's Theorem on Realizers.	ICALP	2002	DBLP DOI BibTeX RDF
1	Philippe Duchon, Philippe Flajolet, Guy Louchard, Gilles Schaeffer	Random Sampling from Boltzmann Principles.	ICALP	2002	DBLP DOI BibTeX RDF
1	Leah Epstein, Steven S. Seiden, Rob van Stee	New Bounds for Variable-Sized and Resource Augmented Online Bin Packing.	ICALP	2002	DBLP DOI BibTeX RDF
1	Artur Czumaj, Andrzej Lingas, Hairong Zhao	Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem.	ICALP	2002	DBLP DOI BibTeX RDF
1	Moses Charikar, Piotr Indyk, Rina Panigrahy	New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems.	ICALP	2002	DBLP DOI BibTeX RDF
1	Robert A. Hearn, Erik D. Demaine	The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications.	ICALP	2002	DBLP DOI BibTeX RDF
1	Andreas Jakoby, Maciej Liskiewicz	Paths Problems in Symmetric Logarithmic Space.	ICALP	2002	DBLP DOI BibTeX RDF
1	Xiaotie Deng, Guojun Li, Zimao Li, Bin Ma 0002, Lusheng Wang 0001	A PTAS for Distinguishing (Sub)string Selection.	ICALP	2002	DBLP DOI BibTeX RDF
1	Thomas Colcombet	On Families of Graphs Having a Decidable First Order Theory with Reachability.	ICALP	2002	DBLP DOI BibTeX RDF
1	Marco Kick	Bialgebraic Modelling of Timed Processes.	ICALP	2002	DBLP DOI BibTeX RDF
1	Tomasz Jurdzinski, Krzysztof Lorys	Church-Rosser Languages vs. UCFL.	ICALP	2002	DBLP DOI BibTeX RDF
1	Xiaodong Wu 0001, Danny Z. Chen	Optimal Net Surface Problems with Applications.	ICALP	2002	DBLP DOI BibTeX RDF	3-D Image Segmentations, Algorithms, NP-hardness, Surface Reconstructions, Geometric Graphs
1	John H. Reif	Molecular Assembly and Computation: From Theory to Experimental Demonstrations.	ICALP	2002	DBLP DOI BibTeX RDF
1	Piotr Berman, Marek Karpinski	Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION.	ICALP	2002	DBLP DOI BibTeX RDF
1	Blaise Genest, Anca Muscholl, Helmut Seidl, Marc Zeitoun	Infinite-State High-Level MSCs: Model-Checking and Realizability.	ICALP	2002	DBLP DOI BibTeX RDF
1	Juan Luis Esteban, Nicola Galesi, Jochen Messner	On the Complexity of Resolution with Bounded Conjunctions.	ICALP	2002	DBLP DOI BibTeX RDF
1	Paul Gastin, Madhavan Mukund	An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces.	ICALP	2002	DBLP DOI BibTeX RDF	concurrency, Temporal logics, Mazurkiewicz traces
1	Bharat Adsul, Milind A. Sohoni	Complete and Tractable Local Linear Time Temporal Logics over Traces.	ICALP	2002	DBLP DOI BibTeX RDF	Concurrency, Temporal Logics, Limits, Mazurkiewicz Traces
1	Michal Bielecki, Jan Hidders, Jan Paredaens, Jerzy Tyszkiewicz, Jan Van den Bussche	Navigating with a Browser.	ICALP	2002	DBLP DOI BibTeX RDF
1	Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci	Seamless Integration of Parallelism and Memory Hierarchy.	ICALP	2002	DBLP DOI BibTeX RDF
1	Víctor Dalmau	Constraint Satisfaction Problems in Non-deterministic Logarithmic Space.	ICALP	2002	DBLP DOI BibTeX RDF
1	Madhav V. Marathe	Towards a Predictive Computational Complexity Theory.	ICALP	2002	DBLP DOI BibTeX RDF
1	Peter Hertling	A Banach-Mazur Computable But Not Markov Computable Function on the Computable Real Numbers.	ICALP	2002	DBLP DOI BibTeX RDF	Computable real numbers, computable sequences of real numbers, Banach-Mazur computable real function, Markov computable real function, effective continuity
1	Aggelos Kiayias, Moti Yung	Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes.	ICALP	2002	DBLP DOI BibTeX RDF
1	Dietrich Kuske, Markus Lohrey	On the Theory of One-Step Rewriting in Trace Monoids.	ICALP	2002	DBLP DOI BibTeX RDF
1	Malin Christersson, Leszek Gasieniec, Andrzej Lingas	Gossiping with Bounded Size Messages in ad hoc Radio Networks.	ICALP	2002	DBLP DOI BibTeX RDF
1	John M. Hitchcock	Correspondence Principles for Effective Dimensions.	ICALP	2002	DBLP DOI BibTeX RDF
1	J. B. Wells	The Essence of Principal Typings.	ICALP	2002	DBLP DOI BibTeX RDF
1	Ryuhei Uehara	Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs.	ICALP	2002	DBLP DOI BibTeX RDF	Chordal bipartite graphs, lexicographic breadth first search, vertex elimination ordering, strongly chordal graphs, design and analysis of algorithms
1	Alberto Del Lungo, Andrea Frosini, Maurice Nivat, Laurent Vuillon	Discrete Tomography: Reconstruction under Periodicity Constraints.	ICALP	2002	DBLP DOI BibTeX RDF	periodic constraint, discrete X-rays, Combinatorial problem, discrete tomography, polyomino, binary matrix
1	Heikki Mannila	Local and Global Methods in Data Mining: Basic Techniques and Open Problems.	ICALP	2002	DBLP DOI BibTeX RDF
1	Camil Demetrescu, Giuseppe F. Italiano	Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths.	ICALP	2002	DBLP DOI BibTeX RDF
1	Peter Widmayer, Francisco Triguero Ruiz, Rafael Morales Bueno, Matthew Hennessy, Stephan J. Eidenbenz, Ricardo Conejo (eds.)	Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings	ICALP	2002	DBLP DOI BibTeX RDF
1	Sylvain Lombardy	On the Construction of Reversible Automata for Reversible Languages.	ICALP	2002	DBLP DOI BibTeX RDF	reversible languages, reversible automata, universal automata, Finite automata
1	Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl	Efficient Testing of Hypergraphs.	ICALP	2002	DBLP DOI BibTeX RDF
1	Keye Martin, Michael W. Mislove, James Worrell 0001	Measuring the Probabilistic Powerdomain.	ICALP	2002	DBLP DOI BibTeX RDF
1	Luca Cardelli, Philippa Gardner, Giorgio Ghelli	A Spatial Logic for Querying Graphs.	ICALP	2002	DBLP DOI BibTeX RDF
1	Mikolaj Bojanczyk	Two-Way Alternating Automata and Finite Models.	ICALP	2002	DBLP DOI BibTeX RDF
1	Moses Charikar, Kevin C. Chen, Martin Farach-Colton	Finding Frequent Items in Data Streams.	ICALP	2002	DBLP DOI BibTeX RDF
1	Dimitris Fotakis 0001, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis	The Structure and Complexity of Nash Equilibria for a Selfish Routing Game.	ICALP	2002	DBLP DOI BibTeX RDF
1	Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking	Randomized Pursuit-Evasion in Graphs.	ICALP	2002	DBLP DOI BibTeX RDF
1	Amr Elmasry	Priority Queues, Pairing, and Adaptive Sorting.	ICALP	2002	DBLP DOI BibTeX RDF
1	Russell Impagliazzo, Nathan Segerlind	Bounded-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations.	ICALP	2002	DBLP DOI BibTeX RDF
1	Christophe Papazian, Eric Rémila	Hyperbolic Recognition by Graph Automata.	ICALP	2002	DBLP DOI BibTeX RDF
1	Klaus Wich	Universal Inherence of Cycle-Free Context-Free Ambiguity Functions.	ICALP	2002	DBLP DOI BibTeX RDF
1	Farid M. Ablayev, Cristopher Moore, Chris Pollett	Quantum and Stochastic Branching Programs of Bounded Width.	ICALP	2002	DBLP DOI BibTeX RDF
1	Noam Nisan	The Communication Complexity of Approximate Set Packing and Covering.	ICALP	2002	DBLP DOI BibTeX RDF
1	Jonas Holmerin	Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs.	ICALP	2002	DBLP DOI BibTeX RDF
1	Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik	Exponential Lower Bound for Static Semi-algebraic Proofs.	ICALP	2002	DBLP DOI BibTeX RDF
1	Luisa Gargano, Pavol Hell, Ladislav Stacho, Ugo Vaccaro	Spanning Trees with Bounded Number of Branch Vertices.	ICALP	2002	DBLP DOI BibTeX RDF

Publications at "ICALP"( http://dblp.L3S.de/Venues/ICALP )