default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJonathan F. Buss
Person information
- affiliation: University of Waterloo, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c11]Jan Gorzny
, Jonathan F. Buss:
Imbalance, Cutwidth, and the Structure of Optimal Orderings. COCOON 2019: 219-231
2000 – 2009
- 2008
- [j15]Jonathan F. Buss, Tarique Mesbaul Islam:
The complexity of fixed-parameter problems: guest column. SIGACT News 39(1): 33-46 (2008) - 2007
- [j14]Jonathan F. Buss, Tarique Islam:
Algorithms in the W-Hierarchy. Theory Comput. Syst. 41(3): 445-457 (2007) - 2006
- [j13]Jonathan F. Buss, Tarique Islam:
Simplifying the weft hierarchy. Theor. Comput. Sci. 351(3): 303-313 (2006) - 2004
- [c10]Jonathan F. Buss, Tarique Islam:
Simplifying the Weft Hierarchy. IWPEC 2004: 187-199 - 2003
- [j12]Therese Biedl, Jonathan F. Buss, Erik D. Demaine, Martin L. Demaine, Mohammad Taghi Hajiaghayi, Tomás Vinar:
Palindrome recognition using a multidimensional tape. Theor. Comput. Sci. 302(1-3): 475-480 (2003) - 2001
- [j11]Neil Immerman, Jonathan F. Buss, David A. Mix Barrington:
Number of Variables Is Equivalent to Space. J. Symb. Log. 66(3): 1217-1230 (2001)
1990 – 1999
- 1999
- [j10]Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey O. Shallit:
The Computational Complexity of Some Problems of Linear Algebra. J. Comput. Syst. Sci. 58(3): 572-596 (1999) - 1998
- [j9]Prosenjit Bose, Jonathan F. Buss, Anna Lubiw:
Pattern Matching for Permutations. Inf. Process. Lett. 65(5): 277-283 (1998) - [j8]Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith:
Sharply Bounded Alternation and Quasilinear Time. Theory Comput. Syst. 31(2): 187-214 (1998) - [j7]Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo, Baruch Schieber:
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity. SIAM J. Comput. 27(5): 1273-1282 (1998) - 1997
- [c9]Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey O. Shallit:
The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract). STACS 1997: 451-462 - [i2]Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey O. Shallit:
The Computational Complexity of Some Problems of Linear Algebra. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [j6]Jonathan F. Buss, Paris C. Kanellakis, Prabhakar Ragde, Alexander A. Shvartsman:
Parallel Algorithms with Processor Failures and Delays. J. Algorithms 20(1): 45-86 (1996) - [c8]Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith:
Sharply Bounded Alternation within P. DMTCS 1996: 131-146 - [i1]Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith:
Sharply Bounded Alternation within P. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [j5]Jonathan F. Buss, Martin Tompa:
Lower Bounds on Universal Traversal Sequences Based on Chains of Length Five. Inf. Comput. 120(2): 326-329 (1995) - 1994
- [j4]Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith:
How hard are n2-hard problems? SIGACT News 25(2): 83-85 (1994) - 1993
- [j3]Jonathan F. Buss, Judy Goldsmith:
Nondeterminism Within P. SIAM J. Comput. 22(3): 560-572 (1993) - [c7]Prosenjit Bose, Jonathan F. Buss, Anna Lubiw:
Pattern Matching for Permutations. WADS 1993: 200-209 - 1992
- [c6]Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo, Baruch Schieber:
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity. SCT 1992: 27-33 - 1991
- [c5]Jonathan F. Buss, Judy Goldsmith:
Nondterminism Within P. STACS 1991: 348-359 - 1990
- [c4]Jonathan F. Buss:
Processor Networks and Alternating Machines. SPAA 1990: 103-108
1980 – 1989
- 1989
- [j2]Jonathan F. Buss, Arnold L. Rosenberg, Judson D. Knott:
Vertex Types in Book-Embeddings. SIAM J. Discret. Math. 2(2): 156-175 (1989) - 1988
- [j1]Jonathan F. Buss:
Relativized Alternation and Space-Bounded Computation. J. Comput. Syst. Sci. 36(3): 351-378 (1988) - 1987
- [c3]Jonathan F. Buss:
A theory of oracle machines. SCT 1987: 175-181 - 1986
- [c2]Jonathan F. Buss:
Relativized Alternation. SCT 1986: 66-76 - 1984
- [c1]Jonathan F. Buss, Peter W. Shor:
On the Pagenumber of Planar Graphs. STOC 1984: 98-100
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-03 21:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
