| Year |
Citation |
Score |
| 2018 |
Ghanim F, Vishkin U, Barua R. Easy PRAM-Based High-Performance Parallel Programming with ICE Ieee Transactions On Parallel and Distributed Systems. 29: 377-390. DOI: 10.1109/Tpds.2017.2754376 |
0.388 |
|
| 2015 |
Dachman-Soled D, Liu C, Papamanthou C, Shi E, Vishkin U. Oblivious network RAM and leveraging parallelism to achieve obliviousness Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9452: 337-359. DOI: 10.1007/S00145-018-9301-4 |
0.488 |
|
| 2014 |
Tzannes A, Caragea GC, Vishkin U, Barua R. Lazy scheduling: A runtime adaptive scheduler for declarative parallelism Acm Transactions On Programming Languages and Systems. 36. DOI: 10.1145/2629643 |
0.751 |
|
| 2014 |
Vishkin U. Is multicore hardware for general-purpose parallel processing broken? Communications of the Acm. 57: 35-39. DOI: 10.1145/2580945 |
0.388 |
|
| 2014 |
Edwards JA, Vishkin U. Parallel algorithms for Burrows-Wheeler compression and decompression Theoretical Computer Science. 525: 10-22. DOI: 10.1016/J.Tcs.2013.10.009 |
0.388 |
|
| 2012 |
Edwards JA, Vishkin U. Brief announcement: Speedups for parallel graph triconnectivity Annual Acm Symposium On Parallelism in Algorithms and Architectures. 190-192. DOI: 10.1145/2312005.2312042 |
0.353 |
|
| 2012 |
Edwards JA, Vishkin U. Better speedups using simpler parallel programming for graph connectivity and biconnectivity Proceedings of the 2012 International Workshop On Programming Models and Applications For Multicores and Manycores, Pmam 2012. 103-114. DOI: 10.1145/2141702.2141714 |
0.386 |
|
| 2012 |
Keceli F, Moreshet T, Vishkin U. Thermal management of a many-core processor under fine-grained parallelism Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7155: 249-259. DOI: 10.1007/978-3-642-29737-3-29 |
0.771 |
|
| 2012 |
Moreshet T, Vishkin U, Keceli F. Parallel simulation of many-core processors: Integration of research and education Asee Annual Conference and Exposition, Conference Proceedings. |
0.746 |
|
| 2011 |
Vishkin U. Using simple abstraction to reinvent computing for parallelism Communications of the Acm. 54: 75-85. DOI: 10.1145/1866739.1866757 |
0.436 |
|
| 2011 |
Horak MN, Nowick SM, Carlberg M, Vishkin U. A low-overhead asynchronous interconnection network for GALS chip multiprocessors Ieee Transactions On Computer-Aided Design of Integrated Circuits and Systems. 30: 494-507. DOI: 10.1109/Tcad.2011.2114970 |
0.497 |
|
| 2011 |
Tzannes A, Barua R, Vishkin U. Improving run-time scheduling for general-purpose parallel code Parallel Architectures and Compilation Techniques - Conference Proceedings, Pact. 216. DOI: 10.1109/PACT.2011.49 |
0.751 |
|
| 2011 |
Keceli F, Tzannes A, Caragea GC, Barua R, Vishkin U. Toolchain for programming, simulating and studying the XMT many-core architecture Ieee International Symposium On Parallel and Distributed Processing Workshops and Phd Forum. 1282-1291. DOI: 10.1109/IPDPS.2011.270 |
0.781 |
|
| 2011 |
Keceli F, Moreshet T, Vishkin U. Power-performance comparison of single-task driven many-cores Proceedings of the International Conference On Parallel and Distributed Systems - Icpads. 348-355. DOI: 10.1109/ICPADS.2011.101 |
0.782 |
|
| 2011 |
Caragea GC, Tzannes A, Keceli F, Barua R, Vishkin U. Resource-aware compiler prefetching for fine-grained many-cores International Journal of Parallel Programming. 39: 615-638. DOI: 10.1007/S10766-011-0163-8 |
0.802 |
|
| 2010 |
Tzannes A, Caragea GC, Barua R, Vishkin U. Lazy binary-splitting: A run-time adaptive work-stealing scheduler Acm Sigplan Notices. 45: 179-189. DOI: 10.1145/1837853.1693479 |
0.743 |
|
| 2010 |
Caragea GC, Tzannes A, Keceli F, Barua R, Vishkin U. Resource-aware compiler prefetching for many-cores 9th International Symposium On Parallel and Distributed Computing, Ispdc 2010. 133-140. DOI: 10.1109/ISPDC.2010.16 |
0.804 |
|
| 2009 |
Caragea GC, Saybasili AB, Wen X, Vishkin U. Brief announcement: Performance potential of an easy-to-program PRAM-on-chip prototype versus state-of-the-art processor Annual Acm Symposium On Parallelism in Algorithms and Architectures. 163-165. DOI: 10.1145/1583991.1584038 |
0.388 |
|
| 2009 |
Balkan AO, Qu G, Vishkin U. Mesh-of-trees and alternative interconnection networks for single-chip parallelism Ieee Transactions On Very Large Scale Integration (Vlsi) Systems. 17: 1419-1432. DOI: 10.1109/Tvlsi.2008.2003999 |
0.8 |
|
| 2009 |
Vishkin U. Algorithmic approach to designing an easy-to-program system: Can it lead to a hW-enhanced programmer's workflow add-on? Proceedings - Ieee International Conference On Computer Design: Vlsi in Computers and Processors. 60-63. DOI: 10.1109/ICCD.2009.5413174 |
0.368 |
|
| 2009 |
Saybasili AB, Tzannes A, Brooks BR, Vishkin U. Highly parallel multi-dimensional fast fourier transform on fine- and coarse-grained many-core approaches Proceedings of the Iasted International Conference On Parallel and Distributed Computing and Systems. 107-113. |
0.693 |
|
| 2008 |
Wen X, Vishkin U. FPGA-based prototype of a PRAM-On-Chip processor Conference On Computing Frontiers - Proceedings of the 2008 Conference On Computing Frontiers, Cf'08. 55-66. DOI: 10.1145/1366230.1366240 |
0.341 |
|
| 2008 |
DuBois T, Lee B, Wang Y, Olano M, Vishkin U. XMT-GPU: A PRAM architecture for graphics computation Proceedings of the International Conference On Parallel Processing. 364-372. DOI: 10.1109/ICPP.2008.35 |
0.436 |
|
| 2008 |
Balkan AO, Qu G, Vishkin U. An area-efficient high-throughput hybrid interconnection network for single-chip parallel processing Proceedings - Design Automation Conference. 435-440. DOI: 10.1109/DAC.2008.4555857 |
0.784 |
|
| 2008 |
Hochstein L, Basili VR, Vishkin U, Gilbert J. A pilot study to compare programming effort for two parallel programming models Journal of Systems and Software. 81: 1920-1930. DOI: 10.1016/J.Jss.2007.12.798 |
0.377 |
|
| 2007 |
Balkan AO, Horak MN, Qu G, Vishkin U. Layout-accurate design and implementation of a high-throughput interconnection network for single-chip parallel processing Proceedings - 15th Annual Ieee Symposium On High-Performance Interconnects, Hot Interconnects. 21-28. DOI: 10.1109/HOTI.2007.11 |
0.795 |
|
| 2006 |
Milner S, Llorca J, Anibha A, Vishkin U. A bootstrapping model for directional wireless networks Ieee Communications Letters. 10: 840-842. DOI: 10.1109/Lcomm.2006.060808 |
0.457 |
|
| 2006 |
Liu F, Vishkin U, Milner S. Bootstrapping free-space optical networks Ieee Journal On Selected Areas in Communications. 24: 13-22. DOI: 10.1109/Jsac.2006.258219 |
0.421 |
|
| 2006 |
Balkan AO, Qu G, Vishkin U. A mesh-of-trees interconnection network for single-chip parallel processing Proceedings of the International Conference On Application-Specific Systems, Architectures and Processors. 73-80. DOI: 10.1109/ASAP.2006.6 |
0.802 |
|
| 2006 |
Vishkin U. Annual ACM Symposium on Parallelism in Algorithms and Architectures: Foreword Annual Acm Symposium On Parallelism in Algorithms and Architectures. 2006: iii. |
0.337 |
|
| 2004 |
Llorca J, Desai A, Vishkin U, Davis C, Milner S. Reconfigurable Optical Wireless Sensor Networks Proceedings of Spie - the International Society For Optical Engineering. 5237: 136-146. DOI: 10.1117/12.511368 |
0.417 |
|
| 2004 |
Balkan AO, Qu G, Vishkin U. Arbitrate-and-move primitives for high throughput on-chip interconnection networks Proceedings - Ieee International Symposium On Circuits and Systems. 2: II441-II444. |
0.778 |
|
| 2003 |
Naishlos D, Nuzman J, Tseng CW, Vishkin U. Towards a First Vertical Prototyping of an Extremely Fine-Grained Parallel Programming Approach Theory of Computing Systems. 36: 521-552. DOI: 10.1007/S00224-003-1086-6 |
0.489 |
|
| 2003 |
Kutten S, Peleg D, Vishkin U. Deterministic Resource Discovery in Distributed Networks Theory of Computing Systems. 36: 479-495. DOI: 10.1007/S00224-003-1084-8 |
0.371 |
|
| 2002 |
Vishkin U. Two techniques for reconciling algorithm parallelism with memory constraints (extended abstract) Annual Acm Symposium On Parallel Algorithms and Architectures. 95-98. |
0.303 |
|
| 2001 |
Naishlos D, Nuzman J, Tseng CW, Vishkin U. Evaluating the XMT parallel programming model Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2026: 95-108. DOI: 10.1007/3-540-45401-2_8 |
0.41 |
|
| 2000 |
Vishkin D, Vishkin U. Experiments with list ranking for explicit multi-threaded (XMT) instruction parallelism Acm Journal of Experimental Algorithms. 5: 10. DOI: 10.1145/351827.384252 |
0.492 |
|
| 2000 |
Vishkin U. No-busy-wait balanced tree parallel algorithmic paradigm Annual Acm Symposium On Parallel Algorithms and Architectures. 147-155. |
0.335 |
|
| 1999 |
Dascal S, Vishkin U. Experiments with List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism Lecture Notes in Computer Science. 43-59. DOI: 10.1007/3-540-48318-7_6 |
0.514 |
|
| 1999 |
Mansour Y, Nisan N, Vishkin U. Trade-offs between communication throughput and parallel time Journal of Complexity. 15: 148-166. DOI: 10.1006/Jcom.1998.0498 |
0.444 |
|
| 1999 |
Dascal S, Vishkin U. Experiments with list ranking for explicit multi-threaded (xmt) instruction parallelism (extended abstract) Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1668: 43. |
0.42 |
|
| 1998 |
Vishkin U, Dascal S, Berkovich E, Nuzman J. Explicit multi-threading (XMT) bridging models for instruction parallelism *(extended abstract) Annual Acm Symposium On Parallel Algorithms and Architectures. 140-151. |
0.375 |
|
| 1997 |
Mueller SM, Vishkin U. Conflict-free access to multiple single-ported register files Proceedings of the International Parallel Processing Symposium, Ipps. 672-678. |
0.322 |
|
| 1997 |
Vishkin U. From algorithm parallelism to instruction-level parallelism: An encode-decode chain using prefix-sum Annual Acm Symposium On Parallel Algorithms and Architectures. 260-271. |
0.397 |
|
| 1996 |
Vishkin U. Can Parallel Algorithms Enhance Serial Implementation? Communications of the Acm. 39: 88-91. DOI: 10.1145/234215.234475 |
0.423 |
|
| 1996 |
Berkman O, Schieber B, Vishkin U. A fast parallel algorithm for finding the convex hull of a sorted point set International Journal of Computational Geometry and Applications. 6: 231-241. DOI: 10.1142/S0218195996000162 |
0.395 |
|
| 1996 |
JáJá JF, Ryu KW, Vishkin U. Sorting strings and constructing digital search trees in parallel Theoretical Computer Science. 154: 225-245. DOI: 10.1016/0304-3975(94)00263-0 |
0.389 |
|
| 1995 |
Berkman O, Vishkin U. Almost fully-parallel parentheses matching Discrete Applied Mathematics. 57: 11-28. DOI: 10.1016/0166-218X(93)E0137-N |
0.32 |
|
| 1995 |
Raman R, Vishkin U. Parallel algorithms for database operations and a database operation for parallel algorithms Ieee Symposium On Parallel and Distributed Processing - Proceedings. 173-179. |
0.353 |
|
| 1994 |
Berkman O, Jaja J, Krishnamurthy S, Thurimella R, Vishkin U. Top-bottom routing around a rectangle is as easy as computing prefix minima Siam Journal On Computing. 23: 449-465. DOI: 10.1137/S0097539791218275 |
0.406 |
|
| 1994 |
Berkman O, Vishkin U. Finding level-ancestors in trees Journal of Computer and System Sciences. 48: 214-230. DOI: 10.1016/S0022-0000(05)80002-9 |
0.306 |
|
| 1994 |
Khuller S, Vishkin U. On the parallel complexity of digraph reachability Information Processing Letters. 52: 239-241. DOI: 10.1016/0020-0190(94)00153-7 |
0.336 |
|
| 1994 |
Khuller S, Vishkin U, Young N. A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers Journal of Algorithms. 17: 280-289. DOI: 10.1006/Jagm.1994.1036 |
0.413 |
|
| 1993 |
Berkman O, Vishkin U. Recursive star-tree parallel data structure Siam Journal On Computing. 22: 221-242. DOI: 10.1137/0222017 |
0.416 |
|
| 1993 |
Berkman O, Schieber B, Vishkin U. Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values Journal of Algorithms. 14: 344-370. DOI: 10.1006/Jagm.1993.1018 |
0.36 |
|
| 1993 |
Berkman O, Vishkin U. On Parallel Integer Merging Information and Computation. 106: 266-285. DOI: 10.1006/Inco.1993.1056 |
0.314 |
|
| 1992 |
Khuller S, Vishkin U. Biconnectivity approximations and graph carvings Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 759-770. DOI: 10.1145/174652.174654 |
0.342 |
|
| 1992 |
Vishkin U. A parallel blocking flow algorithm for acyclic networks Journal of Algorithms. 13: 489-501. DOI: 10.1016/0196-6774(92)90051-D |
0.448 |
|
| 1992 |
Amir A, Landau GM, Vishkin U. Efficient pattern matching with scaling Journal of Algorithms. 13: 2-32. DOI: 10.1016/0196-6774(92)90003-U |
0.333 |
|
| 1992 |
Berkman O, Matias Y, Vishkin U. Randomized range-maxima in nearly-constant parallel time Computational Complexity. 2: 350-373. DOI: 10.1007/Bf01200429 |
0.32 |
|
| 1991 |
Cole R, Vishkin U. Approximate parallel scheduling. II. Applications to logarithmic-time optimal parallel graph algorithms Information and Computation. 92: 1-47. DOI: 10.1016/0890-5401(91)90019-X |
0.427 |
|
| 1991 |
Matias Y, Vishkin U. On parallel hashing and integer sorting Journal of Algorithms. 12: 573-606. DOI: 10.1016/0196-6774(91)90034-V |
0.409 |
|
| 1990 |
Landau GM, Vishkin U, Nussinov R. Fast alignment of DNA and protein sequences. Methods in Enzymology. 183: 487-502. PMID 2314289 DOI: 10.1016/0076-6879(90)83033-6 |
0.308 |
|
| 1990 |
Schieber B, Vishkin U. Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm Discrete Applied Mathematics. 29: 97-111. DOI: 10.1016/0166-218X(90)90084-P |
0.371 |
|
| 1989 |
Landau GM, Vishkin U. Fast parallel and serial approximate string matching Journal of Algorithms. 10: 157-169. DOI: 10.1016/0196-6774(89)90010-2 |
0.34 |
|
| 1989 |
Berkman O, Vishkin U. Recursive *-tree parallel data-structure Annual Symposium On Foundations of Computer Science (Proceedings). 196-202. |
0.307 |
|
| 1988 |
Landau GM, Vishkin U, Nussinov R. Locating alignments with k differences for nucleotide and amino acid sequences. Computer Applications in the Biosciences : Cabios. 4: 19-24. PMID 3382993 DOI: 10.1093/Bioinformatics/4.1.19 |
0.301 |
|
| 1988 |
Cole R, Vishkin U. Approximate parallel scheduling. Part I: the basic technique with applications to optimal parallel list ranking in logarithmic time Siam Journal On Computing. 17: 128-142. DOI: 10.1137/0217009 |
0.395 |
|
| 1988 |
Megiddo N, Vishkin U. On finding a minimum dominating set in a tournament Theoretical Computer Science. 61: 307-316. DOI: 10.1016/0304-3975(88)90131-4 |
0.302 |
|
| 1988 |
Apostolico A, Iliopoulos C, Landau GM, Schieber B, Vishkin U. Parallel construction of a suffix tree with applications Algorithmica. 3: 347-365. DOI: 10.1007/Bf01762122 |
0.388 |
|
| 1987 |
Vishkin U. Randomized parallel speedups for list ranking Journal of Parallel and Distributed Computing. 4: 319-333. DOI: 10.1016/0743-7315(87)90040-2 |
0.398 |
|
| 1986 |
Maon Y, Schieber B, Vishkin U. Parallel ear decomposition search (EDS) and st-numbering in graphs Theoretical Computer Science. 47: 277-298. DOI: 10.1016/0304-3975(86)90153-2 |
0.411 |
|
| 1985 |
Vishkin U, Wigderson A. Trade-Offs between Depth and Width in Parallel Computation Siam Journal On Computing. 14: 303-314. DOI: 10.1137/0214024 |
0.435 |
|
| 1985 |
Coppersmith D, Vishkin U. Solving NP-hard problems in 'almost trees': Vertex cover Discrete Applied Mathematics. 10: 27-45. DOI: 10.1016/0166-218X(85)90057-5 |
0.328 |
|
| 1984 |
Chandra AK, Stockmeyer LJ, Vishkin U. Constant Depth Reducibility Siam Journal On Computing. 13: 423-439. DOI: 10.1137/0213028 |
0.398 |
|
| 1984 |
Stockmeyer LJ, Vishkin U. Simulation of Parallel Random Access Machines by Circuits Siam Journal On Computing. 13: 409-422. DOI: 10.1137/0213027 |
0.461 |
|
| 1984 |
Vishkin U. A parallel-design distributed-implementation (PDDI) general-purpose computer Theoretical Computer Science. 32: 157-172. DOI: 10.1016/0304-3975(84)90028-8 |
0.35 |
|
| 1984 |
Vishkin U. An optimal parallel connectivity algorithm Discrete Applied Mathematics. 9: 197-207. DOI: 10.1016/0166-218X(84)90019-2 |
0.418 |
|
| 1984 |
Mehlhorn K, Vishkin U. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories Acta Informatica. 21: 339-374. DOI: 10.1007/Bf00264615 |
0.456 |
|
| 1983 |
Vishkin U. An Efficient Distributed Orientation Algorithm Ieee Transactions On Information Theory. 29: 624-629. DOI: 10.1109/TIT.1983.1056696 |
0.342 |
|
| 1983 |
Vishkin U, Wigderson A. Dynamic parallel memories Information and Control. 56: 174-182. DOI: 10.1016/S0019-9958(83)80003-5 |
0.314 |
|
| 1983 |
Vishkin U. Implementation of simultaneous memory address access in models that forbid it Journal of Algorithms. 4: 45-50. DOI: 10.1016/0196-6774(83)90033-0 |
0.438 |
|
| 1982 |
Shiloach Y, Vishkin U. An O(n2log n) parallel max-flow algorithm Journal of Algorithms. 3: 128-146. DOI: 10.1016/0196-6774(82)90013-X |
0.396 |
|
| 1982 |
Shiloach Y, Vishkin U. An O(logn) parallel connectivity algorithm Journal of Algorithms. 3: 57-67. DOI: 10.1016/0196-6774(82)90008-6 |
0.396 |
|
| 1981 |
Shiloach Y, Vishkin U. Finding the maximum, merging, and sorting in a parallel computation model Journal of Algorithms. 2: 88-102. DOI: 10.1016/0196-6774(81)90010-9 |
0.323 |
|
| Show low-probability matches. |