Serge Abiteboul, Eli Shamir
Proceedings of the 21st International Colloquium on Automata, Languages and Programming
ICALP, 1994.

@proceedings{ICALP-1994,
	address       = "Jerusalem, Israel",
	editor        = "Serge Abiteboul and Eli Shamir",
	isbn          = "3-540-58201-0",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 21st International Colloquium on Automata, Languages and Programming}",
	volume        = 820,
	year          = 1994,
}

Contents (52 items)

7 ×#on the
7 ×#performance
6 ×#bound
4 ×#analysis
4 ×#automaton
4 ×#complexity
4 ×#graph
4 ×#network
4 ×#parallel
4 ×#problem

ICALP-1994-Pudlak #bound #communication #complexity #game studies

Unexpected Upper Bounds on the Complexity of Some Communication Games (PP), pp. 1–10.

ICALP-1994-FernauS #ambiguity #geometry

Valuations and Unambiguity of Languages, with Applications to Fractal Geometry (HF, LS), pp. 11–22.

ICALP-1994-Siegelmann #network #on the #power of #probability

On The Computational Power of Probabilistic and Faulty Neural Networks (HTS), pp. 23–34.

ICALP-1994-Cerans #automaton #relational

Deciding Properties of Integral Relational Automata (KC), pp. 35–46.

ICALP-1994-AumannBF #bound #cost analysis #fault #on the

On the Cost of Recomputing: Tight Bounds on Pebbling with Faults (YA, JBI, UF), pp. 47–58.

ICALP-1994-AsarinM #on the

On some Relations between Dynamical Systems and Transition Systems (EA, OM), pp. 59–72.

ICALP-1994-GlobermanH #automaton #complexity #logic #multi

Complexity Results for Multi-Pebble Automata and their Logics (NG, DH), pp. 73–82.

ICALP-1994-KanellakisHM #analysis #re-engineering

An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction (PCK, GGH, HGM), pp. 83–105.

ICALP-1994-GyssensBG #performance

Expressiveness of Efficient Semi-Deterministic Choice Constructs (MG, JVdB, DVG), pp. 106–117.

ICALP-1994-GradelG #complexity

Tailoring Recursing for Complexity (EG, YG), pp. 118–129.

ICALP-1994-KlarlundMS #automaton

Determinizing Asynchronous Automata (NK, MM, MAS), pp. 130–141.

ICALP-1994-Muscholl #automaton #on the

On the Complementation of Büchi Asynchronous Cellular Automata (AM), pp. 142–153.

ICALP-1994-CorradiniN #concurrent #locality

Distribution and Locality of Concurrent Systems (FC, RDN), pp. 154–165.

ICALP-1994-GawlickSSL #liveness

Liveness in Timed and Untimed Systems (RG, RS, JFSA, NAL), pp. 166–177.

ICALP-1994-Sanchez-CousoF #analysis #pattern matching #probability

Average-Case Analysis of Pattern-Matching in Trees under the BST Probability Model (JRSC, MIFC), pp. 178–190.

ICALP-1994-JiangL #approximate #on the #sequence

On the Approximation of Shortest Common Supersequences and Longest Common Subsequences (TJ, ML), pp. 191–202.

ICALP-1994-HariharanM #algorithm #parallel

Optimal Parallel Algorithms for Prefix Matching (RH, SM), pp. 203–214.

ICALP-1994-AmirBF #2d

Optimal Two-Dimensional Compressed Matching (AA, GB, MF), pp. 215–226.

ICALP-1994-ItalianoR #maintenance

Maintaining Spanning Trees of Small Diameter (GFI, RR), pp. 227–238.

ICALP-1994-GilM #parallel #performance

Simple Fast Parallel Hashing (JYG, YM), pp. 239–250.

ICALP-1994-PrzytyckaL #problem #revisited

The Optimal Alphabetic Tree Problem Revisited (TMP, LLL), pp. 251–262.

ICALP-1994-BuhrmanT #bound #on the

On the Cutting Edge of Relativization: The Resource Bounded Injury Method (HB, LT), pp. 263–273.

ICALP-1994-BirgetMMW #algorithm #problem

PSPACE-Completeness of Certain Algorithmic Problems on the Subgroups of Free Groups (JCB, SWM, JCM, PW), pp. 274–285.

ICALP-1994-Hennessy #higher-order #modelling #process

