ICALP2002: accepted papers and preliminary program

[email protected] [email protected]
Thu, 21 Mar 2002 19:19:43 +0100


This is a multi-part message in MIME format.
--------------9F1656E3A2720904ECEA2E70
Content-Type: text/plain; charset=iso-8859-1
Content-Transfer-Encoding: 8bit

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 Morales


--------------9F1656E3A2720904ECEA2E70
Content-Type: text/html; charset=us-ascii;
 name="tableAceptICALP2002.htm"
Content-Transfer-Encoding: 7bit
Content-Disposition: inline;
 filename="tableAceptICALP2002.htm"

<HTML>
<HEAD>
<META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=windows-1252">
<META NAME="Generator" CONTENT="Microsoft Word 97">
<TITLE>Track A</TITLE>
</HEAD>
<BODY>

<FONT SIZE=2></FONT>
<TABLE BORDER CELLSPACING=1 CELLPADDING=4 WIDTH=571>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P>Track A</P>
</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">&nbsp;</TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Peter Hertling;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>A Banach-Mazur Computable but not Markov Computable Function on the Computable Real Numbers</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Seth Pettie;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>A Faster All-pairs Shortest Path Algorithm for Real-weighted Sparse Graphs</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Juhani Karhum&auml;ki;  Leonid P. Lisovik;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>A surprising undecidability result: The equivalence problem for finite substitutions on $ab^*c$</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Doerr Benjamin;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Antirandomizing the Wrong Game</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Piotr Berman;  Marek Karpinski;  Yakov Nekrich;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Approximating Huffman Codes in Parallel</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Marek Karpinski;  Piotr Berman;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Nathan Segerlind;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Bounded Depth Frege with Counting Principles Polynomially Simulates Nullstellensatz Refutations</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Rolf Fagerberg;  Gerth St&oslash;lting Brodal;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Cache Oblivious Distribution Sweeping</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Udo Adamy;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Call Control in Rings</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Jurdzinski Tomasz;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Church-Rosser Languages vs. UCFL</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Vincenzo Liberatore;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Circular Arrangements</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Victor Dalmau;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Constraint Satisfaction Problems in Non-Deterministic Logarithmic Space</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Joseph (Seffi) Naor;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Control Message Aggregation in Group Communication Protocols</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> John Hitchcock;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Correspondence Principles for Effective Dimensions</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Aggelos Kiayias;  Moti Yung;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Cryptographic Hardness based on the Decoding of Reed-Solomon Codes</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Colin Stirling;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Deciding DPDA equivalence is primitive recursive</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Yoshiharu Kohayakawa;  Brendan Nagle;  Vojtech Rodl;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Efficient testing of hypergraphs</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Peter Sanders;  Rene Beier;  Naveen Sivadasan;  Edgar Ramos;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Energy Optimal Routing in Radio Networks Using Geometric Data Structures</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Dima Grigoriev;  Edward A. Hirsch;  Dmitrii V. Pasechnik;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Exponential Lower Bound for Static Semi-Algebraic Proofs</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Rajeev Raman;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Exponential structures for cache-oblivious algorithms</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Karhan Akcoglu;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Fast Universalization of Investment Strategies with Provably Good Relative Returns</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Moses Charikar;  Kevin Chen;  Martin Farach-Colton;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Finding Frequent Items in Data Streams</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Thore Husfeldt;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Finding a Path of Superlogarithmic Length</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Xiaotie Deng;  Guojun Li;  Zimao Li;  Bin ma;  Lusheng Wang;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Genetic Design of Drug without Side-effect</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Leszek Gasieniec;  Andrzej Lingas;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Gossiping with bounded size messages in unknown ad-hoc radio networks</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Elias Koutsoupias;  Christos Papadimitriou;  Alex Fabrikant;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Heuristically Optimized Trade-offs: A New Paradigm for Power Laws in the Internet</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Martin Strauss;  Sudipto Guha;  Piotr Indyk;  Muthu Muthukrishnan;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Histogramming Data Streams with Fast Per-Item Processing</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Papazian Christophe;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Hyperbolic Recognition by Cellular Automata</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Camil Demetrescu;  Giuseppe F. Italiano;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Jonas Holmerin;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Improved Inapproximability Results for Vertex Cover on k-regular Hyper-graphs</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> V.S. Anil Kumar Kumar;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Improved Results for Stackelberg Scheduling Strategies</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Tomasz Radzik;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Improving time bounds on maximum generalised flow computation</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Lars Engebretsen;  Jonas Holmerin;  Alexander Russell;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Inapproximability Results for Equations Over Finite Groups</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Sebastian Bala;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Intersection of Regular Language and Star Hierarchy</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Ryuhei Uehara;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Moses Charikar;  Piotr Indyk;  Rina Panigrahy;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching and Related Problems</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Steve Seiden;  Leah Epstein;  Rob van Stee;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>New Bounds for Variable-Sized and Resource Augmented Online Bin Packing</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Nicola Galesi;  Juan Luis Esteban;  Jochen Messner;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>On the Complexity of Resolution with Bounded Conjunctions</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Conrado Martinez;  Amalia Duch;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>On the average performance of orthogonal range search in multidimensional data structures</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Sylvain Lombardy;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>On the construction of reversible automata for reversible languages</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Rasmus Pagh;  Anna &Ouml;stlin;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>One-Probe Search</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Xiaodong Wu;  Danny Chen;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Optimal Net Surface Problems with Applications</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Andreas Jakoby;  Maciej Liskiewicz;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Paths Problems in Symmetric Logarithmic Space</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Eyal Kushilevitz;  Yuval Ishai;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Andrzej Lingas;  Artur Czumaj;  Hairong Zhao;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Marek Chrobak;  Leah Epstein;  John Noga;  Jiri Sgall;  Rob van Stee; Tomas Tichy;  Nodari Vakhania;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Preemptive Scheduling in Overloaded Systems</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Amr Elmasry;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Priority queues, pairing and adaptive sorting</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Chris Pollett;  Farid Ablayev;  Cris Moore;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Quantum and Stochastic Branching Programs of Bounded Width</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Philippe Flajolet;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Random Sampling from Boltzmann Principles</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Vasco Brattka;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Random numbers and an incomplete immune recursive set</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Harald R&auml;cke;  Micah Adler;  Naveen Sivadasan;  Christian Sohler; Berthold V&ouml;cking;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Randomized Pursuit-Evasion in Graphs</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Kazuo Iwama;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Removable On-Line Knapsack Problems</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Peter Damaschke;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Scheduling search procedures</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Carlo Fantozzi;  Andrea Pietracaprina;  Geppino Pucci;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Seamless Integration of Parallelism and Memory Hierarchy</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Gerth St&oslash;lting Brodal;  Rune Bang Lyngs&oslash;;  Anna &Ouml;stlin;  Christian N. S. Pedersen;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Solving the String Statistics Problem in Time $O(n\log n)$</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Ugo Vaccaro;  Pavol Hell;  Ladislav Stacho;  Luisa Gargano;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Spanning trees with bounded number of branch vertices</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Wolfgang Merkle;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Robert A. Hearn;  Erik D. Demaine;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Ollinger Nicolas;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>The Quest for Small Universal Cellular Automata</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Dimitrios Fotakis;  Spyros Kontogiannis;  Elias Koutsoupias;  Marios Mavronicolas;  Paul Spirakis;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>The Structure and Complexity of Nash Equilibria for a Selfish Routing Game</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Noam Nisan;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>The communication complexity of approximate set packing and covering</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Mikolaj Bojanczyk;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Two-Way Alternating Automata and Finite Models</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Mohamed Mosbah;  Nicolas Bonichon;  Bertrand Le Saec;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Wagner's theorem on Realizers</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> John Hitchcock;  Jack Lutz;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Why Computational Complexity Requires Stricter Martingales</FONT></TD>
</TR>
</TABLE>

