The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Charles E. Leiserson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Benny Chor, Charles E. Leiserson, Ronald L. Rivest, James B. Shearer
    An application of number theory to the organization of raster-graphics memory. [Citation Graph (4, 0)][DBLP]
    J. ACM, 1986, v:33, n:1, pp:86-104 [Journal]
  2. Charles E. Leiserson, Satish Rao, Sivan Toledo
    Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    FOCS, 1993, pp:704-713 [Conf]
  3. Guy E. Blelloch, Charles E. Leiserson, Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha
    A Comparison of Sorting Algorithms for the Connection Machine CM-2. [Citation Graph (1, 0)][DBLP]
    SPAA, 1991, pp:3-16 [Conf]
  4. Charles E. Leiserson
    Fat-Trees: Universal Networks for Hardware-Efficient Supercomputing. [Citation Graph (1, 0)][DBLP]
    IEEE Trans. Computers, 1985, v:34, n:10, pp:892-901 [Journal]
  5. Charles E. Leiserson
    Cache-Oblivious Algorithms. [Citation Graph (0, 0)][DBLP]
    CIAC, 2003, pp:5- [Conf]
  6. Richard E. Zippel, Paul Penfield Jr., Lance A. Glasser, Charles E. Leiserson, John L. Wyatt Jr., Jonathan Allen
    Recent Results in VLSI CAD at MIT. [Citation Graph (0, 0)][DBLP]
    FJCC, 1986, pp:871-877 [Conf]
  7. Benny Chor, Charles E. Leiserson, Ronald L. Rivest
    An Application of Number Theory to the Organization of Raster-Graphics Memory (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:92-99 [Conf]
  8. Matteo Frigo, Charles E. Leiserson, Harald Prokop, Sridhar Ramachandran
    Cache-Oblivious Algorithms. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:285-298 [Conf]
  9. Ronald I. Greenberg, Charles E. Leiserson
    Randomized Routing on Fat-Trees (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:241-249 [Conf]
  10. Joe Kilian, Shlomo Kipnis, Charles E. Leiserson
    The Organization of Permutation Architectures with Bussed Interconnections (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:305-315 [Conf]
  11. Frank Thomson Leighton, Charles E. Leiserson
    Wafer-Scale Integration of Systolic Arrays (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:297-311 [Conf]
  12. Charles E. Leiserson
    Area-Efficient Graph Layouts (for VLSI) [Citation Graph (0, 0)][DBLP]
    FOCS, 1980, pp:270-281 [Conf]
  13. Charles E. Leiserson, James B. Saxe
    Optimizing Synchronous Systems [Citation Graph (0, 0)][DBLP]
    FOCS, 1981, pp:23-36 [Conf]
  14. C. Scott Ananian, Krste Asanovic, Bradley C. Kuszmaul, Charles E. Leiserson, Sean Lie
    Unbounded Transactional Memory. [Citation Graph (0, 0)][DBLP]
    HPCA, 2005, pp:316-327 [Conf]
  15. Kunal Agrawal, Yuxiong He, Charles E. Leiserson
    An Empirical Evaluation ofWork Stealing with Parallelism Feedback. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2006, pp:19- [Conf]
  16. Thomas H. Cormen, Charles E. Leiserson
    A Hyperconcentrator Switch for Routing Bit-Serial Messages. [Citation Graph (0, 0)][DBLP]
    ICPP, 1986, pp:721-728 [Conf]
  17. Charles E. Leiserson
    Fat-Trees: Universal Networks for Hardware-Efficient Supercomputing. [Citation Graph (0, 0)][DBLP]
    ICPP, 1985, pp:393-402 [Conf]
  18. Charles E. Leiserson, Bruce M. Maggs
    Communication-Efficient Parallel Graph Algorithms. [Citation Graph (0, 0)][DBLP]
    ICPP, 1986, pp:861-868 [Conf]
  19. Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson
    Adversarial Analyses of Window Backoff Strategies. [Citation Graph (0, 0)][DBLP]
    IPDPS Next Generation Software Program - NSFNGS - PI Workshop, 2004, pp:- [Conf]
  20. Robert D. Blumofe, Matteo Frigo, Christopher F. Joerg, Charles E. Leiserson, Keith H. Randall
    Dag-Consistent Distributed Shared Memory. [Citation Graph (0, 0)][DBLP]
    IPPS, 1996, pp:132-141 [Conf]
  21. Charles E. Leiserson
    Can Multithreaded Programming Save Massively Parallel Computing? [Citation Graph (0, 0)][DBLP]
    IPPS, 1996, pp:2-3 [Conf]
  22. Charles E. Leiserson
    Programming Irregular Parallel Applications in Cilk. [Citation Graph (0, 0)][DBLP]
    IRREGULAR, 1997, pp:61-71 [Conf]
  23. Ching Law, Charles E. Leiserson
    A New Competitive Analysis of Randomized Caching. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:35-46 [Conf]
  24. Charles E. Leiserson
    Algorithmic Analysis of Multithreaded Algorithms (Abstract). [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:132- [Conf]
  25. Yuxiong He, Wen-Jing Hsu, Charles E. Leiserson
    Provably Efficient Two-Level Adaptive Scheduling. [Citation Graph (0, 0)][DBLP]
    JSSPP, 2006, pp:1-32 [Conf]
  26. Charles E. Leiserson
    The Networks of the Connection Machine CM-5. [Citation Graph (0, 0)][DBLP]
    Heinz Nixdorf Symposium, 1992, pp:66-67 [Conf]
  27. Matteo Frigo, Charles E. Leiserson, Keith H. Randall
    The Implementation of the Cilk-5 Multithreaded Language. [Citation Graph (0, 0)][DBLP]
    PLDI, 1998, pp:212-223 [Conf]
  28. Kunal Agrawal, Yuxiong He, Wen-Jing Hsu, Charles E. Leiserson
    Adaptive scheduling with parallelism feedback. [Citation Graph (0, 0)][DBLP]
    PPOPP, 2006, pp:100-109 [Conf]
  29. Robert D. Blumofe, Christopher F. Joerg, Bradley C. Kuszmaul, Charles E. Leiserson, Keith H. Randall, Yuli Zhou
    Cilk: An Efficient Multithreaded Runtime System. [Citation Graph (0, 0)][DBLP]
    PPOPP, 1995, pp:207-216 [Conf]
  30. Kunal Agrawal, Yuxiong He, Charles E. Leiserson
    Adaptive work stealing with parallelism feedback. [Citation Graph (0, 0)][DBLP]
    PPOPP, 2007, pp:112-120 [Conf]
  31. Charles E. Leiserson, John G. Lewis
    Orderings for Parallel Sparse Symmetric Factorization. [Citation Graph (0, 0)][DBLP]
    PPSC, 1987, pp:27-31 [Conf]
  32. Charles E. Leiserson, Zahi S. Abuhamdeh, David C. Douglas, Carl R. Feynman, Mahesh N. Ganmukhi, Jeffrey V. Hill, W. Daniel Hillis, Bradley C. Kuszmaul, Margaret A. St. Pierre, David S. Wells, Monica C. Wong, Shaw-Wen Yang, Robert Zak
    The Network Architecture of the Connection Machine CM-5 (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1992, pp:272-285 [Conf]
  33. Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Charles E. Leiserson
    On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:133-144 [Conf]
  34. Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson
    Adversarial contention resolution for simple channels. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:325-332 [Conf]
  35. Robert D. Blumofe, Matteo Frigo, Christopher F. Joerg, Charles E. Leiserson, Keith H. Randall
    An Analysis of Dag-Consistent Distributed Shared-Memory Algorithms. [Citation Graph (0, 0)][DBLP]
    SPAA, 1996, pp:297-308 [Conf]
  36. Guang-Ien Cheng, Mingdong Feng, Charles E. Leiserson, Keith H. Randall, Andrew F. Stark
    Detecting Data Rase in Cilk Programs That use Locks. [Citation Graph (0, 0)][DBLP]
    SPAA, 1998, pp:298-309 [Conf]
  37. Mingdong Feng, Charles E. Leiserson
    Efficient Detection of Determinacy Races in Cilk Programs. [Citation Graph (0, 0)][DBLP]
    SPAA, 1997, pp:1-11 [Conf]
  38. Charles E. Leiserson, Keith H. Randall
    Parallel Algorithms for the Circuit Value Update Problem. [Citation Graph (0, 0)][DBLP]
    SPAA, 1995, pp:13-20 [Conf]
  39. Robert D. Blumofe, Charles E. Leiserson
    Space-efficient scheduling of multithreaded computations. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:362-371 [Conf]
  40. Sandeep N. Bhatt, Charles E. Leiserson
    How to Assemble Tree Machines (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1982, pp:77-84 [Conf]
  41. Charles E. Leiserson, F. Miller Maley
    Algorithms for Routing and Testing Routability of Planar VLSI Layouts [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:69-78 [Conf]
  42. Charles E. Leiserson
    Design and Analysis of Dynamic Multithreaded Algorithms. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:1-2 [Conf]
  43. Charles E. Leiserson
    Design and Analysis of Algorithms for Shared-Memory Multiprocessors (Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:55- [Conf]
  44. Charles E. Leiserson, Bruce M. Maggs
    Communication-Efficient Parallel Algorithms for Distributed Random-Access Machines. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1988, v:3, n:, pp:53-77 [Journal]
  45. Charles E. Leiserson, James B. Saxe
    Retiming Synchronous Circuitry. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1991, v:6, n:1, pp:5-35 [Journal]
  46. Guy E. Blelloch, Charles E. Leiserson, Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha
    A Comparison of Sorting Algorithms for the Connection Machine CM-2. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1996, v:39, n:12es, pp:273-297 [Journal]
  47. Robert D. Blumofe, Charles E. Leiserson
    Scheduling Multithreaded Computations by Work Stealing. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1999, v:46, n:5, pp:720-748 [Journal]
  48. Alexander T. Ishii, Charles E. Leiserson, Marios C. Papaefthymiou
    Optimizing two-phase, level-clocked circuitry. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1997, v:44, n:1, pp:148-199 [Journal]
  49. Charles E. Leiserson, James B. Saxe
    A Mixed-Integer Linear Programming Problem which is Efficiently Solvable. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1988, v:9, n:1, pp:114-128 [Journal]
  50. Charles E. Leiserson, Satish Rao, Sivan Toledo
    Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:2, pp:332-344 [Journal]
  51. Robert D. Blumofe, Christopher F. Joerg, Bradley C. Kuszmaul, Charles E. Leiserson, Keith H. Randall, Yuli Zhou
    Cilk: An Efficient Multithreaded Runtime System. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1996, v:37, n:1, pp:55-69 [Journal]
  52. Thomas H. Cormen, Charles E. Leiserson
    A Hyperconcentrator Swith for Routing Bit-Serial Messages. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1990, v:10, n:3, pp:193-204 [Journal]
  53. Charles E. Leiserson, Zahi S. Abuhamdeh, David C. Douglas, Carl R. Feynman, Mahesh N. Ganmukhi, Jeffrey V. Hill, W. Daniel Hillis, Bradley C. Kuszmaul, Margaret A. St. Pierre, David S. Wells, Monica C. Wong-Chan, Shaw-Wen Yang, Robert Zak
    The Network Architecture of the Connection Machine CM-5. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1996, v:33, n:2, pp:145-158 [Journal]
  54. C. Scott Ananian, Krste Asanovic, Bradley C. Kuszmaul, Charles E. Leiserson, Sean Lie
    Unbounded Transactional Memory. [Citation Graph (0, 0)][DBLP]
    IEEE Micro, 2006, v:26, n:1, pp:59-69 [Journal]
  55. Guy E. Blelloch, Charles E. Leiserson
    An Experimental Analysis of Parallel. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:2, pp:135-167 [Journal]
  56. Mingdong Feng, Charles E. Leiserson
    Efficient Detection of Determinacy Races in Cilk Programs. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1999, v:32, n:3, pp:301-326 [Journal]
  57. Charles E. Leiserson, Keith H. Randall
    Parallel Algorithms for the Circuit Value Update Problem. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1997, v:30, n:6, pp:583-597 [Journal]
  58. John S. Danaher, I.-Ting Angelina Lee, Charles E. Leiserson
    Programming with exceptions in JCilk. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2006, v:63, n:2, pp:147-171 [Journal]
  59. Robert D. Blumofe, Charles E. Leiserson
    Space-Efficient Scheduling of Multithreaded Computations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:1, pp:202-229 [Journal]
  60. Charles E. Leiserson, Ron Y. Pinter
    Optimal Placement for River Routing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:3, pp:447-462 [Journal]
  61. Joe Kilian, Shlomo Kipnis, Charles E. Leiserson
    The Organization of Permutation Architectures with Bused Interconnections. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1990, v:39, n:11, pp:1346-1358 [Journal]
  62. Frank Thomson Leighton, Charles E. Leiserson
    Wafer-Scale Integration of Systolic Arrays. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1985, v:34, n:5, pp:448-461 [Journal]
  63. Chris Hill, Bradley C. Kuszmaul, Charles E. Leiserson, John Marshall
    Planet-in-a-Bottle: A Numerical Fluid-Laboratory System. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (1), 2007, pp:1163-1170 [Conf]
  64. Kunal Agrawal, Yuxiong He, Wen-Jing Hsu, Charles E. Leiserson
    Adaptive Scheduling with Parallelism Feedback. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2007, pp:1-7 [Conf]
  65. Yuxiong He, Wen-Jing Hsu, Charles E. Leiserson
    Provably Efficient Online Non-clairvoyant Adaptive Scheduling. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2007, pp:1-10 [Conf]

  66. Memory models for open-nested transactions. [Citation Graph (, )][DBLP]


  67. The Cilk++ concurrency platform. [Citation Graph (, )][DBLP]


  68. 04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms. [Citation Graph (, )][DBLP]


  69. Efficient Evaluation of Large Polynomials. [Citation Graph (, )][DBLP]


  70. Helper locks for fork-join parallel programming. [Citation Graph (, )][DBLP]


  71. A consistency architecture for hierarchical shared caches. [Citation Graph (, )][DBLP]


  72. Reducers and other Cilk++ hyperobjects. [Citation Graph (, )][DBLP]


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


  74. The Cilkview scalability analyzer. [Citation Graph (, )][DBLP]


  75. A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers). [Citation Graph (, )][DBLP]


Search in 0.047secs, Finished in 0.050secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002