Pierpaolo Degano, Roberto Gorrieri, Alberto Marchetti-Spaccamela
Proceedings of the 24th International Colloquium on Automata, Languages and Programming
ICALP, 1997.

@proceedings{ICALP-1997,
	address       = "Bologna, Italy",
	editor        = "Pierpaolo Degano and Roberto Gorrieri and Alberto Marchetti-Spaccamela",
	isbn          = "3-540-63165-8",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 24th International Colloquium on Automata, Languages and Programming}",
	volume        = 1256,
	year          = 1997,
}

Contents (79 items)

8 ×#on the
7 ×#problem
7 ×#process
6 ×#bound
6 ×#graph
5 ×#algorithm
5 ×#performance
4 ×#set
3 ×#algebra
3 ×#analysis

ICALP-1997-Milner #calculus #interactive #visual notation

Graphical Calculi for Interaction (RM), p. 1.

ICALP-1997-Papadimitriou #named

NP-Completeness: A Retrospective (CHP), pp. 2–6.

ICALP-1997-MehlhornNU #combinator #framework #geometry #platform

The LEDA Platform of Combinatorial and Geometric Computing (KM, SN, CU), pp. 7–16.

ICALP-1997-CartonP #set

The Wadge-Wagner Hierarchy of ω-Rational Sets (OC, DP), pp. 17–35.

ICALP-1997-Apt #constraints

From Chaotic Iteration to Constraint Propagation (KRA), pp. 36–55.

ICALP-1997-LandweberL #question

DNA²DNA Computations: A Potential “Killer App”? (LFL, RJL), pp. 56–64.

ICALP-1997-Durand

Tilings and Quasiperiodicity (BD), pp. 65–75.

ICALP-1997-BassinoBP #sequence

Enumerative Sequences of Leaves in Rational Trees (FB, MPB, DP), pp. 76–86.

ICALP-1997-Bruyere #algorithm #bound

A Completion Algorithm for Codes with Bounded Synchronization Delay (VB), pp. 87–97.

ICALP-1997-KarhumakiPM #equation #word

The Expressibility of Languages and Relations by Word Equations (JK, WP, FM), pp. 98–109.

ICALP-1997-BeaudryLT #finite

Finite Loops Recognize Exactly the Regular Open Languages (MB, FL, DT), pp. 110–120.

ICALP-1997-Gianantonio #data type

An Abstract Data Type for Real Numbers (PDG), pp. 121–131.

ICALP-1997-LathropL #recursion

Recursive Computational Depth (JIL, JHL), pp. 132–142.

ICALP-1997-Bournez #bound #constant #power of

Some Bounds on the Computational Power of Piecewise Constant Derivative Systems (OB), pp. 143–153.

ICALP-1997-GurevichV #monad #problem

Monadic Simultaneous Rigid E-Unification and Related Problems (YG, AV), pp. 154–165.

ICALP-1997-Weihrauch #metric #probability #set

Computability on the Probability Measures on the Borel Sets of the Unit Interval (KW), pp. 166–176.

ICALP-1997-AndreevCR #trade-off #worst-case

Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-Offs (AEA, AEFC, JDPR), pp. 177–187.

ICALP-1997-BuhrmanFF #bound

Results on Resource-Bounded Measure (HB, SAF, LF), pp. 188–194.

ICALP-1997-Ablayev #branch #nondeterminism #order #source code

Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs (FMA), pp. 195–202.

ICALP-1997-CodenottiEGK

Checking Properties of Polynomials (BC, FE, PG, RK), pp. 203–213.

ICALP-1997-HemaspaandraHR #analysis #parallel

Exact Analysis of Dodgson Elections: Lewis Carroll’s 1876 Voting System is Complete for Parallel Access to NP (EH, LAH, JR), pp. 214–224.

ICALP-1997-HondaY #analysis #call-by #game studies

Game Theoretic Analysis of Call-by-Value Computation (KH, NY), pp. 225–236.

ICALP-1997-CosmoG #composition #higher-order #on the #λ-calculus

On Modular Properties of Higher Order Extensional λ Calculi (RDC, NG), pp. 237–247.

ICALP-1997-RitterP #on the

On Explicit Substitution and Names (ER, VdP), pp. 248–258.

