The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Pavel Pudlák
    Unexpected Upper Bounds on the Complexity of Some Communication Games. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:1-10 [Conf]
  2. Henning Fernau, Ludwig Staiger
    Valuations and Unambiguity of Languages, with Applications to Fractal Geometry. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:11-22 [Conf]
  3. Hava T. Siegelmann
    On The Computational Power of Probabilistic and Faulty Neural Networks. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:23-34 [Conf]
  4. Karlis Cerans
    Deciding Properties of Integral Relational Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:35-46 [Conf]
  5. Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
    On the Cost of Recomputing: Tight Bounds on Pebbling with Faults. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:47-58 [Conf]
  6. Eugene Asarin, Oded Maler
    On some Relations between Dynamical Systems and Transition Systems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:59-72 [Conf]
  7. Noa Globerman, David Harel
    Complexity Results for Multi-Pebble Automata and their Logics. [Citation Graph (1, 0)][DBLP]
    ICALP, 1994, pp:73-82 [Conf]
  8. Paris C. Kanellakis, Gerd G. Hillebrand, Harry G. Mairson
    An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction. [Citation Graph (1, 0)][DBLP]
    ICALP, 1994, pp:83-105 [Conf]
  9. Marc Gyssens, Jan Van den Bussche, Dirk Van Gucht
    Expressiveness of Efficient Semi-Deterministic Choice Constructs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:106-117 [Conf]
  10. Erich Grädel, Yuri Gurevich
    Tailoring Recursing for Complexity. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:118-129 [Conf]
  11. Nils Klarlund, Madhavan Mukund, Milind A. Sohoni
    Determinizing Asynchronous Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:130-141 [Conf]
  12. Anca Muscholl
    On the Complementation of Büchi Asynchronous Cellular Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:142-153 [Conf]
  13. Flavio Corradini, Rocco De Nicola
    Distribution and Locality of Concurrent Systems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:154-165 [Conf]
  14. Rainer Gawlick, Roberto Segala, Jørgen F. Søgaard-Andersen, Nancy A. Lynch
    Liveness in Timed and Untimed Systems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:166-177 [Conf]
  15. José-Ramón Sánchez-Couso, María-Inés Fernández-Camacho
    Average-Case Analysis of Pattern-Matching in Trees under the BST Probability Model. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:178-190 [Conf]
  16. Tao Jiang, Ming Li
    On the Approximation of Shortest Common Supersequences and Longest Common Subsequences. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:191-202 [Conf]
  17. Ramesh Hariharan, S. Muthukrishnan
    Optimal Parallel Algorithms for Prefix Matching. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:203-214 [Conf]
  18. Amihood Amir, Gary Benson, Martin Farach
    Optimal Two-Dimensional Compressed Matching. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:215-226 [Conf]
  19. Giuseppe F. Italiano, Rajiv Ramaswami
    Maintaining Spanning Trees of Small Diameter. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:227-238 [Conf]
  20. Joseph Gil, Yossi Matias
    Simple Fast Parallel Hashing. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:239-250 [Conf]
  21. Teresa M. Przytycka, Lawrence L. Larmore
    The Optimal Alphabetic Tree Problem Revisited. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:251-262 [Conf]
  22. Harry Buhrman, Leen Torenvliet
    On the Cutting Edge of Relativization: The Resource Bounded Injury Method. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:263-273 [Conf]
  23. Jean-Camille Birget, Stuart W. Margolis, John C. Meakin, Pascal Weil
    PSPACE-Completeness of Certain Algorithmic Problems on the Subgroups of Free Groups. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:274-285 [Conf]
  24. Matthew Hennessy
    Higher-Order Process and Their Models. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:286-303 [Conf]
  25. Bart Vergauwen, Johan Lewi
    Efficient Local Correctness Checking for Single and Alternating Boolean Equation Systems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:304-315 [Conf]
  26. Parosh Aziz Abdulla, Bengt Jonsson
    Undecidable Verification Problems for Programs with Unreliable Channels. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:316-327 [Conf]
  27. Limor Fix, Fred B. Schneider
    Reasoning about Programs by Exploiting the Environment. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:328-339 [Conf]
  28. Torben Braüner
    A Model of Intuitionistic Affine Logic From Stable Domain Theory. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:340-351 [Conf]
  29. Gordon D. Plotkin, Glynn Winskel
    Bistructures, Bidomains and Linear Logic. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:352-363 [Conf]
  30. Adnan Aziz, Vigyan Singhal, Felice Balarin, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli
    Equivalences for Fair Kripke Structures. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:364-375 [Conf]
  31. Franck van Breugel
    Generalized Finiteness Conditions of Labelled Transition Systems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:376-387 [Conf]
  32. Manfred Droste
    A KLeene Theorem for Recognizable Languages over Concurrency Monoids. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:388-399 [Conf]
  33. Helmut Seidl
    Least Solutions of Equations over N. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:400-411 [Conf]
  34. Günter Hotz, Gisela Pitsch
    Fast Uniform Analysis of Coupled-Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:412-423 [Conf]
  35. Jean-Eric Pin
    Polynomial Closure of Group Languages and Open Sets of the Hall Topology. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:424-435 [Conf]
  36. Anne-Cécile Caron, Hubert Comon, Jean-Luc Coquidé, Max Dauchet, Florent Jacquemard
    Pumping, Cleaning and Symbolic Constraints Solving. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:436-449 [Conf]
  37. Claus Hintermeier, Claude Kirchner, Hélène Kirchner
    Dynamically-Typed Computations for Order-Sorted Equational Presentations. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:450-461 [Conf]
  38. Roberto Di Cosmo, Delia Kesner
    Combining First Order Algebraic Rewriting Systems, Recursion and Extensional Lambda Calculi. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:462-472 [Conf]
  39. Eli Upfal
    On the Theory of Interconnection Networks for Parallel Computers. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:473-486 [Conf]
  40. Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
    Multiway Cuts in Directed and Node Weighted Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:487-498 [Conf]
  41. Uriel Feige
    A Fast Randomized LOGSPACE Algorithm for Graph Connectivity. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:499-507 [Conf]
  42. Sotiris E. Nikoletseas, Krishna V. Palem, Paul G. Spirakis, Moti Yung
    Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:508-519 [Conf]
  43. Jens Lagergren
    The Size of an Interwine. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:520-531 [Conf]
  44. Raphael Yuster, Uri Zwick
    Finding Even Cycles Even Faster. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:532-543 [Conf]
  45. Franz Höfting, Egon Wanke
    Polynomial Time Analysis of Torodial Periodic Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:544-555 [Conf]
  46. Paola Bonizzoni
    A Tight Lower Bound for Primitivity in k-Structures. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:556-567 [Conf]
  47. Carlo Blundo, Alfredo De Santis, Ugo Vaccaro
    Randomness in Distributed Protocols. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:568-579 [Conf]
  48. Rusins Freivalds, Marek Karpinski
    Lower Space Bounds for Randomized Computation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:580-592 [Conf]
  49. Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer, Stephan Weis
    The Average Case Complexity of the Parallel Prefix Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:593-604 [Conf]
  50. Mordecai J. Golin, Neal E. Young
    Prefix Codes: Equiprobable Words, Unequal Letter Costs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:605-617 [Conf]
  51. C. Greg Plaxton, Torsten Suel
    A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:618-629 [Conf]
  52. Aohan Mei, Yoshihide Igarashi
    Efficient Strategies for Robot Navigation in Unknown Environment. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:630-641 [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