Mike Paterson
Proceedings of the 17th International Colloquium on Automata, Languages and Programming
ICALP, 1990.

@proceedings{ICALP-1990,
	editor        = "Mike Paterson",
	isbn          = "3-540-52826-1",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 17th International Colloquium on Automata, Languages and Programming}",
	volume        = 443,
	year          = 1990,
}

Contents (57 items)

7 ×#on the
5 ×#algebra
5 ×#algorithm
5 ×#process
4 ×#automaton
4 ×#parallel
4 ×#problem
4 ×#proving
3 ×#composition
3 ×#formal method

ICALP-1990-NaherM #algorithm #data type #library #named #performance

LEDA: A Library of Efficient Data Types and Algorithms (SN, KM), pp. 1–5.

ICALP-1990-DietzfelbingerH #realtime

A New Universal Class of Hash Functions and Dynamic Hashing in Real Time (MD, FMadH), pp. 6–19.

ICALP-1990-Riecke #call-by #decidability #proving

A Complete and Decidable Proof System for Call-by-Value Equalities (JGR), pp. 20–31.

ICALP-1990-Schwartzbach #correctness

Static Correctness of Hierarchical Procedures (MIS), pp. 32–45.

ICALP-1990-Malecki #polymorphism

Generic Terms Having No Polymorphic Types (SM), pp. 46–59.

ICALP-1990-Krob

A Complete System of B-Rational Identities (DK), pp. 60–73.

ICALP-1990-LucaV #on the

On Non-Counting Regular Classes (AdL, SV), pp. 74–87.

ICALP-1990-Anselmo #automaton #multi

Two-Way Automata with Multiplicity (MA), pp. 88–102.

ICALP-1990-Kuich #algebra #automaton

ω-Continuous Semirings, Algebraic Systems and Pushdown Automata (WK), pp. 103–110.

ICALP-1990-Geffert #nondeterminism

Nondeterministic Computations in Sublogarithmic Space and Space Constructibility (VG), pp. 111–124.

ICALP-1990-Wiedermann #metric #normalisation #problem #ram

Normalizing and Accelerating RAM Computations and the Problem of Reasonable Space Measures (JW), pp. 125–138.

ICALP-1990-Watanabe #formal method #learning #query

A Formal Study of Learning via Queries (OW0), pp. 139–152.

ICALP-1990-JainS #learning

Language Learning by a “Team” (SJ, AS), pp. 153–166.

ICALP-1990-Milner #process

Functions as Processes (RM), pp. 167–180.

ICALP-1990-JagadeesanP #calculus #formal method #higher-order #process

A Domain-Theoretic Model for a Higher-Order Process Calculus (RJ, PP), pp. 181–194.

ICALP-1990-Droste #automaton #concurrent

Concurrency, Automata and Domains (MD), pp. 195–208.

ICALP-1990-HennessyI #communication #formal method #process

A Theory of Communicating Processes with Value-Passing (MH, AI), pp. 209–219.

ICALP-1990-FlajoletSS #problem

Analytic Variations on the Common Subexpression Problem (PF, PS, JMS), pp. 220–234.

ICALP-1990-CheriyanHM #question

Can A Maximum Flow be Computed on o(nm) Time? (JC, TH, KM), pp. 235–248.

ICALP-1990-Razborov #complexity #on the

On the Distributional Complexity of Disjontness (AAR), pp. 249–253.

ICALP-1990-KranakisKB #network

Computing Boolean Functions on Anonymous Networks (EK, DK, JvdB), pp. 254–267.

ICALP-1990-GoldreichK #composition #on the #proving

On the Composition of Zero-Knowledge Proof Systems (OG, HK), pp. 268–282.

ICALP-1990-BookLT #pseudo #query #random

Additional Queries to Random and Pseudorandom Oracles (RVB, JHL, ST), pp. 283–293.

ICALP-1990-RabinovichT #communication

Communication among Relations (AMR, BAT), pp. 294–307.

ICALP-1990-PanangadenSS #data flow #network

Stability and Sequentiality in Dataflow Networks (PP, VS, EWS), pp. 308–321.

ICALP-1990-AlurD #automaton #modelling #realtime

Automata For Modeling Real-Time Systems (RA, DLD), pp. 322–335.

ICALP-1990-CourcoubetisY #markov #process

Markov Decision Processes and Regular Events (CC, MY), pp. 336–349.

ICALP-1990-Klop #term rewriting

Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond (JWK), pp. 350–369.

