Zoltán Fülöp, Ferenc Gécseg
Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
ICALP, 1995.

@proceedings{ICALP-1995,
	address       = "Szeged, Hungary",
	editor        = "Zoltán Fülöp and Ferenc Gécseg",
	isbn          = "3-540-60084-1",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 22nd International Colloquium on Automata, Languages and Programming}",
	volume        = 944,
	year          = 1995,
}

Contents (57 items)

7 ×#graph
6 ×#algorithm
4 ×#automaton
4 ×#bound
4 ×#finite
4 ×#on the
3 ×#equation
3 ×#problem
3 ×#random
2 ×#algebra

ICALP-1995-EhrenfeuchtHR

Theory of 2-Structures (AE, TH, GR), pp. 1–14.

ICALP-1995-DiekertG #concurrent #termination

A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces (VD, PG), pp. 15–26.

ICALP-1995-EsikB #axiom #equation

Nonfinite Axiomatizability of the Equational Theory of Shuffle (ZÉ, MB), pp. 27–38.

ICALP-1995-Kuich #algebra

The Algebraic Equivalent of AFL Theory (WK), pp. 39–50.

ICALP-1995-CulikK #finite #image

Finite State Transformations of Images (KCI, JK), pp. 51–62.

ICALP-1995-Lipponen #problem #word

Post Correspondence Problem: Words Possible as Primitive Solutions (ML), pp. 63–74.

ICALP-1995-MetivierRW #set #word

Computing the Closure of Sets of Words Under Partial Commutations (YM, GR, PAW), pp. 75–86.

ICALP-1995-BodlaenderF #graph

Intervalizing k-Colored Graphs (HLB, BdF), pp. 87–98.

ICALP-1995-Chen #algorithm #set #string

NC Algorithms for Finding a Maximal Set of Paths with Application to Compressing Strings (ZZC), pp. 99–110.

ICALP-1995-GiancarloG #algorithm #matrix #on the

On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications (RG, RG), pp. 111–122.

ICALP-1995-ParraS #graph #how

How to Use the Minimal Separators of a Graph for its Chordal Triangulation (AP, PS), pp. 123–134.

ICALP-1995-BermondGRV #performance

Fast Gossiping by Short Messages (JCB, LG, AAR, UV), pp. 135–146.

ICALP-1995-BaoI #automaton #finite

Break Finite Automata Public Key Cryptosystem (FB, YI), pp. 147–158.

ICALP-1995-NikoletseasRSY #graph #memory management #probability

Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time (SEN, JHR, PGS, MY), pp. 159–170.

ICALP-1995-BlundoSPV #on the #random

On the Number of Random Bits in Totally Private Computation (CB, ADS, GP, UV), pp. 171–182.

ICALP-1995-FreivaldsK #bound #random

Lower Time Bounds for Randomized Computation (RF, MK), pp. 183–195.

ICALP-1995-KoblerW

New Collapse Consequences of NP Having Small Circuits (JK, OW), pp. 196–207.

ICALP-1995-Balcazar #complexity #graph

The Complexity of Searching Succinctly Represented Graphs (JLB), pp. 208–219.

ICALP-1995-BauernoppelKKMNSU

Optimal Shooting: Characterizations and Applications (FB, EK, DK, AM, MN, JRS, JU), pp. 220–231.

ICALP-1995-AulettaPP #algorithm

Placing Resources in a Tree: Dynamic and Static Algorithms (VA, DP, GP), pp. 232–243.

ICALP-1995-ChaudhuriZ #graph #query

Shortest Path Queries in Digraphs of Small Treewidth (SC, CDZ), pp. 244–255.

ICALP-1995-GolinR #algorithm #programming

A Dynamic Programming Algorithm for Constructing Optimal Refix-Free Codes for Unequal Letter Costs (MJG, GR), pp. 256–267.

ICALP-1995-BodlaenderH #algorithm #bound #parallel

Parallel Algorithms with Optimal Speedup for Bounded Treewidth (HLB, TH), pp. 268–279.

ICALP-1995-Henzinger #approximate

Approximating Minimum Cuts under Insertions (MRH), pp. 280–291.

ICALP-1995-CorneilOS #algorithm #graph #linear

Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs (DGC, SO, LS), pp. 292–302.

ICALP-1995-LeonardiM #online #resource management #scheduling

On-line Resource Management with Applications to Routing and Scheduling (SL, AMS), pp. 303–314.

