The SCEAS System
Navigation Menu

Conferences in DBLP

Symposium on the Theory of Computing (STOC) (stoc)
1984 (conf/stoc/STOC16)

  1. Sergiu Hart, Micha Sharir
    Probabilistic Temporal Logics for Finite and Bounded Models [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:1-13 [Conf]
  2. E. Allen Emerson, A. Prasad Sistla
    Deciding Branching Time Logic [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:14-24 [Conf]
  3. Matthew Hennessy
    Modelling Fair Processes [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:25-30 [Conf]
  4. Pierpaolo Degano, Ugo Montanari
    Liveness Properties as Convergence in Metric Spaces [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:31-38 [Conf]
  5. Rob Gerth
    Transition Logic: How to Reason About Temporal Properties in a Compositional Way [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:39-50 [Conf]
  6. Howard Barringer, Ruurd Kuiper, Amir Pnueli
    Now You May Compose Temporal Logic Specifications [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:51-63 [Conf]
  7. Gianfranco Bilardi, Franco P. Preparata
    A Minimum Area VLSI Network for O(log n) Time Sorting [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:64-70 [Conf]
  8. Frank Thomson Leighton
    Tight Bounds on the Complexity of Parallel Sorting [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:71-80 [Conf]
  9. Pavol Duris, Zvi Galil, Georg Schnitger
    Lower Bounds on Communication Complexity [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:81-91 [Conf]
  10. Norbert Blum
    An Area-Maximum Edge Length Tradeoff for VLSI Layout [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:92-97 [Conf]
  11. Jonathan F. Buss, Peter W. Shor
    On the Pagenumber of Planar Graphs [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:98-100 [Conf]
  12. Andranik Mirzaian
    Channel Routing in VLSI (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:101-107 [Conf]
  13. Mark J. Post
    Minimum Spanning Ellipsoids [Citation Graph (1, 0)][DBLP]
    STOC, 1984, pp:108-116 [Conf]
  14. Chul E. Kim, Timothy A. Anderson
    Digital Disks and a Digital Compactness Measure [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:117-124 [Conf]
  15. Bernard Chazelle
    Intersecting Is Easier than Sorting [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:125-134 [Conf]
  16. Harold N. Gabow, Jon Louis Bentley, Robert Endre Tarjan
    Scaling and Related Techniques for Geometry Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:135-143 [Conf]
  17. Micha Sharir, Amir Schorr
    On Shortest Paths in Polyhedral Spaces [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:144-153 [Conf]
  18. Richard Cole, Micha Sharir, Chee-Keng Yap
    On k-hulls and Related Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:154-166 [Conf]
  19. Deborah S. Franzblau, Daniel J. Kleitman
    An Algorithm for Constructing Regions with Rectangles: Independence and Minimum Generating Sets for Collections of Intervals [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:167-174 [Conf]
  20. Ming-Deh A. Huang
    Factorization of Polynomials over Finite Fields and Factorization of Primes in Algebraic Number Fields [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:175-182 [Conf]
  21. Eric Bach, Gary L. Miller, Jeffrey Shallit
    Sums of Divisors, Perfect Numbers, and Factoring (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:183-190 [Conf]
  22. Ravindran Kannan, Arjen K. Lenstra, László Lovász
    Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:191-200 [Conf]
  23. Don Coppersmith
    Evaluating Logarithms in GF(2^n) [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:201-207 [Conf]
  24. H. Ong, Claus-Peter Schnorr, Adi Shamir
    An Efficient Signature Scheme Based on Quadratic Equations [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:208-216 [Conf]
  25. Alon Orlitsky, Abbas El Gamal
    Communication with Secrecy Constraints [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:217-224 [Conf]
  26. Danny Dolev, David Maier, Harry G. Mairson, Jeffrey D. Ullman
    Correcting Faults in Write-Once Memory [Citation Graph (1, 0)][DBLP]
    STOC, 1984, pp:225-229 [Conf]
  27. Uzi Vishkin
    Randomized Speed-Ups in Parallel Computation [Citation Graph (1, 0)][DBLP]
    STOC, 1984, pp:230-239 [Conf]
  28. Zvi Galil
    Optimal Parallel Algorithms for String Matching [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:240-248 [Conf]
  29. Baruch Awerbuch, Amos Israeli, Yossi Shiloach
    Finding Euler Circuits in Logarithmic Parallel Time [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:249-257 [Conf]
  30. Eli Upfal
    A Probabilistic Relation between Desirable and Feasible Models of Parallel Computation (A Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:258-265 [Conf]
  31. Richard M. Karp, Avi Wigderson
    A Fast Parallel Algorithm for the Maximal Independent Set Problem [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:266-272 [Conf]
  32. Udi Manber
    On Maintaining Dynamic Information in a Concurrent Environment (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:273-278 [Conf]
  33. Jon Louis Bentley, David S. Johnson, Frank Thomson Leighton, Catherine C. McGeoch, Lyle A. McGeoch
    Some Unexpected Expected Behavior Results for Bin Packing [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:279-288 [Conf]
  34. Richard M. Karp, Michael Luby, Alberto Marchetti-Spaccamela
    A Probabilistic Analysis of Multidimensional Bin Packing Problems [Citation Graph (1, 0)][DBLP]
    STOC, 1984, pp:289-298 [Conf]
  35. Jeff Kahn, Michael E. Saks
    Every Poset Has a Good Comparison [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:299-301 [Conf]
  36. Narendra Karmarkar
    A New Polynomial-Time Algorithm for Linear Programming [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:302-311 [Conf]
  37. Ilan Adler, Nimrod Megiddo
    A Simplex Algorithm Whose Average Number of Steps is Bounded between Two Quadratic Functions of the Smaller Dimension [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:312-323 [Conf]
  38. Dorit S. Hochbaum, David B. Shmoys
    Powers of Graphs: A Powerful Approximation Technique for Bottleneck Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:324-333 [Conf]
  39. Gaston H. Gonnet
    Determining Equivalence of Expressions in Random Polynomial Time (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:334-341 [Conf]
  40. Kenneth L. Clarkson
    Fast Expected-Time and Approximation Algorithms for Geometric Minimum Spanning Trees (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:342-348 [Conf]
  41. Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell
    Building a Complete Inverted File for a Set of Text Files in Linear Time [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:349-358 [Conf]
  42. Andrew V. Goldberg, Alberto Marchetti-Spaccamela
    On Finding the Exact Solution of a Zero-One Knapsack Problem [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:359-368 [Conf]
  43. Walter Cunto, J. Ian Munro
    Average Case Selection [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:369-375 [Conf]
  44. Gary L. Miller
    Finding Small Simple Cycle Separators for 2-Connected Planar Graphs [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:376-382 [Conf]
  45. Greg N. Frederickson, Mandayam A. Srinivas
    Data Structures for On-Line Updating of Matroid Intersection Solutions (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:383-390 [Conf]
  46. Cees F. Slot, Peter van Emde Boas
    On Tape Versus Core; An Application of Space Efficient Perfect Hash Functions to the Invariance of Space [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:391-400 [Conf]
  47. Wolfgang Maass
    Quadratic Lower Bounds for Deterministic and Nondeterministic One-Tape Turing Machines (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:401-408 [Conf]
  48. Michel de Rougemont
    Uniform Definability on Finite Structures with Successor [Citation Graph (4, 0)][DBLP]
    STOC, 1984, pp:409-417 [Conf]
  49. David Harel
    A General Result on Infinite Trees and Its Applications (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:418-427 [Conf]
  50. Dexter Kozen
    Pebblings, Edgings, and Equational Logic [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:428-435 [Conf]
  51. Leslie G. Valiant
    A Theory of the Learnable [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:436-445 [Conf]
  52. Moshe Y. Vardi, Pierre Wolper
    Automata Theoretic Techniques for Modal Logics of Programs (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:446-456 [Conf]
  53. Michael Ben-Or, Dexter Kozen, John H. Reif
    The Complexity of Elementary Algebra and Geometry (Preliminary Abstract) [Citation Graph (1, 0)][DBLP]
    STOC, 1984, pp:457-464 [Conf]
  54. Leonid A. Levin
    Problems, Complete in ``Average'' Instance [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:465- [Conf]
  55. Helmut Alt
    Comparison of Arithmetic Functions with Respect to Boolean Circuit Depth (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:466-470 [Conf]
  56. Miklós Ajtai, Michael Ben-Or
    A Theorem on Probabilistic Constant Depth Computations [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:471-474 [Conf]
  57. Ravi B. Boppana
    Threshold Functions and Bounded Depth Monotone Circuits [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:475-479 [Conf]
  58. Maria M. Klawe, Wolfgang J. Paul, Nicholas Pippenger, Mihalis Yannakakis
    On Monotone Formulae with Restricted Depth (Preliminary Version) [Citation Graph (1, 0)][DBLP]
    STOC, 1984, pp:480-487 [Conf]
  59. Daniel Dominic Sleator, Robert Endre Tarjan
    Amortized Efficiency of List Update Rules [Citation Graph (1, 0)][DBLP]
    STOC, 1984, pp:488-492 [Conf]
  60. Greg N. Frederickson, Nancy A. Lynch
    The Impact of Synchronous Communication on the Problem of Electing a Leader in a Ring [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:493-503 [Conf]
  61. Danny Dolev, Joseph Y. Halpern, H. Raymond Strong
    On the Possibility and Impossibility of Achieving Clock Synchronization [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:504-511 [Conf]
  62. Dan E. Willard
    Log-Logarithmic Protocols for Resolving Ethernet and Semaphore Conflicts (Preliminary Report) [Citation Graph (1, 0)][DBLP]
    STOC, 1984, pp:512-521 [Conf]
  63. Baruch Awerbuch
    An Efficient Network Synchronization Protocol [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:522-525 [Conf]
  64. Danny Dolev, Joseph Y. Halpern, Barbara Simons, H. Raymond Strong
    A New Look at Fault Tolerant Network Routing [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:526-535 [Conf]
  65. Andrei Z. Broder, Danny Dolev, Michael J. Fischer, Barbara Simons
    Efficient Fault Tolerant Routings in Networks [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:536-541 [Conf]
  66. Paul M. B. Vitányi
    Distributed Elections in an Archimedean Ring of Processors (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:542-547 [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