Friedhelm Meyer auf der Heide, Burkhard Monien
Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
ICALP, 1996.

@proceedings{ICALP-1996,
	address       = "Paderborn, Germany",
	editor        = "Friedhelm Meyer auf der Heide and Burkhard Monien",
	isbn          = "3-540-61440-0",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 23rd International Colloquium on Automata, Languages and Programming}",
	volume        = 1099,
	year          = 1996,
}

Contents (56 items)

8 ×#on the
6 ×#algorithm
6 ×#graph
5 ×#bound
5 ×#performance
4 ×#problem
3 ×#automaton
3 ×#calculus
3 ×#process
3 ×#random

ICALP-1996-Ganzinger #proving #theorem proving

Saturation-Based Theorem Proving (HG), pp. 1–3.

ICALP-1996-Ranade #parallel #performance

Bandwidth Efficient Parallel Computation (AGR), pp. 4–23.

ICALP-1996-BruyereL

Variable-Length Maximal Codes (VB, ML), pp. 24–47.

ICALP-1996-Razborov #bound #independence #proving

Lower Bounds for Propositional Proofs and Independence Results in Bounded Arithmetic (AAR), pp. 48–62.

ICALP-1996-ChenN #algebra

Algebraic Characterizations of Decorated Trace Equivalences over Tree-Like Structures (XJC, RDN), pp. 63–74.

ICALP-1996-JennerV #performance

Fast Asynchronous Systems in Dense Time (LJ, WV), pp. 75–86.

ICALP-1996-Lenzi #calculus #theorem #μ-calculus

A Hierarchy Theorem for the μ-Calculus (GL), pp. 87–97.

ICALP-1996-BradfieldEM #calculus #effectiveness #linear #μ-calculus

An Effective Tableau System for the Linear Time μ-Calculus (JCB, JE, AM), pp. 98–109.

ICALP-1996-Joung #interactive #multi

Characterizing Fairness Implementability for Multiparty Interaction (YJJ), pp. 110–121.

ICALP-1996-Lucas #termination

Termination of Context-Sensitive Rewriting by Rewriting (SL), pp. 122–133.

ICALP-1996-ChengK #axiom #constraints #set

A Complete Gentzen-Style Axiomatization for Set Constraints (AC, DK), pp. 134–145.

ICALP-1996-Billaud #fault

Fatal Errors in Conditional Expressions (MB), pp. 146–157.

ICALP-1996-Mossakowski #framework #logic

Different Types of Arrow Between Logical Frameworks (TM), pp. 158–169.

ICALP-1996-MitchellV #effectiveness #modelling #morphism #polymorphism #recursion #type system

Effective Models of Polymorphism, Subtyping and Recursion (JCM, RV), pp. 170–181.

ICALP-1996-BosscherG #decidability #process #scalability

Regularity for a Large Class of Context-Free Processes is Decidable (DJBB, WODG), pp. 182–193.

ICALP-1996-Caucal #decidability #graph #infinity #monad #on the

On Infinite Transition Graphs Having a Decidable Monadic Theory (DC), pp. 194–205.

ICALP-1996-Senizergues #graph

Semi-Groups Acting on Context-Free Graphs (GS), pp. 206–218.

ICALP-1996-Lisovik #linear #set

Hard Sets Method and Semilinear Reservoir Method with Applications (LPL), pp. 219–231.

ICALP-1996-FlajoletGP #polynomial #random

Random Polynomials and Polynomial Factorization (PF, XG, DP), pp. 232–243.

ICALP-1996-KoppenhagenM #algorithm

Optimal Gröbner Base Algorithms for Binomial Ideals (UK, EWM), pp. 244–255.

ICALP-1996-KloksKW #graph

Minimum Fill-In on Circle and Circular-Arc Graphs (TK, DK, CKW), pp. 256–267.

ICALP-1996-Chen #approximate #graph #problem

Practical Approximation Schemes for Maximum Induced-Subgraph Problems on K_{3, 3}-free or K_5-free Graphs (ZZC), pp. 268–279.

ICALP-1996-KoutsoupiasPY #graph

Searching a Fixed Graph (EK, CHP, MY), pp. 280–289.

ICALP-1996-HenzingerT #algorithm #graph

Improved Sampling with Applications to Dynamic Graph Algorithms (MRH, MT), pp. 290–299.

ICALP-1996-Pin #automaton #calculus #first-order #power of

The Expressive Power of Existential First Order Sentences of Büchi’s Sequential Calculus (JÉP), pp. 300–311.

ICALP-1996-Kaivola #automaton #fixpoint

Fixpoints for Rabin Tree Automata Make Complementation Easy (RK), pp. 312–323.

