The SCEAS System
Navigation Menu

Conferences in DBLP

Symposium on the Theory of Computing (STOC) (stoc)
1991 (conf/stoc/STOC23)

  1. Richard Beigel, Nick Reingold, Daniel A. Spielman
    PP Is Closed Under Intersection (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:1-9 [Conf]
  2. Ker-I Ko
    Integral Equations, Systems of Quadratic Equations, and Exponential-Time Completeness (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:10-20 [Conf]
  3. László Babai, Lance Fortnow, Leonid A. Levin, Mario Szegedy
    Checking Computations in Polylogarithmic Time [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:21-31 [Conf]
  4. Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld, Madhu Sudan, Avi Wigderson
    Self-Testing/Correcting for Polynomials and for Approximate Functions [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:32-42 [Conf]
  5. Greg Barnes, Walter L. Ruzzo
    Deterministic Algorithms for Undirected s-t Connectivity Using Polynomial Time and Sublinear Space (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:43-53 [Conf]
  6. Erich Kaltofen
    Effective Noether Irreducibility Forms and Applications (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:54-63 [Conf]
  7. Leonard M. Adleman
    Factoring Numbers Using Singular Integers [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:64-71 [Conf]
  8. Johannes Buchmann, Victor Shoup
    Constructing Nonresidues in Finite Fields and the Extended Riemann Hypothesis [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:72-79 [Conf]
  9. Alfred Menezes, Scott A. Vanstone, Tatsuaki Okamoto
    Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:80-89 [Conf]
  10. László Babai, Gene Cooperman, Larry Finkelstein, Eugene M. Luks, Ákos Seress
    Fast Monte Carlo Algorithms for Permutation Groups [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:90-100 [Conf]
  11. Frank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, Éva Tardos, Spyros Tragoudas
    Fast Approximation Algorithms for Multicommodity Flow Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:101-111 [Conf]
  12. Harold N. Gabow
    A Matroid Approach to Finding Edge Connectivity and Packing Arborescences [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:112-122 [Conf]
  13. Tomás Feder, Rajeev Motwani
    Clique Partitions, Graph Compression, and Speeding-Up Algorithms [Citation Graph (1, 0)][DBLP]
    STOC, 1991, pp:123-133 [Conf]
  14. Ajit Agrawal, Philip N. Klein, R. Ravi
    When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:134-144 [Conf]
  15. Edith Cohen, Nimrod Megiddo
    Improved Algorithms for Linear Inequalities with Two Variables per Inequality (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:145-155 [Conf]
  16. David Applegate, Ravi Kannan
    Sampling and Integration of Near Log-Concave functions [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:156-163 [Conf]
  17. László Babai
    Local Expansion of Vertex-Transitive Graphs and Random Generation in Finite Groups [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:164-174 [Conf]
  18. Graham Brightwell, Peter Winkler
    Counting Linear Extensions is \#P-Complete [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:175-181 [Conf]
  19. Andrei Z. Broder, Alan M. Frieze, Eli Shamir
    Finding Hidden Hamiltonian Cycles (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:182-189 [Conf]
  20. Richard M. Karp
    Probabilistic Recurrence Relations [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:190-197 [Conf]
  21. Ehud Y. Shapiro
    Separating Concurrent Languages with Categories of Language Embeddings (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:198-208 [Conf]
  22. Serge Abiteboul, Victor Vianu
    Generic Computation and Its Complexity [Citation Graph (31, 0)][DBLP]
    STOC, 1991, pp:209-219 [Conf]
  23. David Harel
    Hamiltonian Paths in Infinite Graphs [Citation Graph (1, 0)][DBLP]
    STOC, 1991, pp:220-229 [Conf]
  24. Edward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Lyle A. McGeoch, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis
    Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:230-240 [Conf]
  25. Edward G. Coffman Jr., M. R. Garey
    Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:241-248 [Conf]
  26. Allan Borodin, Sandy Irani, Prabhakar Raghavan, Baruch Schieber
    Competitive Paging with Locality of Reference (Preliminary Version) [Citation Graph (1, 0)][DBLP]
    STOC, 1991, pp:249-259 [Conf]
  27. Edward F. Grove
    The Harmonic Online K-Server Algorithm Is Competitive [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:260-266 [Conf]
  28. Simon Kahan
    A Model for Data in Motion [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:267-277 [Conf]
  29. Howard J. Karloff, Yuval Rabani, Yiftach Ravid
    Lower Bounds for Randomized k-Server and Motion Planning Algorithms [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:278-288 [Conf]
  30. Xiaotie Deng, Sanjeev Mahajan
    Infinite Games, Randomization, Computability, and Applications to Online Problems (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:289-298 [Conf]
  31. Torben Hagerup
    Constant-Time Parallel Integer Sorting (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:299-306 [Conf]
  32. Yossi Matias, Uzi Vishkin
    Converting High Probability into Nearly-Constant Time-with Applications to Parallel Hashing (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:307-316 [Conf]
  33. Zvi Galil, Giuseppe F. Italiano
    Fully Dynamic Algorithms for Edge-Connectivity Problems (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:317-327 [Conf]
  34. Avrim Blum, Tao Jiang, Ming Li, John Tromp, Mihalis Yannakakis
    Linear Approximation of Shortest Superstrings [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:328-336 [Conf]
  35. Hristo Djidjev, John H. Reif
    An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:337-347 [Conf]
  36. James Aspnes, Maurice Herlihy, Nir Shavit
    Counting Networks and Multi-Processor Coordination [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:348-358 [Conf]
  37. Hagit Attiya, Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer
    Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:359-369 [Conf]
  38. Richard J. Anderson, Heather Woll
    Wait-free Parallel Algorithms for the Union-Find Problem [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:370-380 [Conf]
  39. Zvi M. Kedem, Krishna V. Palem, A. Raghunathan, Paul G. Spirakis
    Combining Tentative and Definite Executions for Very Fast Dependable Parallel Computing (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:381-390 [Conf]
  40. Joseph Cheriyan, Ramakrishna Thurimella
    Algorithms for Parallel k-Vertex Connectivity and Sparse Certificates (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:391-401 [Conf]
  41. James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich
    The Expressive Power of Voting Polynomials [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:402-409 [Conf]
  42. Noam Nisan
    Lower Bounds for Non-Commutative Computation (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:410-418 [Conf]
  43. Noam Nisan, Avi Wigderson
    Rounds in Communication Complexity Revisited [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:419-429 [Conf]
  44. Michael Luby, Boban Velickovic
    On Deterministic Approximation of DNF [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:430-438 [Conf]
  45. Dany Breslauer, Zvi Galil
    A Lower Bound for Parallel String Matching [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:439-443 [Conf]
  46. Dana Angluin, Michael Kharitonov
    When Won't Membership Queries Help? (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:444-454 [Conf]
  47. Eyal Kushilevitz, Yishay Mansour
    Learning Decision Trees Using the Fourier Sprectrum (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:455-464 [Conf]
  48. Nick Littlestone, Philip M. Long, Manfred K. Warmuth
    On-Line Learning of Linear Functions [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:465-475 [Conf]
  49. Mihalis Yannakakis, David Lee
    Testing Finite State Machines (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:476-485 [Conf]
  50. Javed A. Aslam, Aditi Dhagat
    Searching in the Presence of Linearly Bounded Errors (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:486-493 [Conf]
  51. Avrim Blum, Prabhakar Raghavan, Baruch Schieber
    Navigating in Unfamiliar Geometric Terrain (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:494-504 [Conf]
  52. Jirí Matousek
    Approximations and Optimal Geometric Divide-And-Conquer [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:505-511 [Conf]
  53. Ketan Mulmuley
    Hidden Surface Removal with Respect to a Moving View Point [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:512-522 [Conf]
  54. Michael T. Goodrich, Roberto Tamassia
    Dynamic Trees and Dynamic Point Location (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:523-533 [Conf]
  55. Amos Fiat, Moni Naor
    Rigorous Time/Space Tradeoffs for Inverting Functions [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:534-541 [Conf]
  56. Danny Dolev, Cynthia Dwork, Moni Naor
    Non-Malleable Cryptography (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:542-552 [Conf]
  57. Joe Kilian
    A General Completeness Theorem for Two-Party Games [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:553-560 [Conf]
  58. Ueli M. Maurer
    Perfect Cryptographic Security from Partially Independent Channels [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:561-571 [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