Higher-Order Process and Their Models (MH), pp. 286–303.

ICALP-1994-VergauwenL #correctness #equation #performance

Efficient Local Correctness Checking for Single and Alternating Boolean Equation Systems (BV, JL), pp. 304–315.

ICALP-1994-AbdullaJ #decidability #problem #source code #verification

Undecidable Verification Problems for Programs with Unreliable Channels (PAA, BJ), pp. 316–327.

ICALP-1994-FixS #reasoning #source code

Reasoning about Programs by Exploiting the Environment (LF, FBS), pp. 328–339.

ICALP-1994-Brauner #logic

A Model of Intuitionistic Affine Logic From Stable Domain Theory (TB), pp. 340–351.

ICALP-1994-PlotkinW #linear #logic

Bistructures, Bidomains and Linear Logic (GDP, GW), pp. 352–363.

ICALP-1994-AzizSBBS

Equivalences for Fair Kripke Structures (AA, VS, FB, RKB, ALSV), pp. 364–375.

ICALP-1994-Breugel #lts

Generalized Finiteness Conditions of Labelled Transition Systems (FvB), pp. 376–387.

ICALP-1994-Droste #concurrent #monad #theorem

A KLeene Theorem for Recognizable Languages over Concurrency Monoids (MD), pp. 388–399.

ICALP-1994-Seidl #equation

Least Solutions of Equations over N (HS), pp. 400–411.

ICALP-1994-HotzP #analysis #context-free grammar #performance

Fast Uniform Analysis of Coupled-Context-Free Languages (GH, GP), pp. 412–423.

ICALP-1994-Pin #polynomial #set

Polynomial Closure of Group Languages and Open Sets of the Hall Topology (JÉP), pp. 424–435.

ICALP-1994-CaronCCDJ #constraints

Pumping, Cleaning and Symbolic Constraints Solving (ACC, HC, JLC, MD, FJ), pp. 436–449.

ICALP-1994-HintermeierKK #dynamic typing #equation #order

Dynamically-Typed Computations for Order-Sorted Equational Presentations (CH, CK, HK), pp. 450–461.

ICALP-1994-CosmoK #algebra #first-order #recursion #term rewriting #λ-calculus

Combining First Order Algebraic Rewriting Systems, Recursion and Extensional λ Calculi (RDC, DK), pp. 462–472.

ICALP-1994-Upfal #formal method #network #on the #parallel

On the Theory of Interconnection Networks for Parallel Computers (EU), pp. 473–486.

ICALP-1994-GargVY #graph #multi

Multiway Cuts in Directed and Node Weighted Graphs (NG, VVV, MY), pp. 487–498.

ICALP-1994-Feige #algorithm #graph #performance #random

A Fast Randomized LOGSPACE Algorithm for Graph Connectivity (UF), pp. 499–507.

ICALP-1994-NikolestseasPSY #graph #multi #network #random #reliability

Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing (SEN, KVP, PGS, MY), pp. 508–519.

ICALP-1994-Lagergren

The Size of an Interwine (JL), pp. 520–531.

ICALP-1994-YusterZ #performance

Finding Even Cycles Even Faster (RY, UZ), pp. 532–543.

ICALP-1994-HoftingW #analysis #graph #polynomial

Polynomial Time Analysis of Torodial Periodic Graphs (FH, EW), pp. 544–555.

ICALP-1994-Bonizzoni #bound

A Tight Lower Bound for Primitivity in k-Structures (PB), pp. 556–567.

ICALP-1994-BlundoSV #distributed #protocol

Randomness in Distributed Protocols (CB, ADS, UV), pp. 568–579.

ICALP-1994-FreivaldsK #bound #random

Lower Space Bounds for Randomized Computation (RF, MK), pp. 580–592.

ICALP-1994-JakobyRSW #complexity #parallel #problem

The Average Case Complexity of the Parallel Prefix Problem (AJ, RR, CS, SW), pp. 593–604.

ICALP-1994-GolinY #word

Prefix Codes: Equiprobable Words, Unequal Letter Costs (MJG, NEY), pp. 605–617.

ICALP-1994-PlaxtonS #bound #network #sorting

A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks (CGP, TS), pp. 618–629.

ICALP-1994-MeiI #navigation #performance

Efficient Strategies for Robot Navigation in Unknown Environment (AM, YI), pp. 630–641.