Proceedings of the 20th International Colloquium on Automata, Languages and Programming
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Andrzej Lingas, Rolf G. Karlsson, Svante Carlsson
Proceedings of the 20th International Colloquium on Automata, Languages and Programming
ICALP, 1993.

FLT
DBLP
Scholar
Full names Links ISxN
@proceedings{ICALP-1993,
	address       = "Lund, Sweden",
	editor        = "Andrzej Lingas and Rolf G. Karlsson and Svante Carlsson",
	isbn          = "3-540-56939-1",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 20th International Colloquium on Automata, Languages and Programming}",
	volume        = 700,
	year          = 1993,
}

Contents (56 items)

ICALP-1993-Blum #approach #reliability #source code
Program Result Checking: A New Approach to Making Programs More Reliable (MB), pp. 1–14.
ICALP-1993-AnderssonM
Dynamic Interpolation Search in o(log log n) Time (AA, CM), pp. 15–27.
ICALP-1993-Frederickson
Searching among Intervals and Compact Routing Tables (GNF), pp. 28–39.
ICALP-1993-LundY #approximate #problem
The Approximation of Maximum Subgraph Problems (CL, MY), pp. 40–51.
ICALP-1993-Kann #approximate #bound #problem
Polynomially Bounded Minimization Problems which are Hard to Approximate (VK), pp. 52–63.
ICALP-1993-GargVY #algorithm #approximate #multi #set
Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover (NG, VVV, MY), pp. 64–75.
ICALP-1993-MaratheHR #approximate #complexity #problem #specification
The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (MVM, HBHI, SSR), pp. 76–87.
ICALP-1993-CzumajG #graph #problem
Problems on Pairs of Trees and the Four Colour Problem of Planar Graphs (AC, AG), pp. 88–101.
ICALP-1993-KalyanasundaramP #information management
Constructing Competitive Tours From Local Information (BK, KP), pp. 102–113.
ICALP-1993-BodlaenderKK #graph #permutation
Treewidth and Pathwidth of Permutation Graphs (HLB, TK, DK), pp. 114–125.
ICALP-1993-JaromczykS #algorithm #formal method
A Theory of Even Functionals and Their Algorithmic Applications (JWJ, GS), pp. 126–136.
ICALP-1993-FlajoletG #divide and conquer
Exact Asymptotics of Divide-and-Conquer Recurrences (PF, MJG), pp. 137–149.
ICALP-1993-KozenZ #bound #problem
Optimal Bounds for the Change-Making Problem (DK, SZ), pp. 150–161.
ICALP-1993-ReifT #complexity #simulation
The Complexity of N-body Simulation (JHR, SRT), pp. 162–176.
ICALP-1993-DillencourtS
A Simple Method for Resolving Degeneracies in Delaunay Triangulations (MBD, WDS), pp. 177–188.
ICALP-1993-Hemachandra #complexity #fault tolerance
Fault-Tolerance and Complexity (LAH), pp. 189–202.
ICALP-1993-Yamamoto #bound #nondeterminism #trade-off #turing machine
Reversal-Space Trade-offs For Simultaneous Resource-Bounded Nondeterministic Turing Machines (HY), pp. 203–214.
ICALP-1993-Orponen #on the #power of
On the Computational Power of Discrete Hopfield Nets (PO), pp. 215–226.
ICALP-1993-KarpinskiV #on the #random
On Randomized Versus Deterministic Computation (MK, RV), pp. 227–240.
ICALP-1993-Ablayev #bound #communication #complexity #probability
Lower Bounds for One-way Probabilistic Communication Complexity (FMA), pp. 241–252.
ICALP-1993-HagerupMM #maintenance #probability
Maintaining Discrete Probability Distributions Optimally (TH, KM, JIM), pp. 253–264.
ICALP-1993-FranklinY #performance
Secure and Efficient Off-Line Digital Money (MKF, MY), pp. 265–276.
ICALP-1993-JuedesLL
Computational Depth and Reducibility (DWJ, JIL, JHL), pp. 277–288.
ICALP-1993-BaligaC #named
Learnability: Admissible, Co-finite, and Hypersimple Languages (GB, JC), pp. 289–300.
ICALP-1993-JiangSSY #decidability #pattern matching
Inclusion is Undecidable for Pattern Languages (TJ, AS, KS, SY), pp. 301–312.
ICALP-1993-IbarraJTW #decidability
New Decidability Results Concerning Two-way Counter Machines and Applications (OHI, TJ, NQT, HW), pp. 313–324.
ICALP-1993-MichauxV #automaton #theorem
Cobham’s Ttheorem seen through Büchi’s Theorem (CM, RV), pp. 325–334.
ICALP-1993-EbingerM #infinity #logic
Logical Definability on Infinite Traces (WE, AM), pp. 335–346.
ICALP-1993-Wilke #algebra #testing
Algebras for Classifying Regular Tree Languages and an Application to Frontier Testability (TW), pp. 347–358.
ICALP-1993-Gupta #automaton #finite #product line
Finite Automata as Characterizations of Minor Closed Tree Families (AG), pp. 359–370.
ICALP-1993-DolevM #algorithm #distributed #on the
On Distributed Algorithms in a Broadcast Domain (DD, DM), pp. 371–387.
ICALP-1993-ChlebusDP #network #performance #reliability
Sparse Networks Supporting Efficient Reliable Broadcasting (BSC, KD, AP), pp. 388–397.
ICALP-1993-HeideOW #adaptation
Strongly Adaptive Token Distribution (FMadH, BO, RW), pp. 398–409.
ICALP-1993-Schonhage #adaptation #finite #parallel #performance
Fast Parallel Computation of Characteristic Polynomials by Leverrier’s POwer Sum Method Adapted to Fields of Finite Characteristic (AS), pp. 410–417.
ICALP-1993-Kirousis #constraints #parallel #performance
Fast Parallel Constraint Satisfaction (LMK), pp. 418–429.
ICALP-1993-Simon
The Product of Rational Languages (IS), pp. 430–444.
ICALP-1993-OchmanskiW #on the
On Regular Compatibility of Semi-Commutations (EO, PAW), pp. 445–456.
ICALP-1993-Dumas #algebra #aspect-oriented
Algebraic Aspects of B-regular Series (PD), pp. 457–468.
ICALP-1993-CohenF #finite #state machine
Products of Finite State Machines with Full Coverage (DMC, MLF), pp. 469–477.
ICALP-1993-Senizergues #effectiveness #theorem
An Effective Version of Stallings’ Theorem in the Case of Context-Free Groups (GS), pp. 478–495.
ICALP-1993-Lepisto #morphism #on the #power of
On the Power of Periodic Iteration of Morphisms (AL), pp. 496–506.
ICALP-1993-MignosiS
If a D0L Language is k-Power Free then it is Circular (FM, PS), pp. 507–518.
ICALP-1993-JategaonkarM #concurrent #finite
Deciding True Concurrency Equivalences on Finite Sate Nets (LJ, ARM), pp. 519–531.
ICALP-1993-Vogler #concurrent #testing
Timed Testing of Concurrent Systems (WV), pp. 532–543.
ICALP-1993-HavelundL #calculus
The Fork Calculus (KH, KGL), pp. 544–557.
ICALP-1993-InverardiPY #bisimulation #parametricity
Extended Transition Systems for Parametric Bisimulation (PI, CP, DY), pp. 558–569.
ICALP-1993-BrownG #category theory #logic #petri net
Temporal Logic and Categories of Petri Nets (CB, DG), pp. 570–581.
ICALP-1993-LodayaT #decidability #logic #partial order
Decidability of a Partial Order Based Temporal Logic (KL, PST), pp. 582–592.
ICALP-1993-HungarS #model checking #process
Local Model Checking for Context-Free Processes (HH, BS), pp. 593–605.
ICALP-1993-AbiteboulV
Computing on Structures (SA, VV), pp. 606–620.
ICALP-1993-Contejean #reduction
A Partial Solution for D-Unification Based on a Reduction to AC1-Unification (EC), pp. 621–632.
ICALP-1993-CodishFMW #analysis #concurrent #constraints #logic programming #performance #source code
Efficient Analysis of Concurrent Constraint Logic Programs (MC, MF, KM, WHW), pp. 633–644.
ICALP-1993-CosmoK #confluence #recursion #reduction #λ-calculus
A Confluent Reduction for the Extensional Typed λ-Calculus with Pairs, Sums, Recursion and terminal Object (RDC, DK), pp. 645–656.
ICALP-1993-BarbaneraF #composition #confluence #term rewriting #termination
Modularity of Termination and Confluence in Combinations of Rewrite Systems with λω (FB, MF), pp. 657–668.
ICALP-1993-BrachoD #automaton #concurrent
From Domains to Automata with Concurrency (FB, MD), pp. 669–681.
ICALP-1993-KannegantiC #higher-order #programming language #question #what
What is a Universal Higher-Order Programming Language? (RK, RC), pp. 682–695.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.