ICALP-1996-Hashiguchi #automaton #bound #distance

New Upper Bounds to the Limitedness of Distance Automata (KH), pp. 324–335.

ICALP-1996-Raymond #data flow #network #regular expression

Recognizing Regular Expressions by Means of Dataflow Networks (PR), pp. 336–347.

ICALP-1996-AblayevK #branch #on the #power of #random #source code

On the Power of Randomized Branching Programs (FMA, MK), pp. 348–356.

ICALP-1996-AndreevCR #set

Hitting Sets Derandomize BPP (AEA, AEFC, JDPR), pp. 357–368.

ICALP-1996-BookVW #on the #probability #quantifier

On Type-2 Probabilistic Quantifiers (RVB, HV, KWW), pp. 369–380.

ICALP-1996-Wiedermann #nondeterminism

Speeding-up Single-Tape Nondeterministic Computations by Single Alternation, with Separation Results (JW), pp. 381–392.

ICALP-1996-Julia #on the

On ω-Generators and Codes (SJ), pp. 393–402.

ICALP-1996-Luca #morphism #on the #standard

On Standard Sturmian Morphisms (AdL), pp. 403–415.

ICALP-1996-AtenieseBSS #bound #encryption #visual notation

Constructions and Bounds for Visual Cryptography (GA, CB, ADS, DRS), pp. 416–428.

ICALP-1996-AzarBFFLR #on the

On Capital Investment (YA, YB, EF, AF, SL, AR), pp. 429–441.

ICALP-1996-Miltersen #bound #multi

Lower Bounds for Static Dictionaries on RAMs with Bit Operations But No Multiplication (PBM), pp. 442–453.

ICALP-1996-BradfordR #bound

Lower Bounds for Row Minima Searching (PGB, KR), pp. 454–465.

ICALP-1996-ShuklaHRS #complexity #finite #on the #problem #process #relational

On the Complexity of Relational Problems for Finite State Processes (SKS, HBHI, DJR, RES), pp. 466–477.

ICALP-1996-JancarE #bisimulation #petri net

Deciding Finiteness of Petri Nets Up To Bisimulation (PJ, JE), pp. 478–489.

ICALP-1996-BodeiDP #distributed #mobile #process

Mobile Processes with a Distributed Environment (CB, PD, CP), pp. 490–501.

ICALP-1996-Glabbeek #specification

The Meaning of Negative Premises in Transition System Specifications II (RJvG), pp. 502–513.

ICALP-1996-AlbersM #algorithm #analysis

Average Case Analyses of List Update Algorithms, with Applications to Data Compression (SA, MM), pp. 514–525.

ICALP-1996-SchulzS #data type #self

Self-Organizing Data Structures with Dependent Accesses (FS, ES), pp. 526–537.

ICALP-1996-ChoiG #algorithm #analysis

Lopsided Trees: Analyses, Algorithms, and Applications (VSNC, MJG), pp. 538–549.

ICALP-1996-FarachM #random

Optimal Logarithmic Time Randomized Suffix Tree Construction (MF, SM), pp. 550–561.

ICALP-1996-AlonS #approximate #integer #parallel #problem #programming

Improved Parallel Approximation of a Class of Integer Programming Programming Problems (NA, AS), pp. 562–573.

ICALP-1996-BermondGPRV #communication #network #performance

Efficient Collective Communication in Optical Networks (JCB, LG, SP, AAR, UV), pp. 574–585.

ICALP-1996-ChlebusGI #simulation

Shared-Memory Simulations on a Faulty-Memory DMM (BSC, AG, PI), pp. 586–597.

ICALP-1996-HerleyPP #backtracking #performance

Fast Deterministic Backtrack Search (KTH, AP, GP), pp. 598–609.

ICALP-1996-YuY #problem #symmetry

Agent Rendezvous: A Dynamic Symmetry-Breaking Problem (XY, MY), pp. 610–621.

ICALP-1996-AumannB #performance

Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler (YA, MAB), pp. 622–633.

ICALP-1996-CowenFK #framework #heuristic #source code

A Formal Framework for Evaluating Heuristic Programs (LC, JF, SK), pp. 634–645.

ICALP-1996-ChakrabartiPSSSW #algorithm #scheduling

Improved Scheduling Algorithms for Minsum Criteria (SC, CAP, ASS, DBS, CS, JW), pp. 646–657.

ICALP-1996-PatersonP #complexity #on the #string

On the Complexity of String Folding (MP, TMP), pp. 658–669.

ICALP-1996-Fernandez-BacaL #algorithm #polynomial

A Polynomial-Time Algorithm for Near-Perfect Phylogeny (DFB, JL), pp. 670–680.