ICALP-1997-AspertiL #graph #on the

On the Dynamics of Sharing Graphs (AA, CL), pp. 259–269.

ICALP-1997-AlstrupHLT

Minimizing Diameters of Dynamic Trees (SA, JH, KdL, MT), pp. 270–280.

ICALP-1997-KrumkeMNRRSW

Improving Spanning Trees by Upgrading Nodes (SOK, MVM, HN, RR, SSR, RS, HCW), pp. 281–291.

ICALP-1997-Hagerup #algorithm #bound #graph

Dynamic Algorithms for Graphs of Bounded Treewidth (TH), pp. 292–302.

ICALP-1997-Sangiorgi

The Name Discipline of Uniform Receptiveness (DS), pp. 303–313.

ICALP-1997-PhilippouW #confluence #on the #π-calculus

On Confluence in the π-Calculus (AP, DW), pp. 314–324.

ICALP-1997-Fu #approach #communication #proving

A Proof Theoretical Approach to Communication (YF), pp. 325–335.

ICALP-1997-DiekertMM #equation #normalisation #using

Solving Trace Equations Using Lexicographical Normal Forms (VD, YM, AM), pp. 336–346.

ICALP-1997-Wilke #first-order #logic #strict

Star-Free Picture Expressions are Strictly Weaker Than First-Order Logic (TW), pp. 347–357.

ICALP-1997-Bernardo #algebra

An Algebra-Based Method to Associate Rewards with EMPA Terms (MB), pp. 358–368.

ICALP-1997-MasonT #semantics

A Semantically Sound Actor Tranlsation (IAM, CLT), pp. 369–378.

ICALP-1997-SchwiegelshohnT #equation

Periodic and Non-periodic Min-Max Equations (US, LT), pp. 379–389.

ICALP-1997-CaceresDFFRRSS #algorithm #graph #parallel #performance

Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP (EC, FKHAD, AF, PF, IR, AR, NS, SWS), pp. 390–400.

ICALP-1997-Ambainis #bound #communication #complexity #information retrieval

Upper Bound on Communication Complexity of Private Information Retrieval (AA), pp. 401–407.

ICALP-1997-HarelS #logic #process

Computation Paths Logic: An Expressive, yet Elementary, Process Logic (abridged version) (DH, ES), pp. 408–418.

ICALP-1997-BurkartS #calculus #infinity #model checking #process #μ-calculus

Model Checking the Full Modal μ-Calculus for Infinite Sequential Processes (OB, BS), pp. 419–429.

ICALP-1997-BaierCHKR #model checking #probability #process

Symbolic Model Checking for Probabilistic Processes (CB, EMC, VHG, MZK, MR), pp. 430–440.

ICALP-1997-Robson #on the

On the Concentration of the Height of Binary Search Trees (JMR), pp. 441–448.

ICALP-1997-Roura #divide and conquer #theorem

An Improved Master Theorem for Divide-and-Conquer Recurrences (SR), pp. 449–459.

ICALP-1997-VinkR #algebra #approach #bisimulation #probability

Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach (EPdV, JJMMR), pp. 460–470.

ICALP-1997-RielyH #distributed #process

Distributed Processes and Location Failures (JR, MH), pp. 471–481.

ICALP-1997-BorealeNP #process

Basic Observables for Processes (MB, RDN, RP), pp. 482–492.

ICALP-1997-KaklamanisPEJ

Constrained Bipartite Edge Coloring with Applications to Wavelength Routing (CK, PP, TE, KJ), pp. 493–504.

ICALP-1997-GarganoHP #symmetry

Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing (LG, PH, SP), pp. 505–515.

ICALP-1997-BartalL #network #online

On-Line Routing in All-Optical Networks (YB, SL), pp. 516–526.

ICALP-1997-EilamFZ #layout #network #problem

A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load (TE, MF, SZ), pp. 527–537.

ICALP-1997-Vogler #performance #petri net

Efficiency of Asynchronous Systems and Read Arcs in Petri Nets (WV), pp. 538–548.

ICALP-1997-Jancar #bisimulation #decidability #equivalence #process

Bisimulation Equivalence is Decidable for One-Counter Processes (PJ), pp. 549–559.

