The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Manuel Blum
    Program Result Checking: A New Approach to Making Programs More Reliable. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:1-14 [Conf]
  2. Arne Andersson, Christer Mattsson
    Dynamic Interpolation Search in o(log log n) Time. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:15-27 [Conf]
  3. Greg N. Frederickson
    Searching among Intervals and Compact Routing Tables. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:28-39 [Conf]
  4. Carsten Lund, Mihalis Yannakakis
    The Approximation of Maximum Subgraph Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:40-51 [Conf]
  5. Viggo Kann
    Polynomially Bounded Minimization Problems which are Hard to Approximate. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:52-63 [Conf]
  6. Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
    Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:64-75 [Conf]
  7. Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi
    The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:76-87 [Conf]
  8. Artur Czumaj, Alan Gibbons
    Problems on Pairs of Trees and the Four Colour Problem of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:88-101 [Conf]
  9. Bala Kalyanasundaram, Kirk Pruhs
    Constructing Competitive Tours From Local Information. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:102-113 [Conf]
  10. Hans L. Bodlaender, Ton Kloks, Dieter Kratsch
    Treewidth and Pathwidth of Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:114-125 [Conf]
  11. Jerzy W. Jaromczyk, Grzegorz Swiatek
    A Theory of Even Functionals and Their Algorithmic Applications. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:126-136 [Conf]
  12. Philippe Flajolet, Mordecai J. Golin
    Exact Asymptotics of Divide-and-Conquer Recurrences. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:137-149 [Conf]
  13. Dexter Kozen, Shmuel Zaks
    Optimal Bounds for the Change-Making Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:150-161 [Conf]
  14. John H. Reif, Stephen R. Tate
    The Complexity of N-body Simulation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:162-176 [Conf]
  15. Michael B. Dillencourt, Warren D. Smith
    A Simple Method for Resolving Degeneracies in Delaunay Triangulations. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:177-188 [Conf]
  16. Lane A. Hemachandra
    Fault-Tolerance and Complexity (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:189-202 [Conf]
  17. Hiroaki Yamamoto
    Reversal-Space Trade-offs For Simultaneous Resource-Bounded Nondeterministic Turing Machines. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:203-214 [Conf]
  18. Pekka Orponen
    On the Computational Power of Discrete Hopfield Nets. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:215-226 [Conf]
  19. Marek Karpinski, Rutger Verbeek
    On Randomized Versus Deterministic Computation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:227-240 [Conf]
  20. Farid M. Ablayev
    Lower Bounds for One-way Probabilistic Communication Complexity. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:241-252 [Conf]
  21. Torben Hagerup, Kurt Mehlhorn, J. Ian Munro
    Maintaining Discrete Probability Distributions Optimally. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:253-264 [Conf]
  22. Matthew K. Franklin, Moti Yung
    Secure and Efficient Off-Line Digital Money (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:265-276 [Conf]
  23. David W. Juedes, James I. Lathrop, Jack H. Lutz
    Computational Depth and Reducibility (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:277-288 [Conf]
  24. Ganesh Baliga, John Case
    Learnability: Admissible, Co-finite, and Hypersimple Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:289-300 [Conf]
  25. Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu
    Inclusion is Undecidable for Pattern Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:301-312 [Conf]
  26. Oscar H. Ibarra, Tao Jiang, Nicholas Q. Trân, Hui Wang
    New Decidability Results Concerning Two-way Counter Machines and Applications. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:313-324 [Conf]
  27. Christian Michaux, Roger Villemaire
    Cobham's Ttheorem seen through Büchi's Theorem. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:325-334 [Conf]
  28. Werner Ebinger, Anca Muscholl
    Logical Definability on Infinite Traces. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:335-346 [Conf]
  29. Thomas Wilke
    Algebras for Classifying Regular Tree Languages and an Application to Frontier Testability. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:347-358 [Conf]
  30. Arvind Gupta
    Finite Automata as Characterizations of Minor Closed Tree Families (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:359-370 [Conf]
  31. Danny Dolev, Dalia Malki
    On Distributed Algorithms in a Broadcast Domain. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:371-387 [Conf]
  32. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
    Sparse Networks Supporting Efficient Reliable Broadcasting. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:388-397 [Conf]
  33. Friedhelm Meyer auf der Heide, Brigitte Oesterdiekhoff, Rolf Wanka
    Strongly Adaptive Token Distribution. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:398-409 [Conf]
  34. Arnold Schönhage
    Fast Parallel Computation of Characteristic Polynomials by Leverrier's POwer Sum Method Adapted to Fields of Finite Characteristic. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:410-417 [Conf]
  35. Lefteris M. Kirousis
    Fast Parallel Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:418-429 [Conf]
  36. Imre Simon
    The Product of Rational Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:430-444 [Conf]
  37. Edward Ochmanski, Pierre-André Wacrenier
    On Regular Compatibility of Semi-Commutations. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:445-456 [Conf]
  38. Philippe Dumas
    Algebraic Aspects of B-regular Series. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:457-468 [Conf]
  39. David M. Cohen, Michael L. Fredman
    Products of Finite State Machines with Full Coverage. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:469-477 [Conf]
  40. Géraud Sénizergues
    An Effective Version of Stallings' Theorem in the Case of Context-Free Groups. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:478-495 [Conf]
  41. Arto Lepistö
    On the Power of Periodic Iteration of Morphisms. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:496-506 [Conf]
  42. Filippo Mignosi, Patrice Séébold
    If a D0L Language is k-Power Free then it is Circular. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:507-518 [Conf]
  43. Lalita Jategaonkar, Albert R. Meyer
    Deciding True Concurrency Equivalences on Finite Sate Nets (Preliminary Report). [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:519-531 [Conf]
  44. Walter Vogler
    Timed Testing of Concurrent Systems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:532-543 [Conf]
  45. Klaus Havelund, Kim Guldstrand Larsen
    The Fork Calculus. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:544-557 [Conf]
  46. Paola Inverardi, Corrado Priami, Daniel Yankelevich
    Extended Transition Systems for Parametric Bisimulation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:558-569 [Conf]
  47. Carolyn Brown, Doug Gurr
    Temporal Logic and Categories of Petrie Nets. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:570-581 [Conf]
  48. Kamal Lodaya, P. S. Thiagarajan
    Decidability of a Partial Order Based Temporal Logic. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:582-592 [Conf]
  49. Hardi Hungar, Bernhard Steffen
    Local Model Checking for Context-Free Processes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:593-605 [Conf]
  50. Serge Abiteboul, Victor Vianu
    Computing on Structures. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:606-620 [Conf]
  51. Evelyne Contejean
    A Partial Solution for D-Unification Based on a Reduction to AC1-Unification. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:621-632 [Conf]
  52. Michael Codish, Moreno Falaschi, Kim Marriott, William H. Winsborough
    Efficient Analysis of Concurrent Constraint Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:633-644 [Conf]
  53. Roberto Di Cosmo, Delia Kesner
    A Confluent Reduction for the Extensional Typed lambda-Calculus with Pairs, Sums, Recursion and terminal Object. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:645-656 [Conf]
  54. Franco Barbanera, Maribel Fernández
    Modularity of Termination and Confluence in Combinations of Rewrite Systems with lambda_omega. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:657-668 [Conf]
  55. Felipe Bracho, Manfred Droste
    From Domains to Automata with Concurrency. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:669-681 [Conf]
  56. Ramarao Kanneganti, Robert Cartwright
    What is a Universal Higher-Order Programming Language? [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:682-695 [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