Dear Sir/Madam, I'm sending you the following information:
-the list of accepted papers for ICALP'2002 (an HTML table with two columns; authors and title) -the preliminary program of ICALP'2002 is available on http://sirius.lcc.uma.es/ICALP2002/PreliminarySchedule.html (and on the "news" of ICALP2002 pages: http://www.lcc.uma.es/ICALP2002) -the preliminary program of the satellite event "Global Computing" (in the same link). I consider that this conference can be of your interest. The registration will be open in a few days. Best regards, Rafael MoralesTitle: Track A
|
Track A |
|
|
Peter Hertling; |
A Banach-Mazur Computable but not Markov Computable Function on the Computable Real Numbers |
|
Seth Pettie; |
A Faster All-pairs Shortest Path Algorithm for Real-weighted Sparse Graphs |
|
Juhani Karhumäki; Leonid P. Lisovik; |
A surprising undecidability result: The equivalence problem for finite substitutions on $ab^*c$ |
|
Doerr Benjamin; |
Antirandomizing the Wrong Game |
|
Piotr Berman; Marek Karpinski; Yakov Nekrich; |
Approximating Huffman Codes in Parallel |
|
Marek Karpinski; Piotr Berman; |
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION |
|
Nathan Segerlind; |
Bounded Depth Frege with Counting Principles Polynomially Simulates Nullstellensatz Refutations |
|
Rolf Fagerberg; Gerth Stølting Brodal; |
Cache Oblivious Distribution Sweeping |
|
Udo Adamy; |
Call Control in Rings |
|
Jurdzinski Tomasz; |
Church-Rosser Languages vs. UCFL |
|
Vincenzo Liberatore; |
Circular Arrangements |
|
Victor Dalmau; |
Constraint Satisfaction Problems in Non-Deterministic Logarithmic Space |
|
Joseph (Seffi) Naor; |
Control Message Aggregation in Group Communication Protocols |
|
John Hitchcock; |
Correspondence Principles for Effective Dimensions |
|
Aggelos Kiayias; Moti Yung; |
Cryptographic Hardness based on the Decoding of Reed-Solomon Codes |
|
Colin Stirling; |
Deciding DPDA equivalence is primitive recursive |
|
Yoshiharu Kohayakawa; Brendan Nagle; Vojtech Rodl; |
Efficient testing of hypergraphs |
|
Peter Sanders; Rene Beier; Naveen Sivadasan; Edgar Ramos; |
Energy Optimal Routing in Radio Networks Using Geometric Data Structures |
|
Dima Grigoriev; Edward A. Hirsch; Dmitrii V. Pasechnik; |
Exponential Lower Bound for Static Semi-Algebraic Proofs |
|
Rajeev Raman; |
Exponential structures for cache-oblivious algorithms |
|
Karhan Akcoglu; |
Fast Universalization of Investment Strategies with Provably Good Relative Returns |
|
Moses Charikar; Kevin Chen; Martin Farach-Colton; |
Finding Frequent Items in Data Streams |
|
Thore Husfeldt; |
Finding a Path of Superlogarithmic Length |
|
Xiaotie Deng; Guojun Li; Zimao Li; Bin ma; Lusheng Wang; |
Genetic Design of Drug without Side-effect |
|
Leszek Gasieniec; Andrzej Lingas; |
Gossiping with bounded size messages in unknown ad-hoc radio networks |
|
Elias Koutsoupias; Christos Papadimitriou; Alex Fabrikant; |
Heuristically Optimized Trade-offs: A New Paradigm for Power Laws in the Internet |
|
Martin Strauss; Sudipto Guha; Piotr Indyk; Muthu Muthukrishnan; |
Histogramming Data Streams with Fast Per-Item Processing |
|
Papazian Christophe; |
Hyperbolic Recognition by Cellular Automata |
|
Camil Demetrescu; Giuseppe F. Italiano; |
Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths |
|
Jonas Holmerin; |
Improved Inapproximability Results for Vertex Cover on k-regular Hyper-graphs |
|
V.S. Anil Kumar Kumar; |
Improved Results for Stackelberg Scheduling Strategies |
|
Tomasz Radzik; |
Improving time bounds on maximum generalised flow computation |
|
Lars Engebretsen; Jonas Holmerin; Alexander Russell; |
Inapproximability Results for Equations Over Finite Groups |
|
Sebastian Bala; |
Intersection of Regular Language and Star Hierarchy |
|
Ryuhei Uehara; |
Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs |
|
Moses Charikar; Piotr Indyk; Rina Panigrahy; |
New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching and Related Problems |
|
Steve Seiden; Leah Epstein; Rob van Stee; |
New Bounds for Variable-Sized and Resource Augmented Online Bin Packing |
|
Nicola Galesi; Juan Luis Esteban; Jochen Messner; |
On the Complexity of Resolution with Bounded Conjunctions |
|
Conrado Martinez; Amalia Duch; |
On the average performance of orthogonal range search in multidimensional data structures |
|
Sylvain Lombardy; |
On the construction of reversible automata for reversible languages |
|
Rasmus Pagh; Anna Östlin; |
One-Probe Search |
|
Xiaodong Wu; Danny Chen; |
Optimal Net Surface Problems with Applications |
|
Andreas Jakoby; Maciej Liskiewicz; |
Paths Problems in Symmetric Logarithmic Space |
|
Eyal Kushilevitz; Yuval Ishai; |
Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials |
|
Andrzej Lingas; Artur Czumaj; Hairong Zhao; |
Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem |
|
Marek Chrobak; Leah Epstein; John Noga; Jiri Sgall; Rob van Stee; Tomas Tichy; Nodari Vakhania; |
Preemptive Scheduling in Overloaded Systems |
|
Amr Elmasry; |
Priority queues, pairing and adaptive sorting |
|
Chris Pollett; Farid Ablayev; Cris Moore; |
Quantum and Stochastic Branching Programs of Bounded Width |
|
Philippe Flajolet; |
Random Sampling from Boltzmann Principles |
|
Vasco Brattka; |
Random numbers and an incomplete immune recursive set |
|
Harald Räcke; Micah Adler; Naveen Sivadasan; Christian Sohler; Berthold Vöcking; |
Randomized Pursuit-Evasion in Graphs |
|
Kazuo Iwama; |
Removable On-Line Knapsack Problems |
|
Peter Damaschke; |
Scheduling search procedures |
|
Carlo Fantozzi; Andrea Pietracaprina; Geppino Pucci; |
Seamless Integration of Parallelism and Memory Hierarchy |
|
Gerth Stølting Brodal; Rune Bang Lyngsø; Anna Östlin; Christian N. S. Pedersen; |
Solving the String Statistics Problem in Time $O(n\log n)$ |
|
Ugo Vaccaro; Pavol Hell; Ladislav Stacho; Luisa Gargano; |
Spanning trees with bounded number of branch vertices |
|
Wolfgang Merkle; |
The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences |
|
Robert A. Hearn; Erik D. Demaine; |
The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications |
|
Ollinger Nicolas; |
The Quest for Small Universal Cellular Automata |
|
Dimitrios Fotakis; Spyros Kontogiannis; Elias Koutsoupias; Marios Mavronicolas; Paul Spirakis; |
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game |
|
Noam Nisan; |
The communication complexity of approximate set packing and covering |
|
Mikolaj Bojanczyk; |
Two-Way Alternating Automata and Finite Models |
|
Mohamed Mosbah; Nicolas Bonichon; Bertrand Le Saec; |
Wagner's theorem on Realizers |
|
John Hitchcock; Jack Lutz; |
Why Computational Complexity Requires Stricter Martingales |
|
Track B |
|
|
Philippa Gardner; |
A Spatial Logic for Querying Graphs |
|
Rosu Grigore; |
A Total Approach to Partial Algebraic Specification |
|
Paul Gastin; |
An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces |
|
Lohrey Markus; |
Axiomatising Divergence |
|
Marco Kick; |
Bialgebraic Modelling of Timed Processes |
|
Alex Simpson; |
Comparing functional paradigms for exact real-number computation |
|
Bharat Adsul; Milind Sohoni; |
Expressively Complete Tractable Linear Time Temporal Logics over Traces |
|
Luke Ong; |
Games Characterizing Levy-Longo Trees |
|
Zeitoun Marc; muscholl anca; genest blaise; seidl helmut; |
Infinite-state High-Level MSCs: Model-Checking and Realizability |
|
James Worrell; Keye Martin; Mike Mislove; |
Measuring the Probabilistic Powerdomain |
|
Michal Bielecki; Hidders Jan; Jan Paredaens; Jerzy Tyszkiewicz; Jan Van den Bussche; |
Navigating with a Browser |
|
Colcombet Thomas; |
On Families of Graphs Having a Decidable First Order Theory with Reachability |
|
Dietrich Kuske; Markus Lohrey; |
On the theory of one-step rewriting in trace monoids |
|
Jiri Srba; |
Strong Bisimilarity and Regularity of Basic Process Algebra is PSPACE-Hard |
|
Thierry Cachat; |
Symbolic Strategy Synthesis for Games on Pushdown Graphs |
|
Franck van Breugel; |
Testing Labelled Markov Processes |
|
J. B. Wells Wells; |
The Essence of Principal Typings |
|
Freddy Mang; Thomas A. Henzinger; Orna Kupferman; Sriram Krishnan; |
The Synthesis of Uninitialized Systems |
|
Klaus Wich; |
Universal Inherence of cycle-free context-free Ambiguity Functions |