ICALP-1995-Petersen

Alternation in Simple Devices (HP), pp. 315–323.

ICALP-1995-Henzinger95a #automaton #bisimulation #finite #hybrid

Hybrid Automata with Finite Bisimulatioins (TAH), pp. 324–335.

ICALP-1995-LopezN

Generalized Sturmian Languages (LML, PN), pp. 336–347.

ICALP-1995-PinW #ambiguity #polynomial

Polynomial Closure and Unambiguous Product (JÉP, PW), pp. 348–359.

ICALP-1995-Ben-AmramG #algebra #bound #random

Lower Bounds on Algebraic Random Access Machines (AMBA, ZG), pp. 360–371.

ICALP-1995-PietracaprinaP #simulation

Improved Deterministic PRAM Simulation on the Mesh (AP, GP), pp. 372–383.

ICALP-1995-Ambos-Spies #approximate #on the #polynomial

On Optimal Polynomial Time Approximations: P-Levelability vs. Delta-Levelability (KAS), pp. 384–392.

ICALP-1995-FennerLM #sequence

Weakly Useful Sequences (SAF, JHL, EM), pp. 393–404.

ICALP-1995-Schwentick #graph #monad

Graph Connectivity, Monadic NP and Built-in Relations of Moderate Degree (TS), pp. 405–416.

ICALP-1995-HenzingerKW #power of

The Expressive Power of Clocks (TAH, PWK, HWT), pp. 417–428.

ICALP-1995-Paun #approach

Grammar Systems: A Grammatical Approach to Distribution and Cooperation (GP), pp. 429–443.

ICALP-1995-HarjuKP #equation

Compactness of Systems of Equations in Semigroups (TH, JK, WP), pp. 444–454.

ICALP-1995-DurisG #automaton

Sensing Versus Nonsensing Automata (PD, ZG), pp. 455–463.

ICALP-1995-BozanisKMT #bound #problem

New Upper Bounds for Generalized Intersection Searching Problems (PB, NK, CM, AKT), pp. 464–474.

ICALP-1995-BeckerDT

OKFDDs versus OBDDs and OFDDs (BB, RD, MT), pp. 475–486.

ICALP-1995-MaratheRSRRH #design #network #problem

Bicriteria Network Design Problems (MVM, RR, RS, SSR, DJR, HBHI), pp. 487–498.

ICALP-1995-Le #game studies #on the

On Determining Optimal Strategies in Pursiut Games in the Plane (NML), pp. 499–510.

ICALP-1995-Rubio #order

Extension Orderings (AR), pp. 511–522.

ICALP-1995-GrecoSZ #automaton #logic programming #source code

The PushDown Method to Optimize Chain Logic Programs (SG, DS, CZ), pp. 523–534.

ICALP-1995-AndersenKLN #automation #realtime #synthesis

Automatic Synthesis of Real Time Systems (JHA, KJK, KGL, JN), pp. 535–546.

ICALP-1995-BlumCGS #self

Self-Correcting for Function Fields Transcendental Degree (MB, BC, PG, TS), pp. 547–557.

ICALP-1995-FortnowFGKKSS #learning

Measure, Category and Learning Theory (LF, RF, WIG, MK, SAK, CHS, FS), pp. 558–569.

ICALP-1995-CosnardC #network

A Characterization of the Existence of Energies for Neural Networks (MC, EGC), pp. 570–580.

ICALP-1995-JurgensenK #fault

Variable-Length Codes for Error Correction (HJ, SK), pp. 581–592.

ICALP-1995-KhullerRR #named

Graphbots: Mobility in Discrete Spaces (SK, ER, AR), pp. 593–604.

ICALP-1995-BestK #equation #recursion

Solving Recursive Net Equations (EB, MK), pp. 605–623.

ICALP-1995-DawarHK #finite #logic

Implicit Definability and Infinitary Logic in Finite Model Theory (AD, LH, PGK), pp. 624–635.

ICALP-1995-Vogler #equivalence

The Limit of Split_n-Language Equivalence (WV), pp. 636–647.

ICALP-1995-NatarajanC #testing

Divergence and Fair Testing (VN, RC), pp. 648–659.

ICALP-1995-DeganoP #mobile #process

Causality for Mobile Processes (PD, CP), pp. 660–671.

ICALP-1995-Sangiorgi #calculus

Internal Mobility and Agent-Passing Calculi (DS), pp. 672–683.