| Year |
Citation |
Score |
| 2020 |
Leiserson CE, Thompson NC, Emer JS, Kuszmaul BC, Lampson BW, Sanchez D, Schardl TB. There's plenty of room at the Top: What will drive computer performance after Moore's law? Science (New York, N.Y.). 368. PMID 32499413 DOI: 10.1126/Science.Aam9744 |
0.425 |
|
| 2019 |
Schardl TB, Moses WS, Leiserson CE. Tapir: Embedding Recursive Fork-join Parallelism into LLVM’s Intermediate Representation Acm Transactions On Parallel Computing. 6: 1-33. DOI: 10.1145/3365655 |
0.331 |
|
| 2017 |
Natarajan EP, Dehnavi MM, Leiserson CE. Autotuning divide-and-conquer stencil computations Concurrency and Computation: Practice and Experience. 29. DOI: 10.1002/Cpe.4127 |
0.361 |
|
| 2016 |
Leiserson CE. A simple deterministic algorithm for guaranteeing the forward progress of transactions Information Systems. 57: 69-74. DOI: 10.1016/J.Is.2015.10.013 |
0.384 |
|
| 2016 |
Suksompong W, Leiserson CE, Schardl TB. On the efficiency of localized work stealing Information Processing Letters. 116: 100-106. DOI: 10.1016/J.Ipl.2015.10.002 |
0.369 |
|
| 2016 |
Leiserson CE, Schardl TB, Suksompong W. Upper Bounds on Number of Steals in Rooted Trees Theory of Computing Systems \/ Mathematical Systems Theory. 58: 223-240. DOI: 10.1007/S00224-015-9613-9 |
0.339 |
|
| 2012 |
Frigo M, Leiserson CE, Prokop H, Ramachandran S. Cache-Oblivious Algorithms Acm Transactions On Algorithms. 8: 4. DOI: 10.1145/2071379.2071383 |
0.414 |
|
| 2010 |
Leiserson CE. The Cilk++ concurrency platform The Journal of Supercomputing. 51: 244-257. DOI: 10.1007/S11227-010-0405-3 |
0.318 |
|
| 2008 |
Agrawal K, Leiserson CE, He Y, Hsu WJ. Adaptive work-stealing with parallelism feedback Acm Transactions On Computer Systems. 26: 7. DOI: 10.1145/1394441.1394443 |
0.388 |
|
| 2008 |
He Y, Hsu W, Leiserson CE. Provably Efficient Online Nonclairvoyant Adaptive Scheduling Ieee Transactions On Parallel and Distributed Systems. 19: 1263-1279. DOI: 10.1109/Tpds.2008.39 |
0.368 |
|
| 2006 |
Danaher JS, Lee I-A, Leiserson CE. Programming with exceptions in JCilk Science of Computer Programming. 63: 147-171. DOI: 10.1016/J.Scico.2006.05.008 |
0.346 |
|
| 1999 |
Blumofe RD, Leiserson CE. Scheduling multithreaded computations by work stealing Journal of the Acm. 46: 720-748. DOI: 10.1145/324133.324234 |
0.419 |
|
| 1999 |
Feng M, Leiserson CE. Efficient Detection of Determinacy Races in Cilk Programs Theory of Computing Systems \/ Mathematical Systems Theory. 32: 301-326. DOI: 10.1007/S002240000120 |
0.406 |
|
| 1998 |
Blumofe RD, Leiserson CE. Space-Efficient Scheduling of Multithreaded Computations Siam Journal On Computing. 27: 202-229. DOI: 10.1137/S0097539793259471 |
0.398 |
|
| 1998 |
Blelloch GE, Leiserson CE, Maggs BM, Plaxton CG, Smith SJ, Zagha M. An experimental analysis of parallel sorting algorithms Theory of Computing Systems. 31: 135-167. DOI: 10.1007/S002240000083 |
0.578 |
|
| 1997 |
Ishii AT, Leiserson CE, Papaefthymiou MC. Optimizing two-phase, level-clocked circuitry Journal of the Acm. 44: 148-199. DOI: 10.1145/256292.256301 |
0.581 |
|
| 1997 |
Leiserson CE, Randall KH. Parallel Algorithms for the Circuit Value Update Problem Theory of Computing Systems \/ Mathematical Systems Theory. 30: 583-597. DOI: 10.1007/S002240000069 |
0.424 |
|
| 1997 |
Leiserson CE. Programming Irregular Parallel Applications in Cilk Lecture Notes in Computer Science. 61-71. DOI: 10.1007/3-540-63138-0_6 |
0.316 |
|
| 1996 |
Blumofe RD, Joerg CF, Kuszmaul BC, Leiserson CE, Randall KH, Zhou Y. Cilk: An Efficient Multithreaded Runtime System Journal of Parallel and Distributed Computing. 37: 55-69. DOI: 10.1006/Jpdc.1996.0107 |
0.413 |
|
| 1991 |
Leiserson CE, Saxe JB. Retiming synchronous circuitry Algorithmica. 6: 5-35. DOI: 10.1007/Bf01759032 |
0.407 |
|
| 1990 |
Kilian J, Kipnis S, Leiserson CE. The organization of permutation architectures with bused interconnections Ieee Transactions On Computers. 39: 1346-1358. DOI: 10.1109/12.61044 |
0.363 |
|
| 1990 |
Cormen TH, Leiserson CE. A hyperconcentrator switch for routing bit-serial messages Journal of Parallel and Distributed Computing. 10: 193-204. DOI: 10.1016/0743-7315(90)90012-E |
0.323 |
|
| 1988 |
Greenberg RI, Leiserson CE. A compact layout for the three-dimensional tree of meshes Applied Mathematics Letters. 1: 171-176. DOI: 10.1016/0893-9659(88)90066-3 |
0.311 |
|
| 1988 |
Leiserson CE, Saxe JB. A mixed-integer linear programming problem which is efficiently solvable Journal of Algorithms. 9: 114-128. DOI: 10.1016/0196-6774(88)90008-9 |
0.441 |
|
| 1988 |
Leiserson CE, Maggs BM. Communication-efficient parallel algorithms for distributed random-access machines Algorithmica. 3: 53-77. DOI: 10.1007/Bf01762110 |
0.453 |
|
| 1985 |
Leiserson CE. Fat-trees: Universal networks for hardware-efficient supercomputing Ieee Transactions On Computers. 34: 892-901. DOI: 10.1109/Tc.1985.6312192 |
0.328 |
|
| 1983 |
Leiserson CE, Pinter RY. Optimal Placement for River Routing Siam Journal On Computing. 12: 126-142. DOI: 10.1007/978-3-642-68402-9_16 |
0.579 |
|
| Show low-probability matches. |