csryt@warwick.ac.uk (Prof M S Paterson) (02/26/90)
ICALP'90 Advance Information ---------------------------- Location: University of Warwick, Coventry, UK Outline of events: July 15 - 20, 1990 Sunday, eve. Arrival; registration Monday, am Opening of Colloquium; registration Monday, eve. Reception by Vice-Chancellor of University Tuesday, eve. General Assembly of EATCS Wed., aft.&eve. Excursions Alternative A: Coventry Cathedral, Warwick Castle; medieval banquet and musical entertainment at Coombe Abbey Alternative B: Warwick Castle, Stratford-upon-Avon; Shakespeare play "Much Ado About Nothing" Thursday, eve. Reception by the Lord Mayor of Coventry at the Museum of British Road Transport; Colloquium Dinner Friday, aft. Close of Colloquium Registration fee The advance registration fee of 70 pounds (provisional) includes lunches, refreshments during breaks, both Receptions, the Colloquium Dinner, the excursions and a copy of the Proceedings. A reduced registration fee of about 45 pounds for students will include all the above except for the medieval banquet or Shakespeare play. Accommodation All accommodation will be in the University within easy walking distance of the lecture room. Standard rooms including dinner and breakfast are expected to be about 22 pounds per day. Some rooms with en suite bathrooms are available for about 29 pounds per day. For students, there will be a special rate of about 15 pounds for bed & breakfast only. Sponsorship The main sponsor for ICALP'90 is ICL. Other sponsors are ESPRIT, and IBM United Kingdom. For further information please contact Prof. M.S. Paterson Department of Computer Science University of Warwick Coventry, CV4 7AL, UK E-mail (Internet): ICALP@cs.warwick.ac.uk ------------------------------------------------ Papers to be presented: Invited speakers ---------------- Local optimization and the traveling salesman problem David Johnson (AT&T Bell Labs, USA) Partial evaluation, self-application and types Neil D. Jones (Univ. of Copenhagen, Denmark) Recent themes in term rewriting Jan Willem Klop (Centre for Maths. and Computer Science, N'lands) LEDA: Efficient Reusable Software Kurt Mehlhorn (coauthor: Stefan Naeher) (Univ. of Saarland, DDR) Encoding the lambda calculus in a process calculus Robin Milner (Univ. of Edinburgh, UK) Contributed papers ------------------ On the Distributional Complexity of Disjointness A.A. Razborov (Steklov Math. Inst., USSR) On the Rectilinear Art Gallery Problem Frank Hoffmann (Weierstrass Inst., DDR) The Parallel Simplicity of Compaction and Chaining Prabhakar Ragde (Univ. of Waterloo, Canada) A Proof System for the Language POOL Frank de Boer (Centre for Maths. and Computer Science, N'lands) The Importance of the Left Merge Operator in Process Algebras Faron Moller (Univ. of Edinburgh, UK) Finitary Semirings, Algebraic Systems and Pushdown Automata Werner Kuich (Techn. Univ. of Vienna, Austria) A Complete System of B-Rational Identities Daniel Krob (Univ. of Rouen, France) Communication among Relations A. Rabinovich (Tel Aviv Univ., Israel) B.A. Trakhtenbrot (Tel Aviv Univ., Israel) A Theory of Communicating Processes with Value-passing M. Hennessy (Univ. of Sussex, UK) A Ingolfsdottir (Univ. of Sussex, UK) Can a Maximum Flow be Computed in o(nm) Time? Joseph Cheriyan (Univ. of Saarland, W. Germany) Torben Hagerup (Univ. of Saarland, W. Germany) Kurt Mehlhorn (Univ. of Saarland, W. Germany) Additional Queries to Random and Pseudorandom Oracles Ronald V. Book (UC Santa Barbara, USA) Jack H. Lutz (Iowa State Univ., USA) Shouwen Tang (Beijing Computer Inst., PR China) Static Correctness of Hierarchical Procedures Michael I. Schwartzbach (Aarhus Univ., Denmark) On the Bit-Complexity of Discrete Solutions of PDEs: Compact Multigrid Victor Pan (SUNY at Albany & Lehman Coll. CUNY, USA) John Reif (Duke Univ., USA) Stability and Sequentiality in Dataflow Networks Prakash Panangaden (Cornell Univ., USA) Vasant Shanbhogue (Cornell Univ., USA) Eugene W. Stark (SUNY at Stony Brook, USA) Concurrency, Automata and Domains Manfred Droste (Univ. GHS Essen, GDR) Provable Computable Functions on Abstract Data Types J.V. Tucker (Univ. Coll. Swansea, UK) S.S. Wainer (Univ. of Leeds, UK) J.I. Zucker (McMaster Univ., Canada) Playing with RAM time and space Juraj Wiedermann (VUSEI-AR, Czechoslovakia) Computing Boolean Functions on Anonymous Networks Evangelos Kranakis (Centre for Maths. and Com. Science, N'lands) Danny Krizanc (C. for Math/C.Sci., N'lands & U. of Rochester, USA) Jacob van den Berg (C. for Maths. and Computer Science, N'lands) Equational Formulas in Order-Sorted Algebras Hubert Comon (Univ. of Paris South, France) A Monte-Carlo-type Dictionary with Worst Case Constant Time per Instruction Martin Dietzfelbinger (Univ. GH Paderborn, FRG) Friedhelm Meyer auf der Heide (Univ. GH Paderborn, FRG) On the Composition of Zero-Knowledge Proof Systems Oded Goldreich (Technion, Israel) Hugo Krawczyk (Technion, Israel) Markov Decision Processes and Regular Events Costas Courcoubetis (AT&T Bell Labs, USA) Mihalis Yannakakis (AT&T Bell Labs, USA) Compositionality Through an Operational Semantics of Contexts Kim G. Larsen (Aalborg Univ., Denmark) Liu Xinxin (Aalborg Univ., Denmark) Boolean closure and unambiguity of rational sets Maryse Pelletier (Univ. of Paris 6, France) Polynomial-time approximation algorithms for the Ising model Mark Jerrum (Univ. of Edinburgh, UK) Alistair Sinclair (Univ. of Edinburgh, UK) On Integer Sorting and Parallel Hashing Yossi Matias (Tel-Aviv Univ., Israel) Uzi Vishkin (Tel-Aviv Univ., Israel & Univ. of Maryland, USA) Two-way automata with multiplicities M. Anselmo (Univ. of Paris 7, France & Univ. of Palermo, Italy) Determining the Separation of Preprocessed Polyhedra - a Unified Approach David P. Dobkin (Princeton Univ., USA) David G. Kirkpatrick (Univ. of BC, Canada) A Formal Study of Learnability via Queries Osamu Watanabe (Tokyo Inst. of Technology, Japan) On non-counting regular classes Aldo de Luca (Univ. of Rome "La Sapienza", Italy) Stefano Varrichio (U. of Rome "La Sap." & Inst. of Cyb. CNR, Italy) Algebraic Properties of Idempotent Substitutions Catuscia Palamidessi (Univ. of Pisa, Italy) Proving Partial Order Liveness Properties Doron Peled (Technion, Israel) Amir Pnueli (Weizmann Inst., Israel) Structural and Behavioural Equivalences of Networks Joachim Parrow (Swedish Inst. of Computer Science, Sweden) A Domain-theoretic Model for a Higher-order Process Calculus Radhakrishnan Jagadeesan (Cornell Univ., USA) Prakash Panangaden (Cornell Univ., USA) A Complete and Decidable Proof System for Call-by-Value Equalities Jon G. Riecke (MIT, USA) Randomized Incremental Construction of Delaunay and Voronoi Diagrams Leonidas J. Guibas (Stanford Univ. & DEC Sys. Res. Center, USA) Donald E. Knuth (Stanford Univ., USA) Micha Sharir (Courant Inst.., USA & Tel Aviv Univ., Israel) An Input-Size/Output-Size Trade-Off in the Time-Complexity of Rectilinear Hidden Surface Removal Michael T. Goodrich (Johns Hopkins Univ., USA) Mikhail J. Atallah (Purdue Univ., USA) Mark H. Overmars (Univ. of Utrecht, Netherlands) Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction Richard Cole (Courant Inst., USA ) Michael T. Goodrich (Johns Hopkins Univ., USA) Colm O Dunlaing (Trinity College Dublin, Rep. Ireland) Language Learning by a "Team" Sanjay Jain (Univ. of Rochester, USA) Arun Sharma (Univ. of Delaware, USA) Decomposition of Partial Commutations Mireille Clerbout (Univ. of Lille Flandres Artois, France) Michel Latteux (Univ. of Lille Flandres Artois, France) Yves Roos (Univ. of Lille Flandres Artois, France) On-Line Graph Algorithms with SPQR-Trees Giuseppe Di Battista (Univ. of Rome "La Sapienza", Italy) Roberto Tamassia (Brown Univ., USA) Analytic variations on the common subexpression problem Philippe Flajolet (INRIA, France) Paolo Sipala (Univ. of Trieste, Italy) Jean-Marc Steyaert (Ecole Polytechnique, France) Approximation of Convex Polygons Helmut Alt (Free Univ. Berlin, FRG) Johannes Bloemer (Free Univ. Berlin, FRG) Michael Godeau (Free Univ. Berlin, FRG) Hubert Wagener (Techn. Univ. Berlin, FRG) Generic terms having no polymorphic types Sophie Malecki (Univ. of Paris 7, France) On Parallelizing Graph-Partitioning Heuristics John E. Savage (Brown Univ., USA) Markus G. Wloka (Brown Univ., USA) Operational and Algebraic Semantics for Facile: a Symmetric Integration of Concurrent and Functional Programming Alessandro Giacalone (SUNY at Stony Brook, USA) Prateek Mishra (SUNY at Stony Brook, USA) Sanjiva Prasad (SUNY at Stony Brook, USA) An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence Jan Friso Groote (Centre for Maths. and Computer Science, N'lands) Frits Vaandrager (Centre for Maths. and Comp. Science, N'lands) A new approach to maximum matching in general graphs Norbert Blum (Univ. of Bonn, FRG) Nonoblivious Normalization Algorithms for Nonlinear Rewrite Systems Rakesh M. Verma (Univ. of Houston, USA) I.V. Ramakrishnan (SUNY at Stony Brook, USA) Automata for Modeling Real-Time Systems Rajeev Alur (Stanford Univ., USA) David Dill (Stanford Univ., USA) Iterated Substitutions and Locally Catenative Systems: a Decidability Result in the Binary Case Christian Choffrut (Univ. of Rouen, France) Nondeterministic computations in sublogarithmic space and space constructibility Viliam Geffert (Univ. of Safarik, Czechoslovakia) -------------------------------------------------------------------------