The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

John R. Gilbert: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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). [Citation Graph (0, 0)][DBLP]
    DAC, 1999, pp:535-536 [Conf]
  2. Marshall W. Bern, David Eppstein, John R. Gilbert
    Provably Good Mesh Generation [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:231-241 [Conf]
  3. Viral Shah, John R. Gilbert
    Sparse Matrices in Matlab*P: Design and Implementation. [Citation Graph (0, 0)][DBLP]
    HiPC, 2004, pp:144-155 [Conf]
  4. John R. Gilbert, Earl Zmijewski
    A Parallel Graph Partitioning Algorithm for a Message-Passing Multiprocessor. [Citation Graph (0, 0)][DBLP]
    ICS, 1987, pp:498-513 [Conf]
  5. B. F. Romanowicz, M. H. 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. [Citation Graph (0, 0)][DBLP]
    VLSI, 1999, pp:636-648 [Conf]
  6. John R. Gilbert, Gary L. Miller, Shang-Hua Teng
    Geometric mesh partitioning: implementation and experiments. [Citation Graph (0, 0)][DBLP]
    IPPS, 1995, pp:418-427 [Conf]
  7. John R. Gilbert
    Combinatorial Preconditioning for Sparse Linear Systems. [Citation Graph (0, 0)][DBLP]
    IRREGULAR, 1998, pp:1-4 [Conf]
  8. John Irwin, Jean-Marc Loingtier, John R. Gilbert, Gregor Kiczales, John Lamping, Anurag Mendhekar, Tatiana Shpeisman
    Aspect-Oriented Programming of Sparse Matrix Code. [Citation Graph (0, 0)][DBLP]
    ISCOPE, 1997, pp:249-256 [Conf]
  9. Siddhartha Chatterjee, John R. Gilbert, Robert Schreiber
    The Alignment-Distribution Graph. [Citation Graph (0, 0)][DBLP]
    LCPC, 1993, pp:234-252 [Conf]
  10. Siddhartha Chatterjee, Robert Schreiber, Thomas J. Sheffler, John R. Gilbert
    Array Distribution in Data-Parallel Programs. [Citation Graph (0, 0)][DBLP]
    LCPC, 1994, pp:76-91 [Conf]
  11. Thomas J. Sheffler, Robert Schreiber, William Pugh, John R. Gilbert, Siddhartha Chatterjee
    Efficient Distribution Analysis via Graph Contraction. [Citation Graph (0, 0)][DBLP]
    LCPC, 1995, pp:377-391 [Conf]
  12. Siddhartha Chatterjee, John R. Gilbert, Robert Schreiber, Shang-Hua Teng
    Automatic Array Alignment in Data-Parallel Programs. [Citation Graph (0, 0)][DBLP]
    POPL, 1993, pp:16-28 [Conf]
  13. Siddhartha Chatterjee, John R. Gilbert, Fred J. E. Long, Robert Schreiber, Shang-Hua Teng
    Generating Local Address and Communication Sets for Data-Parallel Programs. [Citation Graph (0, 0)][DBLP]
    PPOPP, 1993, pp:149-158 [Conf]
  14. Tzu-Yi Chen, John R. Gilbert, Sivan Toledo
    Toward an Efficient Column Minimum Degree Code for Symmetric Multiprocessors. [Citation Graph (0, 0)][DBLP]
    PPSC, 1999, pp:- [Conf]
  15. John R. Gilbert, Robert Schreiber
    Optimal Data Placement for Distributed Memory Architectures. [Citation Graph (0, 0)][DBLP]
    PPSC, 1991, pp:462-471 [Conf]
  16. John R. Gilbert, Sivan Toledo
    High-Performance Out-of-Core Sparse LU Factorization. [Citation Graph (0, 0)][DBLP]
    PPSC, 1999, pp:- [Conf]
  17. Siddhartha Chatterjee, John R. Gilbert, Robert Schreiber
    Mobile and replicated alignment of arrays in data-parallel programs. [Citation Graph (0, 0)][DBLP]
    SC, 1993, pp:420-429 [Conf]
  18. Siddhartha Chatterjee, John R. Gilbert, Robert Schneider, Shang-Hua Teng
    Optimal Evaluation of Array Expressions on Massively Parallel Machines (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SIGPLAN Workshop, 1992, pp:68-71 [Conf]
  19. John R. Gilbert, Thomas Lengauer, Robert Endre Tarjan
    The Pebbling Problem is Complete in Polynomial Space [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:237-248 [Conf]
  20. John R. Gilbert, Hjálmtyr Hafsteinsson
    Parallel Solution of Space Linear Systems. [Citation Graph (0, 0)][DBLP]
    SWAT, 1988, pp:145-153 [Conf]
  21. Hans L. Bodlaender, John R. Gilbert, Ton Kloks, Hjálmtyr Hafsteinsson
    Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height. [Citation Graph (0, 0)][DBLP]
    WG, 1991, pp:1-12 [Conf]
  22. Hristo Djidjev, John R. Gilbert
    Separators in Graphs with Negative and Multiple Vertex Weights. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:23, n:1, pp:57-71 [Journal]
  23. John R. Gilbert
    Integrating CAD Tools for MEMS Design. [Citation Graph (0, 0)][DBLP]
    IEEE Computer, 1998, v:31, n:4, pp:99-101 [Journal]
  24. John R. Gilbert, Sivan Toledo
    An Assessment of Incomplete-LU Preconditioners for Nonsymmetric Linear Systems. [Citation Graph (0, 0)][DBLP]
    Informatica (Slovenia), 2000, v:24, n:3, pp:- [Journal]
  25. Marshall W. Bern, John R. Gilbert
    Drawing the Planar Dual. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:43, n:1, pp:7-13 [Journal]
  26. John R. Gilbert
    Some Nested Dissection Order is Nearly Optimal. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:26, n:6, pp:325-328 [Journal]
  27. Thomas F. Coleman, Anders Edenbrandt, John R. Gilbert
    Predicting fill for sparse orthogonal factorization. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1986, v:33, n:3, pp:517-532 [Journal]
  28. Hans L. Bodlaender, John R. Gilbert, Hjálmtyr Hafsteinsson, Ton Kloks
    Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:18, n:2, pp:238-255 [Journal]
  29. John R. Gilbert, Joan P. Hutchinson, Robert Endre Tarjan
    A Separator Theorem for Graphs of Bounded Genus. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1984, v:5, n:3, pp:391-407 [Journal]
  30. Marshall W. Bern, David Eppstein, John R. Gilbert
    Provably Good Mesh Generation. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:48, n:3, pp:384-409 [Journal]
  31. Siddhartha Chatterjee, John R. Gilbert, Fred J. E. Long, Robert Schreiber, Shang-Hua Teng
    Generating Local Address and Communication Sets for Data-Parallel Programs. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1995, v:26, n:1, pp:72-84 [Journal]
  32. Siddhartha Chatterjee, John R. Gilbert, Leonid Oliker, Robert Schreiber, Thomas J. Sheffler
    Algorithms for Automatic Alignment of Arrays. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1996, v:38, n:2, pp:145-157 [Journal]
  33. John R. Gilbert, Robert Schreiber
    Optimal Expression Evaluation for Data Parallel Architectures. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1991, v:13, n:1, pp:58-64 [Journal]
  34. John R. Gilbert, Hjálmtyr Hafsteinsson
    Parallel symbolic factorization of sparse linear systems. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1990, v:14, n:2, pp:151-162 [Journal]
  35. Earl Zmijewski, John R. Gilbert
    A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1988, v:7, n:2, pp:199-210 [Journal]
  36. John R. Gilbert, Thomas Lengauer, Robert Endre Tarjan
    The Pebbling Problem is Complete in Polynomial Space. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:3, pp:513-524 [Journal]
  37. Timothy A. Davis, John R. Gilbert, Stefan I. Larimore, Esmond G. Ng
    A column approximate minimum degree ordering algorithm. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 2004, v:30, n:3, pp:353-376 [Journal]
  38. Timothy A. Davis, John R. Gilbert, Stefan I. Larimore, Esmond G. Ng
    Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 2004, v:30, n:3, pp:377-380 [Journal]
  39. Siddhartha Chatterjee, John R. Gilbert, Robert Schreiber, Shang-Hua Teng
    Optimal Evaluation of Array Expressions on Massively Parallel Machines. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1995, v:17, n:1, pp:123-156 [Journal]
  40. John R. Gilbert, Steve Reinhardt, Viral Shah
    High-Performance Graph Algorithms from Parallel Sparse Matrices. [Citation Graph (0, 0)][DBLP]
    PARA, 2006, pp:260-269 [Conf]

  41. Challenges and Advances in Parallel Sparse Matrix-Matrix Multiplication. [Citation Graph (, )][DBLP]


  42. On the representation and multiplication of hypersparse matrices. [Citation Graph (, )][DBLP]


  43. An empirical study of the performance and productivity of two parallel programming models. [Citation Graph (, )][DBLP]


  44. Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks. [Citation Graph (, )][DBLP]


  45. Parallel Modeling of Fish Interaction. [Citation Graph (, )][DBLP]


  46. Distributed Sparse Matrices for Very High Level Languages. [Citation Graph (, )][DBLP]


  47. A comparative analysis of the information content in long and short SAGE libraries. [Citation Graph (, )][DBLP]


  48. Highly Parallel Sparse Matrix-Matrix Multiplication [Citation Graph (, )][DBLP]


  49. A Unified Framework for Numerical and Combinatorial Computing. [Citation Graph (, )][DBLP]


Search in 0.382secs, Finished in 0.385secs
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