ICALP-1997-BouajjaniH #analysis #reachability #set

Symbolic Reachability Analysis of FIFO Channel Systems with Nonregular Sets of Configurations (AB, PH), pp. 560–570.

ICALP-1997-Fokkink #algebra #axiom #process

Axiomatizations for the Perpetual Loop in Process Algebra (WF), pp. 571–581.

ICALP-1997-HenzingerK97a #automaton #hybrid

Discrete-Time Control for Rectangular Hybrid Automata (TAH, PWK), pp. 582–593.

ICALP-1997-HenzingerK #graph #maintenance

Maintaining Minimum Spanning Trees in Dynamic Graphs (MRH, VK), pp. 594–604.

ICALP-1997-GrossiI #algorithm #order #performance #problem

Efficient Splitting and Merging Algorithms for Order Decomposable Problems (RG, GFI), pp. 605–615.

ICALP-1997-KhannaMS #array #clustering #performance

Efficient Array Partitioning (SK, SM, SS), pp. 616–626.

ICALP-1997-BodlaenderT #algorithm #linear

Constructive Linear Time Algorithms for Branchwidth (HLB, DMT), pp. 627–637.

ICALP-1997-NarendranO #confluence #decidability #finite #problem #string #term rewriting #word

The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent (PN, FO), pp. 638–648.

ICALP-1997-KhasidashviliG #geometry #orthogonal #reduction

The Geometry of Orthogonal Reduction Spaces (ZK, JRWG), pp. 649–659.

ICALP-1997-Marchiori #formal method

The Theory of Vaccines (MM), pp. 660–670.

ICALP-1997-Senizergues #automaton #decidability #equivalence #problem

The Equivalence Problem for Deterministic Pushdown Automata is Decidable (GS), pp. 671–681.

ICALP-1997-DrosteG #on the

On Recognizable and Rational Formal Power Series in Partially Commuting Variables (MD, PG), pp. 682–692.

ICALP-1997-Cassaigne #on the

On a Conjecture of J. Shallit (JC), pp. 693–704.

ICALP-1997-FrankelY #encryption #on the

On Characterization of Escrow Encryption Schemes (YF, MY), pp. 705–715.

ICALP-1997-SantisCP

Randomness-Efficient Non-Interactive Zero-Knowledge (ADS, GDC, GP), pp. 716–726.

ICALP-1997-Jansen #approximate #problem

Approximation Results for the Optimum Cost Partition Problem (KJ), pp. 727–737.

ICALP-1997-Bar-NoyK #graph

The Minimum Color Sum of Bipartite Graphs (ABN, GK), pp. 738–748.

ICALP-1997-Fujito #approach #approximate #problem

A Primal-Dual Approach to Approximation of Node-Deletion Problems for Matroidal Properties (TF), pp. 749–759.

ICALP-1997-BroersmaKKM #graph #independence #set

Independent Sets in Asteroidal Triple-Free Graphs (HB, TK, DK, HM), pp. 760–770.

ICALP-1997-GiacobazziR #abstract domain

Refining and Compressing Abstract Domains (RG, FR), pp. 771–781.

ICALP-1997-Dami #fault #reduction #runtime

Labelled Reductions, Runtime Errors and Operational Subsumption (LD), pp. 782–793.

ICALP-1997-ManziniM #automaton #classification #linear

A Complete and Efficiently Computable Topological Classification of D-dimensional Linear Cellular Automata over Zm (GM, LM), pp. 794–804.

ICALP-1997-Kabanets

Recognizability Equals Definability for Partial k-Paths (VK), pp. 805–815.

ICALP-1997-BeigelF #bound #nondeterminism #performance #recursion

Molecular Computing, Bounded Nondeterminism, and Efficient Recursion (RB, BF), pp. 816–826.

ICALP-1997-ErdosSSW #sequence

Constructing Big Trees from Short Sequences (PLE, MAS, LAS, TW), pp. 827–837.

ICALP-1997-Ruggieri #constraints #logic programming #source code #termination

Termination of Constraint Logic Programs (SR), pp. 838–848.

ICALP-1997-BuccafurriGS #power of #semantics

The Expressive Power of Unique Total Stable Model Semantics (FB, SG, DS), pp. 849–859.