<FONT SIZE=2>
<P>&nbsp;</P>
<P>&nbsp;</P>
<P>&nbsp;</P>
<P>&nbsp;</P></FONT>
<TABLE BORDER CELLSPACING=1 CELLPADDING=4 WIDTH=571>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P>Track B</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">&nbsp;</TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Philippa Gardner;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>A Spatial Logic for Querying Graphs</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Rosu Grigore;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>A Total Approach to Partial Algebraic Specification</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Paul Gastin;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Lohrey Markus;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Axiomatising Divergence</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Marco Kick;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Bialgebraic Modelling of Timed Processes</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Alex Simpson;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Comparing functional paradigms for exact real-number computation</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Bharat Adsul;  Milind Sohoni;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Expressively Complete Tractable Linear Time Temporal Logics over Traces</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Luke Ong;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Games Characterizing Levy-Longo Trees</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Zeitoun Marc;  muscholl anca;  genest blaise;  seidl helmut;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Infinite-state High-Level MSCs: Model-Checking and Realizability</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> James Worrell;  Keye Martin;  Mike Mislove;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Measuring the Probabilistic Powerdomain</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Michal Bielecki;  Hidders Jan;  Jan Paredaens;  Jerzy Tyszkiewicz;  Jan Van den Bussche;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Navigating with a Browser</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Colcombet Thomas;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>On Families of Graphs Having a Decidable First Order Theory with Reachability</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Dietrich Kuske;  Markus Lohrey;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>On the theory of one-step rewriting in trace monoids</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Jiri Srba;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Strong Bisimilarity and Regularity of Basic Process Algebra is PSPACE-Hard</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Thierry Cachat;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Symbolic Strategy Synthesis for Games on Pushdown Graphs</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Franck van Breugel;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Testing Labelled Markov Processes</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> J. B. Wells Wells;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>The Essence of Principal Typings</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Freddy Mang;  Thomas A. Henzinger;  Orna Kupferman;  Sriram Krishnan;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>The Synthesis of Uninitialized Systems</FONT></TD>
</TR>
<TR><TD WIDTH="34%" VALIGN="TOP">
<FONT SIZE=2><P> Klaus Wich;</FONT></TD>
<TD WIDTH="66%" VALIGN="TOP">
<FONT SIZE=2><P>Universal Inherence of cycle-free context-free Ambiguity Functions</FONT></TD>
</TR>
</TABLE>

<FONT SIZE=2></FONT></BODY>
</HTML>

--------------9F1656E3A2720904ECEA2E70--