The SCEAS System
Navigation Menu

Conferences in DBLP

International Colloquium on Automata, Languages and Programming (ICALP) (icalp)
1999 (conf/icalp/99)

  1. Miklós Ajtai
    Generating Hard Instances of the Short Basis Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:1-9 [Conf]
  2. Luca Cardelli
    Wide Area Computation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:10-24 [Conf]
  3. Kevin J. Compton, Scott Dexter
    Proof Techniques for Cryptographic Protocols. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:25-39 [Conf]
  4. Karl Crary, J. Gregory Morrisett
    Type Structure for Low-Level Programming Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:40-54 [Conf]
  5. Felipe Cucker
    Real Computations with Fake Numbers. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:55-73 [Conf]
  6. N. G. de Bruijn
    A Model for Associative Memory, a Basis for Thinking and Consciousness. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:74-89 [Conf]
  7. Abbas Edalat, Marko Krznaric
    Numerical Integration with Exact Real Arithmetic. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:90-104 [Conf]
  8. Juris Hartmanis
    Observations about the Nature and State of Computer Science (Keynote Address). [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:105- [Conf]
  9. Grzegorz Rozenberg, Arto Salomaa
    DNA Computing: New Ideas and Paradigms. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:106-118 [Conf]
  10. Jeffrey Scott Vitter
    Online Data Structures in External Memory. [Citation Graph (1, 0)][DBLP]
    ICALP, 1999, pp:119-133 [Conf]
  11. Osamu Watanabe
    From Computational Learning Theory to Discovery Science. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:134-148 [Conf]
  12. Eric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LeThanh
    Bounded Depth Arithmetic Circuits: Counting and Closure. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:149-158 [Conf]
  13. Rajeev Alur, Kousha Etessami, Salvatore La Torre, Doron Peled
    Parametric Temporal Logic for "Model Measuring". [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:159-168 [Conf]
  14. Rajeev Alur, Sampath Kannan, Mihalis Yannakakis
    Communicating Hierarchical State Machines. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:169-178 [Conf]
  15. Alexander E. Andreev, Juri L. Baskakov, Andrea E. F. Clementi, José D. P. Rolim
    Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:179-189 [Conf]
  16. Marek A. Bednarczyk, Andrzej M. Borzyszkowski
    General Morphisms of Petri Nets (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:190-199 [Conf]
  17. Piotr Berman, Marek Karpinski
    On Some Tighter Inapproximability Results (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:200-209 [Conf]
  18. Patricia Bouyer, Antoine Petit
    Decomposition and Composition of Timed Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:210-219 [Conf]
  19. Harry Buhrman, Tao Jiang, Ming Li, Paul M. B. Vitányi
    New Applications of the Incompressibility Method. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:220-229 [Conf]
  20. Luca Cardelli, Andrew D. Gordon, Giorgio Ghelli
    Mobility Types for Mobile Ambients. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:230-239 [Conf]
  21. Peter Clote
    Protein Folding, the Levinthal Paradox and Rapidly Mixing Markov Chains. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:240-249 [Conf]
  22. Véronique Cortier, Harald Ganzinger, Florent Jacquemard, Margus Veanes
    Decidable Fragments of Simultaneous Rigid Reachability. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:250-260 [Conf]
  23. Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Sergio Salemi
    Text Compression Using Antidictionaries. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:261-270 [Conf]
  24. Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano
    Non-Interactive Zero-Knowledge: A Low-Randomness Characterization of NP. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:271-280 [Conf]
  25. Martin Dickhöfer, Thomas Wilke
    Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:281-290 [Conf]
  26. Yevgeniy Dodis, Sanjeev Khanna
    Space Time Tradeoffs for Graph Properties. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:291-300 [Conf]
  27. Catherine Dufourd, Petr Jancar, Ph. Schnoebelen
    Boundedness of Reset P/T Nets. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:301-310 [Conf]
  28. Joost Engelfriet, Hendrik Jan Hoogeboom
    Two-Way Finite State Transducers and Monadic Second-Order Logic. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:311-320 [Conf]
  29. Sergio Flesca, Sergio Greco
    Partially Ordered Regular Languages for Graph Queries. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:321-330 [Conf]
  30. Markus Frick, Martin Grohe
    Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs. [Citation Graph (1, 0)][DBLP]
    ICALP, 1999, pp:331-340 [Conf]
  31. Vashti Galpin
    Comparison of Process Algebra Equivalences Using Formats. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:341-350 [Conf]
  32. Cyril Gavoille, Nicolas Hanusse
    Compact Routing Tables for Graphs of Bounded Genus. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:351-360 [Conf]
  33. Georg Gottlob, Nicola Leone, Francesco Scarcello
    Computing LOGCFL Certificates. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:361-371 [Conf]
  34. Roberto Grossi, Giuseppe F. Italiano
    Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:372-381 [Conf]
  35. Arvind Gupta, Damon Kaller, Thomas C. Shermer
    On the Complements of Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:382-391 [Conf]
  36. Mikael Hammar, Bengt J. Nilsson
    Approximation Results for Kinetic Variants of TSP. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:392-401 [Conf]
  37. Yehuda Hassin, David Peleg
    Distributed Probabilistic Polling and Applications to Proportionate Agreement. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:402-411 [Conf]
  38. Yoram Hirshfeld, Mark Jerrum
    Bisimulation Equivanlence Is Decidable for Normed Process Algebra. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:412-421 [Conf]
  39. Yoram Hirshfeld, Alexander Moshe Rabinovich
    A Framework for Decidable Metrical Logics. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:422-432 [Conf]
  40. Juraj Hromkovic, Georg Schnitger
    On the Power of Las Vegas II. Two-Way Finite Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:433-442 [Conf]
  41. Kazuo Iwama, David Manlove, Shuichi Miyazaki, Yasufumi Morita
    Stable Marriage with Incomplete Lists and Ties. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:443-452 [Conf]
  42. Tao Jiang, Ming Li, Paul M. B. Vitányi
    Average-Case Complexity of Shellsort. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:453-462 [Conf]
  43. Dong Kyue Kim, Kunsoo Park
    Linear-Time Construction of Two-Dimensional Suffix Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:463-472 [Conf]
  44. Daniel Kirsten
    A Connection between the Star Problem and the Finite Power Property in Trace Monoids. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:473-482 [Conf]
  45. Daniel Kirsten, Jerzy Marcinkowski
    Two Techniques in the Area of the Star Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:483-492 [Conf]
  46. Matthias Krause, Petr Savický, Ingo Wegener
    Approximations by OBDDs and the Variable Ordering Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:493-502 [Conf]
  47. Antonín Kucera, Richard Mayr
    Simulation Preorder on Simple Process Algebras. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:503-512 [Conf]
  48. Cosimo Laneve, Björn Victor
    Solos in Concert. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:513-523 [Conf]
  49. Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack
    Shortest Anisotropic Paths on Terrains. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:524-533 [Conf]
  50. Arto Lepistö
    Relations between Local and Global Periodicity of Words. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:534-543 [Conf]
  51. Andrzej Lingas, Hans Olsson, Anna Östlin
    Efficient Merging, Construction, and Maintenance of Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:544-553 [Conf]
  52. Marino Miculan
    Formalizing a Lazy Substitution Proof System for µ-calculus in the Calculus of Inductive Constructions. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:554-564 [Conf]
  53. Codrin M. Nichitiu, Eric Rémila
    Leader Election by d Dimensional Cellular Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:565-574 [Conf]
  54. Rolf Niedermeier, Peter Rossmanith
    New Upper Bounds for MaxSat. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:575-584 [Conf]
  55. Vadim Olshevsky, Victor Y. Pan
    Polynomial and Rational Evaluation and Interpolation (with Structured Matrices). [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:585-594 [Conf]
  56. Rasmus Pagh
    Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:595-604 [Conf]
  57. Timo Peichl, Heribert Vollmer
    Finite Automata with Generalized Acceptance Criteria. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:605-614 [Conf]
  58. David Peleg, Eilon Reshef
    A Variant of the Arrow Distributed Directory with Low Average Complexity. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:615-624 [Conf]
  59. John Power, Hayo Thielecke
    Closed Freyd- and kappa-categories. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:625-634 [Conf]
  60. Jon G. Riecke, Hayo Thielecke
    Typed Exeptions and Continuations Cannot Macro-Express Each Other. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:635-644 [Conf]
  61. Jan J. M. M. Rutten
    Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:645-654 [Conf]
  62. Peter Sanders
    Accessing Multiple Sequences Through Set Associative Caches. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:655-664 [Conf]
  63. Géraud Sénizergues
    T(A) = T(B)? [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:665-675 [Conf]
  64. Mario Szegedy
    Many-Valued Logics and Holographic Proofs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:676-686 [Conf]
  65. Christopher Umans
    On the Complexity and Inapproximability of Shortest Implicant Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:687-696 [Conf]
  66. Klaus Weihrauch, Ning Zhong 0002
    The Wave Propagator Is Turing Computable. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:697-707 [Conf]
  67. Gerhard J. Woeginger
    An FPTAS for Agreeably Weighted Variance on a Single Machine. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:707-716 [Conf]
  68. Alexandre Tiskin
    Erratum: Bulk-synchronous Parallel Multiplication of Boolean Matrices. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:717-718 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002