The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jonathan F. Buss: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jonathan F. Buss, Paris C. Kanellakis, Prabhakar Ragde, Alexander A. Shvartsman
    Parallel Algorithms with Processor Failures and Delays. [Citation Graph (1, 0)][DBLP]
    J. Algorithms, 1996, v:20, n:1, pp:45-86 [Journal]
  2. Jonathan F. Buss, Judy Goldsmith
    Nondeterminism Within P. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:3, pp:560-572 [Journal]
  3. Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo, Baruch Schieber
    A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:27-33 [Conf]
  4. Jonathan F. Buss
    Relativized Alternation. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:66-76 [Conf]
  5. Jonathan F. Buss, Tarique Islam
    Simplifying the Weft Hierarchy. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:187-199 [Conf]
  6. Jonathan F. Buss
    Processor Networks and Alternating Machines. [Citation Graph (0, 0)][DBLP]
    SPAA, 1990, pp:103-108 [Conf]
  7. Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey Shallit
    The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:451-462 [Conf]
  8. Jonathan F. Buss, Judy Goldsmith
    Nondterminism Within P. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:348-359 [Conf]
  9. Jonathan F. Buss, Peter W. Shor
    On the Pagenumber of Planar Graphs [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:98-100 [Conf]
  10. Prosenjit Bose, Jonathan F. Buss, Anna Lubiw
    Pattern Matching for Permutations. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:200-209 [Conf]
  11. Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
    Sharply Bounded Alternation within P [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:11, pp:- [Journal]
  12. Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey Shallit
    The Computational Complexity of Some Problems of Linear Algebra [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:9, pp:- [Journal]
  13. Jonathan F. Buss, Martin Tompa
    Lower Bounds on Universal Traversal Sequences Based on Chains of Length Five [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:120, n:2, pp:326-329 [Journal]
  14. Prosenjit Bose, Jonathan F. Buss, Anna Lubiw
    Pattern Matching for Permutations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:5, pp:277-283 [Journal]
  15. Jonathan F. Buss
    Relativized Alternation and Space-Bounded Computation. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1988, v:36, n:3, pp:351-378 [Journal]
  16. Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey Shallit
    The Computational Complexity of Some Problems of Linear Algebra. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:3, pp:572-596 [Journal]
  17. Neil Immerman, Jonathan F. Buss, David A. Mix Barrington
    Number of Variables Is Equivalent to Space. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2001, v:66, n:3, pp:1217-1230 [Journal]
  18. Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
    Sharply Bounded Alternation and Quasilinear Time. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:2, pp:187-214 [Journal]
  19. Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo, Baruch Schieber
    A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:5, pp:1273-1282 [Journal]
  20. Jonathan F. Buss, Arnold L. Rosenberg, Judson D. Knott
    Vertex Types in Book-Embeddings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:2, pp:156-175 [Journal]
  21. Therese C. Biedl, Jonathan F. Buss, Erik D. Demaine, Martin L. Demaine, Mohammad Taghi Hajiaghayi, Tomás Vinar
    Palindrome recognition using a multidimensional tape. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:475-480 [Journal]
  22. Jonathan F. Buss, Tarique Islam
    Simplifying the weft hierarchy. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:3, pp:303-313 [Journal]

Search in 0.005secs, Finished in 0.006secs
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