ICALP-1990-VermaR #algorithm #normalisation #term rewriting

Nonoblivious Normalization Algorithms for Nonlinear Rewrite Systems (RMV, IVR), pp. 370–385.

ICALP-1990-Palamidessi #algebra

Algebraic Properties of Idempotent Substitutions (CP), pp. 386–399.

ICALP-1990-DobkinK #approach

Determining the Separation of Preprocessed Polyhedra — A Unified Approach (DPD, DGK), pp. 400–413.

ICALP-1990-GuibasKS #diagrams #incremental #random

Randomized Incremental Construction of Delaunay and Voronoi Diagrams (LJG, DEK, MS), pp. 414–431.

ICALP-1990-ColeGO #diagrams #parallel #performance

Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (RC, MTG, CÓ), pp. 432–445.

ICALP-1990-Johnson #optimisation #problem

Local Optimization and the Traveling Salesman Problem (DSJ), pp. 446–461.

ICALP-1990-JerrumS #algorithm #approximate #polynomial

Polynomial-Time Approximation Algorithms for Ising Model (MJ, AS), pp. 462–475.

ICALP-1990-SavageW #clustering #heuristic #on the

On Parallelizing Graph-Partitioning Heuristics (JES, MGW), pp. 476–489.

ICALP-1990-Choffrut #decidability

Iterated Substitutions and Locally Catanative Systems: A Decidability Result in the Binary Case (CC), pp. 490–500.

ICALP-1990-ClerboutLR #composition

Decomposition of Partial Commutations (MC, ML, YR), pp. 501–511.

ICALP-1990-Pelletier #ambiguity #set

Boolean Closure and Unambiguity of Rational Sets (MP), pp. 512–525.

ICALP-1990-LarsenX #composition #semantics

Compositionality Through an Operational Semantics of Contexts (KGL, LX), pp. 526–539.

ICALP-1990-Parrow #behaviour #network

Structural and Behavioural Equivalences of Networks (JP), pp. 540–552.

ICALP-1990-PeledP #liveness #partial order #proving

Proving Partial Order Liveness Properties (DP, AP), pp. 553–571.

ICALP-1990-Boer #object-oriented #parallel #proving

A Proof System for the Parallel Object-Oriented Language POOL (FSdB), pp. 572–585.

ICALP-1990-Blum #approach #graph

A New Approach to Maximum Matching in General Graphs (NB), pp. 586–597.

ICALP-1990-BattistaT #algorithm #graph #online

On-Line Graph Algorithms with SPQR-Trees (GDB, RT), pp. 598–611.

ICALP-1990-PanR #multi #on the

On the Bit-Complexity of Discrete Solutions of PDEs: Compact Multigrid (VYP, JHR), pp. 612–625.

ICALP-1990-GrooteV #algorithm #bisimulation #branch #equivalence #performance

An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence (JFG, FWV), pp. 626–638.

ICALP-1990-Jones #partial evaluation #self

Partial Evaluation, Self-Application and Types (NDJ), pp. 639–659.

ICALP-1990-TuckerWZ #data type

Provable Computable Functions on Abstract Data Types (JVT, SSW, JIZ), pp. 660–673.

ICALP-1990-Comon #algebra #equation #order

Equational Formulas in Order-Sorted Algebras (HC), pp. 674–688.

ICALP-1990-GoodrichAO #trade-off

An Input-Size/Output-Size Trade-Off in the Time-Complexity of Rectilinear Hidden Surface Removal (MTG, MJA, MHO), pp. 689–702.

ICALP-1990-AltBW #approximate

Approximation of Convex Polygons (HA, JB, HW), pp. 703–716.

ICALP-1990-Hoffmann #on the #problem

On the Rectilinear Art Gallery Problem (FH), pp. 717–728.

ICALP-1990-MatiasV #integer #on the #parallel #sorting

On Parallel Hashing and Integer Sorting (YM, UV), pp. 729–743.

ICALP-1990-Radge #parallel

The Parallel Simplicity of Compaction and Chaining (PR), pp. 744–751.

ICALP-1990-Moller #algebra #process

The Importance of the Left Merge Operator in Process Algebras (FM), pp. 752–764.

ICALP-1990-PrasadGM #algebra #concurrent #functional #integration #programming #semantics #symmetry

Operational and Algebraic Semantics for Facile: A Symmetric Integration of Concurrent and Functional Programming (SP, AG, PM), pp. 765–778.