Jirí Wiedermann, Peter van Emde Boas, Mogens Nielsen
Proceedings of the 26th International Colloquium on Automata, Languages and Programming
ICALP, 1999.
@proceedings{ICALP-1999,
address = "Prague, Czech Republic",
editor = "Jirí Wiedermann and Peter van Emde Boas and Mogens Nielsen",
isbn = "3-540-66224-3",
publisher = "{Springer-Verlag}",
series = "{Lecture Notes in Computer Science}",
title = "{Proceedings of the 26th International Colloquium on Automata, Languages and Programming}",
volume = 1644,
year = 1999,
}
Contents (68 items)
- ICALP-1999-Ajtai #generative #problem
- Generating Hard Instances of the Short Basis Problem (MA), pp. 1–9.
- ICALP-1999-Cardelli
- Wide Area Computation (LC), pp. 10–24.
- ICALP-1999-ComptonD #encryption #protocol #proving
- Proof Techniques for Cryptographic Protocols (KJC, SD), pp. 25–39.
- ICALP-1999-CraryM #low level #programming language
- Type Structure for Low-Level Programming Languages (KC, JGM), pp. 40–54.
- ICALP-1999-Cucker
- Real Computations with Fake Numbers (FC), pp. 55–73.
- ICALP-1999-Bruijn #memory management
- A Model for Associative Memory, a Basis for Thinking and Consciousness (NGdB), pp. 74–89.
- ICALP-1999-EdalatK #integration
- Numerical Integration with Exact Real Arithmetic (AE, MK), pp. 90–104.
- ICALP-1999-Hartmanis
- Observations about the Nature and State of Computer Science (JH), p. 105.
- ICALP-1999-RozenbergS #paradigm
- DNA Computing: New Ideas and Paradigms (GR, AS), pp. 106–118.
- ICALP-1999-Vitter #data type #memory management #online
- Online Data Structures in External Memory (JSV), pp. 119–133.
- ICALP-1999-Watanabe #learning
- From Computational Learning Theory to Discovery Science (OW0), pp. 134–148.
- ICALP-1999-AllenderABDL #bound
- Bounded Depth Arithmetic Circuits: Counting and Closure (EA, AA, DAMB, SD, HL), pp. 149–158.
- ICALP-1999-AlurTEP #logic #parametricity
- Parametric Temporal Logic for “Model Measuring” (RA, KE, SLT, DP), pp. 159–168.
- ICALP-1999-AlurKY #communication #state machine
- Communicating Hierarchical State Machines (RA, SK, MY), pp. 169–178.
- ICALP-1999-AndreevBCR #bound #branch #pseudo #set #source code
- Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs (AEA, JLB, AEFC, JDPR), pp. 179–189.
- ICALP-1999-BednarczykB #morphism #petri net
- General Morphisms of Petri Nets (MAB, AMB), pp. 190–199.
- ICALP-1999-BermanK #on the
- On Some Tighter Inapproximability Results (PB, MK), pp. 200–209.
- ICALP-1999-BouyerP #automaton #composition
- Decomposition and Composition of Timed Automata (PB, AP), pp. 210–219.
- ICALP-1999-BuhrmanJLV
- New Applications of the Incompressibility Method (HB, TJ, ML, PMBV), pp. 220–229.
- ICALP-1999-CardelliGG #mobile
- Mobility Types for Mobile Ambients (LC, ADG, GG), pp. 230–239.
- ICALP-1999-Clote #markov
- Protein Folding, the Levinthal Paradox and Rapidly Mixing Markov Chains (PC), pp. 240–249.
- ICALP-1999-CortierGJV #decidability #reachability
- Decidable Fragments of Simultaneous Rigid Reachability (VC, HG, FJ, MV), pp. 250–260.
- ICALP-1999-CrochemoreMRS #using
- Text Compression Using Antidictionaries (MC, FM, AR, SS), pp. 261–270.
- ICALP-1999-SantisCP
- Non-Interactive Zero-Knowledge: A Low-Randomness Characterization of NP (ADS, GDC, GP), pp. 271–280.
- ICALP-1999-DickhoferW #automaton #model checking #problem
- Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem (MD, TW), pp. 281–290.
- ICALP-1999-DodisK #graph #trade-off
- Space Time Tradeoffs for Graph Properties (YD, SK), pp. 291–300.
- ICALP-1999-DufordJS #bound
- Boundedness of Reset P/T Nets (CD, PJ, PS), pp. 301–310.
- ICALP-1999-EngelfrietH #finite #higher-order #logic #monad #transducer
- Two-Way Finite State Transducers and Monadic Second-Order Logic (JE, HJH), pp. 311–320.
- ICALP-1999-FlescaG #graph #order #query #regular expression
- Partially Ordered Regular Languages for Graph Queries (SF, SG), pp. 321–330.
- ICALP-1999-FrickG #first-order #graph
- Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs (MF, MG), pp. 331–340.
- ICALP-1999-Galpin #algebra #comparison #process #using
- Comparison of Process Algebra Equivalences Using Formats (VG), pp. 341–350.
- ICALP-1999-GavoilleH #bound #graph
- Compact Routing Tables for Graphs of Bounded Genus (CG, NH), pp. 351–360.
- ICALP-1999-GottlobLS
- Computing LOGCFL Certificates (GG, NL, FS), pp. 361–371.
- ICALP-1999-GrossiI #data type #linked data #maintenance #multi #open data #performance
- Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures (RG, GFI), pp. 372–381.
- ICALP-1999-GuptaKS #on the
- On the Complements of Partial k-Trees (AG, DK, TCS), pp. 382–391.
- ICALP-1999-HammarN #approximate
- Approximation Results for Kinetic Variants of TSP (MH, BJN), pp. 392–401.
- ICALP-1999-HassinP #distributed #probability
- Distributed Probabilistic Polling and Applications to Proportionate Agreement (YH, DP), pp. 402–411.
- ICALP-1999-HirshfeldJ #algebra #bisimulation #decidability #process
- Bisimulation Equivanlence Is Decidable for Normed Process Algebra (YH, MJ), pp. 412–421.
- ICALP-1999-HirshfeldR #decidability #framework #logic
- A Framework for Decidable Metrical Logics (YH, AMR), pp. 422–432.
- ICALP-1999-HromkovicS #automaton #finite #on the #power of
- On the Power of Las Vegas II. Two-Way Finite Automata (JH, GS), pp. 433–442.
- ICALP-1999-IwamaMMM
- Stable Marriage with Incomplete Lists and Ties (KI, DM, SM, YM), pp. 443–452.
- ICALP-1999-JiangLV #complexity
- Average-Case Complexity of Shellsort (TJ, ML, PMBV), pp. 453–462.
- ICALP-1999-KimP #2d #linear
- Linear-Time Construction of Two-Dimensional Suffix Trees (DKK, KP), pp. 463–472.
- ICALP-1999-Kirsten #finite #monad #problem
- A Connection between the Star Problem and the Finite Power Property in Trace Monoids (DK), pp. 473–482.
- ICALP-1999-KirstenM #problem
- Two Techniques in the Area of the Star Problem (DK, JM), pp. 483–492.
- ICALP-1999-KrauseSW #approximate #problem
- Approximations by OBDDs and the Variable Ordering Problem (MK, PS, IW), pp. 493–502.
- ICALP-1999-KuceraM #algebra #process #simulation
- Simulation Preorder on Simple Process Algebras (AK, RM), pp. 503–512.
- ICALP-1999-LaneveV
- Solos in Concert (CL, BV), pp. 513–523.
- ICALP-1999-LanthierMS
- Shortest Anisotropic Paths on Terrains (ML, AM, JRS), pp. 524–533.
- ICALP-1999-Lepisto #word
- Relations between Local and Global Periodicity of Words (AL), pp. 534–543.
- ICALP-1999-LingasOO #maintenance #performance
- Efficient Merging, Construction, and Maintenance of Evolutionary Trees (AL, HO, AÖ), pp. 544–553.
- ICALP-1999-Miculan #calculus #formal method #induction #lazy evaluation #proving #μ-calculus
- Formalizing a Lazy Substitution Proof System for μ-calculus in the Calculus of Inductive Constructions (MM), pp. 554–564.
- ICALP-1999-NichitiuR #automaton
- Leader Election by d Dimensional Cellular Automata (CMN, ER), pp. 565–574.
- ICALP-1999-NiedermeierR #bound #satisfiability
- New Upper Bounds for MaxSat (RN, PR), pp. 575–584.
- ICALP-1999-OlshevskyP #evaluation #matrix #polynomial
- Polynomial and Rational Evaluation and Interpolation (with Structured Matrices) (VO, VYP), pp. 585–594.
- ICALP-1999-Pagh
- Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time (RP), pp. 595–604.
- ICALP-1999-PeichlV #automaton #finite
- Finite Automata with Generalized Acceptance Criteria (TP, HV), pp. 605–614.
- ICALP-1999-PelegR #complexity #distributed
- A Variant of the Arrow Distributed Directory with Low Average Complexity (DP, ER), pp. 615–624.
- ICALP-1999-PowerT
- Closed Freyd- and κ-categories (JP, HT), pp. 625–634.
- ICALP-1999-RieckeT #continuation
- Typed Exeptions and Continuations Cannot Macro-Express Each Other (JGR, HT), pp. 635–644.
- ICALP-1999-Rutten #automaton #induction
- Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously (JJMMR), pp. 645–654.
- ICALP-1999-Sanders #multi #sequence #set
- Accessing Multiple Sequences Through Set Associative Caches (PS), pp. 655–664.
- ICALP-1999-Senizergues #question
- T(A) = T(B)? (GS), pp. 665–675.
- ICALP-1999-Szegedy #artificial reality #logic #proving
- Many-Valued Logics and Holographic Proofs (MS), pp. 676–686.
- ICALP-1999-Umans #complexity #on the #problem
- On the Complexity and Inapproximability of Shortest Implicant Problems (CU), pp. 687–696.
- ICALP-1999-WeihrauchZ
- The Wave Propagator Is Turing Computable (KW, NZ), pp. 697–707.
- ICALP-1999-Woeginger
- An FPTAS for Agreeably Weighted Variance on a Single Machine (GJW), pp. 707–716.
- ICALP-1999-Tiskin #matrix #named #parallel
- Erratum: Bulk-synchronous Parallel Multiplication of Boolean Matrices (AT), pp. 717–718.
6 ×#automaton
6 ×#problem
5 ×#bound
4 ×#finite
4 ×#graph
4 ×#logic
4 ×#on the
3 ×#algebra
3 ×#complexity
3 ×#decidability
6 ×#problem
5 ×#bound
4 ×#finite
4 ×#graph
4 ×#logic
4 ×#on the
3 ×#algebra
3 ×#complexity
3 ×#decidability