default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn R. Gilbert
John Gilbert 0001
Person information
- affiliation: University of California Santa Barbara, CA, USA
Other persons with the same name
- John Gilbert — disambiguation page
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j44]Ariful Azad
, Oguz Selvitopi, Md Taufique Hussain, John R. Gilbert, Aydin Buluç:
Combinatorial BLAS 2.0: Scaling Combinatorial Algorithms on Distributed-Memory Systems. IEEE Trans. Parallel Distributed Syst. 33(4): 989-1001 (2022)- [p6]Jeremy Kepner, Peter Aaltonen, David A. Bader, Aydin Buluç, Franz Franchetti, John Gilbert, Shana Hutchison, Manoj Kumar, Andrew Lumsdaine, Henning Meyerhenke, Scott McMillan, José E. Moreira, John D. Owens, Carl Yang, Marcin Zalewski, Timothy G. Mattson:
Introduction to GraphBLAS. Massive Graph Analytics 2022: 507-524 - 2021
- [e4]Michael Bender, John Gilbert, Bruce Hendrickson, Blair D. Sullivan:
Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, ACDA 2021, Virtual Conference, July 19-21, 2021. SIAM 2021, ISBN 978-1-61197-683-0 [contents] - [i9]Ariful Azad, Oguz Selvitopi, Md Taufique Hussain, John R. Gilbert, Aydin Buluç:
Combinatorial BLAS 2.0: Scaling combinatorial algorithms on distributed-memory systems. CoRR abs/2106.14402 (2021)
2010 – 2019
- 2018
- [c44]John R. Gilbert:
Graph Algorithms in the Language of Linear Algebra: How Did We Get Here, and Where Do We Go Next? IPDPS Workshops 2018: 268 - [c43]Kevin Deweese, John R. Gilbert:
Evolving Difficult Graphs for Laplacian Solvers. CSC 2018: 35-44 - 2016
- [j43]Kevin Deweese, John R. Gilbert, Erik G. Boman:
Evaluating the Potential of a Dual Randomized Kaczmarz Solver for Laplacian Linear Systems. Informatica (Slovenia) 40(1) (2016) - [c42]Erik G. Boman, Kevin Deweese, John R. Gilbert:
An Empirical Comparison of Graph Laplacian Solvers. ALENEX 2016: 174-188 - [c41]Jeremy Kepner, Peter Aaltonen, David A. Bader, Aydin Buluç, Franz Franchetti, John R. Gilbert, Dylan Hutchison, Manoj Kumar, Andrew Lumsdaine, Henning Meyerhenke, Scott McMillan, Carl Yang, John D. Owens, Marcin Zalewski, Timothy G. Mattson, José E. Moreira:
Mathematical foundations of the GraphBLAS. HPEC 2016: 1-9 - [c40]Kevin Deweese, John R. Gilbert, Gary L. Miller, Richard Peng, Hao Ran Xu, Shen Chen Xu:
An Empirical Study of Cycle Toggling Based Laplacian Solvers. CSC 2016: 33-41 - [i8]Jeremy Kepner, Peter Aaltonen, David A. Bader, Aydin Buluç, Franz Franchetti, John R. Gilbert, Dylan Hutchison, Manoj Kumar, Andrew Lumsdaine, Henning Meyerhenke, Scott McMillan, José E. Moreira, John D. Owens, Carl Yang, Marcin Zalewski, Timothy G. Mattson:
Mathematical Foundations of the GraphBLAS. CoRR abs/1606.05790 (2016) - [i7]Veronika Strnadová-Neeley, Aydin Buluç, John R. Gilbert, Leonid Oliker, Weimin Ouyang:
LiRa: A New Likelihood-Based Similarity Score for Collaborative Filtering. CoRR abs/1608.08646 (2016) - [i6]Kevin Deweese, John R. Gilbert, Gary L. Miller, Richard Peng, Hao Ran Xu, Shen Chen Xu:
An Empirical Study of Cycle Toggling Based Laplacian Solvers. CoRR abs/1609.02957 (2016) - 2015
- [j42]Adam Lugowski, Shoaib Kamil, Aydin Buluç, Samuel Williams, Erika Duriakova, Leonid Oliker, Armando Fox, John R. Gilbert:
Parallel processing of filtered queries in attributed semantic graphs. J. Parallel Distributed Comput. 79-80: 115-131 (2015) - [j41]Aydin Buluç, Leonid Oliker, John R. Gilbert:
Special issue "Graph analysis for scientific discovery". Parallel Comput. 47: 1-2 (2015) - [c39]Veronika Strnadová-Neeley, Aydin Buluç, Jarrod Chapman, John R. Gilbert, Joseph Gonzalez, Leonid Oliker:
Efficient data reduction for large-scale genetic mapping. BCB 2015: 126-135 - [c38]Jeremy Kepner, David A. Bader, Aydin Buluç, John R. Gilbert, Timothy G. Mattson, Henning Meyerhenke:
Graphs, Matrices, and the GraphBLAS: Seven Good Reasons. ICCS 2015: 2453-2462 - [c37]Ariful Azad, Aydin Buluç, John R. Gilbert:
Parallel Triangle Counting and Enumeration Using Matrix Algebra. IPDPS Workshops 2015: 804-811 - [i5]Jeremy Kepner, David A. Bader, Aydin Buluç, John R. Gilbert, Timothy G. Mattson, Henning Meyerhenke:
Graphs, Matrices, and the GraphBLAS: Seven Good Reasons. CoRR abs/1504.01039 (2015) - [i4]Erik G. Boman, Kevin Deweese, John R. Gilbert:
Evaluating the Potential of a Laplacian Linear Solver. CoRR abs/1505.00875 (2015) - 2014
- [c36]Veronika Strnadova, Aydin Buluç, Jarrod Chapman, John R. Gilbert, Joseph Gonzalez, Stefanie Jegelka, Daniel Rokhsar, Leonid Oliker:
Efficient and accurate clustering for large-scale genetic mapping. BIBM 2014: 3-10 - [c35]Robert W. Techentin, Barry K. Gilbert, Adam Lugowski, Kevin Deweese, John R. Gilbert, Eric Dull, Mike Hinchey, Steven P. Reinhardt:
Implementing Iterative Algorithms with SPARQL. EDBT/ICDT Workshops 2014: 216-223 - [c34]Tim Mattson, David A. Bader, Aydin Buluç, John R. Gilbert, Joseph Gonzalez, Jeremy Kepner:
GABB Introduction. IPDPS Workshops 2014: 1135-1137 - [i3]Tim Mattson, David A. Bader, Jonathan W. Berry, Aydin Buluç, Jack J. Dongarra, Christos Faloutsos, John Feo, John R. Gilbert, Joseph Gonzalez, Bruce Hendrickson, Jeremy Kepner, Charles E. Leiserson, Andrew Lumsdaine, David A. Padua, Stephen W. Poole, Steven P. Reinhardt, Mike Stonebraker, Steve Wallach, Andrew Yoo:
Standards for Graph Algorithm Primitives. CoRR abs/1408.0393 (2014) - 2013
- [c33]Tim Mattson, David A. Bader, Jonathan W. Berry, Aydin Buluç, Jack J. Dongarra, Christos Faloutsos, John Feo, John R. Gilbert, Joseph Gonzalez, Bruce Hendrickson, Jeremy Kepner, Charles E. Leiserson, Andrew Lumsdaine, David A. Padua, Stephen Poole, Steven P. Reinhardt, Mike Stonebraker, Steve Wallach, Andrew Yoo:
Standards for graph algorithm primitives. HPEC 2013: 1-2 - [c32]Aydin Buluç, Erika Duriakova, Armando Fox, John R. Gilbert, Shoaib Kamil, Adam Lugowski, Leonid Oliker, Samuel Williams:
High-Productivity and High-Performance Analysis of Filtered Semantic Graphs. IPDPS 2013: 237-248 - 2012
- [j40]Aydin Buluç, John R. Gilbert:
Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments. SIAM J. Sci. Comput. 34(4) (2012) - [c31]Aydin Buluç, Armando Fox, John R. Gilbert, Shoaib Kamil, Adam Lugowski, Leonid Oliker, Samuel Williams:
High-performance analysis of filtered semantic graphs. PACT 2012: 463-464 - [c30]Adam Lugowski, Aydin Buluç, John R. Gilbert, Steven P. Reinhardt:
Scalable complex graph analysis with the knowledge discovery toolbox. ICASSP 2012: 5345-5348 - [c29]Adam Lugowski, David M. Alber, Aydin Buluç, John R. Gilbert, Steven P. Reinhardt, Yun Teng, Andrew Waranis:
A Flexible Open-Source Toolbox for Scalable Complex Graph Analysis. SDM 2012: 930-941 - 2011
- [j39]Aydin Buluç, John R. Gilbert:
The Combinatorial BLAS: design, implementation, and applications. Int. J. High Perform. Comput. Appl. 25(4): 496-509 (2011) - [p5]Eric Robinson, Jeremy Kepner, John R. Gilbert:
Linear Algebraic Notation and Definitions. Graph Algorithms in the Language of Linear Algebra 2011: 13-18 - [p4]Viral B. Shah, John R. Gilbert, Steve P. Reinhardt:
Some Graph Algorithms in an Array-Based Language. Graph Algorithms in the Language of Linear Algebra 2011: 29-43 - [p3]Aydin Buluç, John R. Gilbert, Viral B. Shah:
Implementing Sparse Matrices for Graph Algorithms. Graph Algorithms in the Language of Linear Algebra 2011: 287-313 - [p2]Aydin Buluç, John R. Gilbert:
New Ideas in Sparse Matrix Matrix Multiplication. Graph Algorithms in the Language of Linear Algebra 2011: 315-337 - [p1]Jeremy Kepner, David A. Bader, Robert Bond, Nadya T. Bliss, Christos Faloutsos, Bruce Hendrickson, John R. Gilbert, Eric Robinson:
Fundamental Questions in the Analysis of Large Graphs. Graph Algorithms in the Language of Linear Algebra 2011: 353-357 - [e3]Jeremy Kepner, John R. Gilbert:
Graph Algorithms in the Language of Linear Algebra. Software, environments, tools 22, SIAM 2011, ISBN 978-0-89871-990-1 [contents] - [r1]Xiaoye Sherry Li, James Demmel, John R. Gilbert, Laura Grigori, Meiyue Shao:
SuperLU. Encyclopedia of Parallel Computing 2011: 1955-1962 - [i2]Aydin Buluç, John R. Gilbert:
Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments. CoRR abs/1109.3739 (2011) - 2010
- [j38]Aydin Buluç, John R. Gilbert, Ceren Budak:
Solving path problems on the GPU. Parallel Comput. 36(5-6): 241-253 (2010) - [i1]Aydin Buluç, John R. Gilbert:
Highly Parallel Sparse Matrix-Matrix Multiplication. CoRR abs/1006.2183 (2010)
2000 – 2009
- 2009
- [j37]Stefan Karpinski, Elizabeth M. Belding, Kevin C. Almeroth, John R. Gilbert:
Linear Representation of Network Traffic. Mob. Networks Appl. 14(4): 368-386 (2009) - [c28]Aydin Buluç, Jeremy T. Fineman, Matteo Frigo, John R. Gilbert, Charles E. Leiserson:
Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks. SPAA 2009: 233-244 - 2008
- [j36]John R. Gilbert, Steven P. Reinhardt, Viral B. Shah:
Distributed Sparse Matrices for Very High Level Languages. Adv. Comput. 72: 225-252 (2008) - [j35]John R. Gilbert, Steven P. Reinhardt, Viral B. Shah:
A Unified Framework for Numerical and Combinatorial Computing. Comput. Sci. Eng. 10(2): 20-25 (2008) - [j34]Lorin Hochstein, Victor R. Basili, Uzi Vishkin, John Gilbert:
A pilot study to compare programming effort for two parallel programming models. J. Syst. Softw. 81(11): 1920-1930 (2008) - [j33]Laura Grigori, John R. Gilbert, Michel Cosnard:
Symbolic and Exact Structure Prediction for Sparse Gaussian Elimination with Partial Pivoting. SIAM J. Matrix Anal. Appl. 30(4): 1520-1545 (2008) - [c27]Lamia Youseff, Alethea B. T. Barbaro, Peterson F. Trethewey, Björn Birnir, John R. Gilbert:
Parallel Modeling of Fish Interaction. CSE 2008: 234-241 - [c26]Aydin Buluç, John R. Gilbert:
Challenges and Advances in Parallel Sparse Matrix-Matrix Multiplication. ICPP 2008: 503-510 - [c25]Aydin Buluç, John R. Gilbert:
On the representation and multiplication of hypersparse matrices. IPDPS 2008: 1-11 - [c24]Imran Patel, John R. Gilbert:
An empirical study of the performance and productivity of two parallel programming models. IPDPS 2008: 1-7 - 2007
- [c23]John R. Gilbert, Viral B. Shah, Steven P. Reinhardt:
An Interactive Environment to Manipulate Large Graphs. ICASSP (4) 2007: 1201-1204 - 2006
- [j32]Yi-Ju Li, Puting Xu, Xuejun Qin, Donald E. Schmechel, Christine M. Hulette, Jonathan L. Haines, Margaret A. Pericak-Vance, John R. Gilbert:
A comparative analysis of the information content in long and short SAGE libraries. BMC Bioinform. 7: 504 (2006) - [j31]Marshall W. Bern, John R. Gilbert, Bruce Hendrickson, Nhat Nguyen, Sivan Toledo:
Support-Graph Preconditioners. SIAM J. Matrix Anal. Appl. 27(4): 930-951 (2006) - [c22]John R. Gilbert, Steven P. Reinhardt, Viral B. Shah:
High-Performance Graph Algorithms from Parallel Sparse Matrices. PARA 2006: 260-269 - 2004
- [j30]Timothy A. Davis, John R. Gilbert, Stefan I. Larimore, Esmond G. Ng:
A column approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30(3): 353-376 (2004) - [j29]Timothy A. Davis, John R. Gilbert, Stefan I. Larimore, Esmond G. Ng:
Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30(3): 377-380 (2004) - [c21]Viral B. Shah, John R. Gilbert:
Sparse Matrices in Matlab*P: Design and Implementation. HiPC 2004: 144-155 - 2003
- [j28]John R. Gilbert, Laura Grigori:
A Note on the Column Elimination Tree. SIAM J. Matrix Anal. Appl. 25(1): 143-151 (2003) - 2000
- [j27]John R. Gilbert, Sivan Toledo:
An Assessment of Incomplete-LU Preconditioners for Nonsymmetric Linear Systems. Informatica (Slovenia) 24(3) (2000)
1990 – 1999
- 1999
- [j26]Hristo N. Djidjev, John R. Gilbert:
Separators in Graphs with Negative and Multiple Vertex Weights. Algorithmica 23(1): 57-71 (1999) - [j25]James Weldon Demmel, Stanley C. Eisenstat, John R. Gilbert, Xiaoye S. Li, Joseph W. H. Liu:
A Supernodal Approach to Sparse Partial Pivoting. SIAM J. Matrix Anal. Appl. 20(3): 720-755 (1999) - [j24]James Weldon Demmel, John R. Gilbert, Xiaoye S. Li:
An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination. SIAM J. Matrix Anal. Appl. 20(4): 915-952 (1999) - [c20]Kristofer S. J. Pister, Albert P. Pisano, Nicholas Swart, Mike Horton, John Rychcik, John R. Gilbert, Gerry K. Fedder:
MEMS CAD Beyond Multi-Million Transistors (Panel). DAC 1999: 535-536 - [c19]Bartlomiej F. Romanowicz, M. Hasan Zaman, S. F. Bart, V. L. Rabinovich, I. Tchertkov, C. Hsu, John R. Gilbert:
A Methodology and Associated CAD Tools for Support of Concurrent Design of MEMS. VLSI 1999: 636-648 - [c18]Tzu-Yi Chen, John R. Gilbert, Sivan Toledo:
Toward an Efficient Column Minimum Degree Code for Symmetric Multiprocessors. PP 1999 - [c17]John R. Gilbert, Sivan Toledo:
High-Performance Out-of-Core Sparse LU Factorization. PP 1999 - 1998
- [j23]John R. Gilbert:
Integrating CAD Tools for MEMS Design. Computer 31(4): 99-101 (1998) - [j22]John R. Gilbert, Gary L. Miller, Shang-Hua Teng:
Geometric Mesh Partitioning: Implementation and Experiments. SIAM J. Sci. Comput. 19(6): 2091-2110 (1998) - [c16]John R. Gilbert:
Combinatorial Preconditioning for Sparse Linear Systems. IRREGULAR 1998: 1-4 - 1997
- [c15]John Irwin, Jean-Marc Loingtier, John R. Gilbert, Gregor Kiczales, John Lamping, Anurag Mendhekar, Tatiana Shpeisman:
Aspect-Oriented Programming of Sparse Matrix Code. ISCOPE 1997: 249-256 - 1996
- [j21]Thomas J. Sheffler, Robert Schreiber, William W. Pugh, John R. Gilbert, Siddhartha Chatterjee:
Efficient Distribution Analysis via Graph Contraction. Int. J. Parallel Program. 24(6): 599-620 (1996) - [j20]Siddhartha Chatterjee, John R. Gilbert, Leonid Oliker, Robert Schreiber, Thomas J. Sheffler:
Algorithms for Automatic Alignment of Arrays. J. Parallel Distributed Comput. 38(2): 145-157 (1996) - 1995
- [j19]Hans L. Bodlaender, John R. Gilbert, Hjálmtyr Hafsteinsson, Ton Kloks:
Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree. J. Algorithms 18(2): 238-255 (1995) - [j18]Siddhartha Chatterjee, John R. Gilbert, Fred J. E. Long, Robert Schreiber, Shang-Hua Teng:
Generating Local Address and Communication Sets for Data-Parallel Programs. J. Parallel Distributed Comput. 26(1): 72-84 (1995) - [j17]Siddhartha Chatterjee, John R. Gilbert, Robert Schreiber, Shang-Hua Teng:
Optimal Evaluation of Array Expressions on Massively Parallel Machines. ACM Trans. Program. Lang. Syst. 17(1): 123-156 (1995) - [c14]John R. Gilbert, Gary L. Miller, Shang-Hua Teng:
Geometric mesh partitioning: implementation and experiments. IPPS 1995: 418-427 - [c13]Thomas J. Sheffler, Robert Schreiber, William W. Pugh, John R. Gilbert, Siddhartha Chatterjee:
Efficient Distribution Analysis via Graph Contraction. LCPC 1995: 377-391 - [e2]David H. Bailey, Petter E. Bjørstad, John R. Gilbert, Michael Mascagni, Robert S. Schreiber, Horst D. Simon, Virginia Torczon, Layne T. Watson:
Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientific Computing, PP 1995, San Francisco, California, USA, February 15-17, 1995. SIAM 1995, ISBN 0-89871-344-7 [contents] - 1994
- [j16]Marshall W. Bern, David Eppstein, John R. Gilbert:
Provably Good Mesh Generation. J. Comput. Syst. Sci. 48(3): 384-409 (1994) - [j15]John R. Gilbert:
Predicting Structure in Sparse Matrix Computations. SIAM J. Matrix Anal. Appl. 15(1): 62-79 (1994) - [j14]John R. Gilbert, Esmond G. Ng, Barry W. Peyton:
An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization. SIAM J. Matrix Anal. Appl. 15(4): 1075-1091 (1994) - [c12]Siddhartha Chatterjee, Robert Schreiber, Thomas J. Sheffler, John R. Gilbert:
Array Distribution in Data-Parallel Programs. LCPC 1994: 76-91 - 1993
- [j13]John R. Gilbert, Joseph W. H. Liu:
Elimination Structures for Unsymmetric Sparse $LU$ Factors. SIAM J. Matrix Anal. Appl. 14(2): 334-352 (1993) - [c11]Siddhartha Chatterjee, John R. Gilbert, Robert Schreiber:
The Alignment-Distribution Graph. LCPC 1993: 234-252 - [c10]Siddhartha Chatterjee, John R. Gilbert, Robert Schreiber, Shang-Hua Teng:
Automatic Array Alignment in Data-Parallel Programs. POPL 1993: 16-28 - [c9]Siddhartha Chatterjee, John R. Gilbert, Fred J. E. Long, Robert Schreiber, Shang-Hua Teng:
Generating Local Address and Communication Sets for Data-Parallel Programs. PPoPP 1993: 149-158 - [c8]Siddhartha Chatterjee, John R. Gilbert, Robert Schreiber:
Mobile and replicated alignment of arrays in data-parallel programs. SC 1993: 420-429 - 1992
- [j12]Marshall W. Bern, John R. Gilbert:
Drawing the Planar Dual. Inf. Process. Lett. 43(1): 7-13 (1992) - [j11]John R. Gilbert, Cleve Moler, Robert Schreiber:
Sparse Matrices in MATLAB: Design and Implementation. SIAM J. Matrix Anal. Appl. 13(1): 333-356 (1992) - [j10]John R. Gilbert, Robert Schreiber:
Highly Parallel Sparse Cholesky Factorization. SIAM J. Sci. Comput. 13(5): 1151-1172 (1992) - [c7]Siddhartha Chatterjee, John R. Gilbert, Robert Schneider, Shang-Hua Teng:
Optimal Evaluation of Array Expressions on Massively Parallel Machines (Extended Abstract). SIGPLAN Workshop 1992: 68-71 - 1991
- [j9]John R. Gilbert, Robert Schreiber:
Optimal Expression Evaluation for Data Parallel Architectures. J. Parallel Distributed Comput. 13(1): 58-64 (1991) - [c6]John R. Gilbert, Robert Schreiber:
Optimal Data Placement for Distributed Memory Architectures. PP 1991: 462-471 - [c5]Hans L. Bodlaender, John R. Gilbert, Ton Kloks, Hjálmtyr Hafsteinsson:
Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height. WG 1991: 1-12 - 1990
- [j8]John R. Gilbert, Hjálmtyr Hafsteinsson:
Parallel symbolic factorization of sparse linear systems. Parallel Comput. 14(2): 151-162 (1990) - [c4]Marshall W. Bern, David Eppstein, John R. Gilbert:
Provably Good Mesh Generation. FOCS 1990: 231-241 - [e1]John R. Gilbert, Rolf G. Karlsson:
SWAT 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 11-14, 1990, Proceedings. Lecture Notes in Computer Science 447, Springer 1990, ISBN 3-540-52846-6 [contents]
1980 – 1989
- 1988
- [j7]John R. Gilbert:
Some Nested Dissection Order is Nearly Optimal. Inf. Process. Lett. 26(6): 325-328 (1988) - [j6]Earl Zmijewski, John R. Gilbert:
A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor. Parallel Comput. 7(2): 199-210 (1988) - [c3]John R. Gilbert, Hjálmtyr Hafsteinsson:
Parallel Solution of Space Linear Systems. SWAT 1988: 145-153 - 1987
- [j5]John R. Gilbert, Earl Zmijewski:
A parallel graph partitioning algorithm for a message-passing multiprocessor. Int. J. Parallel Program. 16(6): 427-449 (1987) - [c2]John R. Gilbert, Earl Zmijewski:
A Parallel Graph Partitioning Algorithm for a Message-Passing Multiprocessor. ICS 1987: 498-513 - 1986
- [j4]Thomas F. Coleman, Anders Edenbrandt, John R. Gilbert:
Predicting fill for sparse orthogonal factorization. J. ACM 33(3): 517-532 (1986) - 1984
- [j3]John R. Gilbert, Joan P. Hutchinson, Robert Endre Tarjan:
A Separator Theorem for Graphs of Bounded Genus. J. Algorithms 5(3): 391-407 (1984) - 1980
- [j2]John R. Gilbert, Thomas Lengauer, Robert Endre Tarjan:
The Pebbling Problem is Complete in Polynomial Space. SIAM J. Comput. 9(3): 513-524 (1980) - [j1]John R. Gilbert:
A Note on the NP-Completeness of Vertex Elimination on Directed Graphs. SIAM J. Algebraic Discret. Methods 1(3): 292-294 (1980)
1970 – 1979
- 1979
- [c1]John R. Gilbert, Thomas Lengauer, Robert Endre Tarjan:
The Pebbling Problem is Complete in Polynomial Space. STOC 1979: 237-248
Coauthor Index
Steven P. Reinhardt
aka: Steve P. Reinhardt
aka: Steve P. Reinhardt
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-10-07 21:23 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:
