Uzi Vishkin

ORCID

Publication Activity (10 Years)

Years Active: 1981-2023
Publications (10 Years): 14

Top Venues

Publications

Ananth Hari, Uzi Vishkin
Empirical Challenge for NC Theory. CoRR (2023)
Ananth Hari, Uzi Vishkin
Empirical Challenge for NC Theory (Abstract). HOPC@SPAA (2023)
Uzi Vishkin
Beyond worst-case analysis: observed low depth for a P-complete problem. PMAM@PPoPP (2022)
Uzi Vishkin
On the model of computation: counterpoint. Commun. ACM 65 (9) (2022)
Michael Ford, Ananth Hari, Oscar Rodriguez, Junyan Xu, Justin Lack, Cihan Oguz, Yu Zhang, Sarah Weber, Mary Magliocco, Jason Barnett, Sandhya Xirasagar, Smilee Samuel, Luisa Imberti, Paolo Bonfanti, Andrea Biondi, Clifton L. Dalgard, Stephen J. Chanock, Lindsey Rosen, Steven Holland, Helen Su, Luigi Notarangelo, Uzi Vishkin, Corey Watson, Süleyman Cenk Sahinalp
ImmunoTyper-SR: A Novel Computational Approach for Genotyping Immunoglobulin Heavy Chain Variable Genes Using Short Read Data. RECOMB (2022)
Avi Schwarzschild, Eitan Borgnia, Arjun Gupta, Furong Huang, Uzi Vishkin, Micah Goldblum, Tom Goldstein
Can You Learn an Algorithm? Generalizing from Easy to Hard Problems with Recurrent Networks. NeurIPS (2021)
Guy E. Blelloch, William J. Dally, Margaret Martonosi, Uzi Vishkin, Katherine A. Yelick
SPAA'21 Panel Paper: Architecture-Friendly Algorithms versus Algorithm-Friendly Architectures. SPAA (2021)
Avi Schwarzschild, Eitan Borgnia, Arjun Gupta, Furong Huang, Uzi Vishkin, Micah Goldblum, Tom Goldstein
Can You Learn an Algorithm? Generalizing from Easy to Hard Problems with Recurrent Networks. CoRR (2021)
James Alexander Edwards, Uzi Vishkin
Study of Fine-grained Nested Parallelism in CDCL SAT Solvers. ACM Trans. Parallel Comput. 8 (3) (2021)
Dana Dachman-Soled, Chang Liu, Charalampos Papamanthou, Elaine Shi, Uzi Vishkin
Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness. J. Cryptol. 32 (3) (2019)
James Alexander Edwards, Uzi Vishkin
Linking parallel algorithmic thinking to many-core memory systems and speedups for boosted decision trees. MEMSYS (2018)
Fady Ghanim, Uzi Vishkin, Rajeev Barua
Easy PRAM-Based High-Performance Parallel Programming with ICE. IEEE Trans. Parallel Distributed Syst. 29 (2) (2018)
Fady Ghanim, Rajeev Barua, Uzi Vishkin
POSTER: Easy PRAM-based High-Performance Parallel Programming with ICE. PACT (2016)
James Alexander Edwards, Uzi Vishkin
FFT on XMT: Case Study of a Bandwidth-Intensive Regular Algorithm on a Highly-Parallel Many Core. IPDPS Workshops (2016)
Dana Dachman-Soled, Chang Liu, Charalampos Papamanthou, Elaine Shi, Uzi Vishkin
Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness. ASIACRYPT (1) (2015)
Dana Dachman-Soled, Chang Liu, Charalampos Papamanthou, Elaine Shi, Uzi Vishkin
Oblivious Network RAM. IACR Cryptol. ePrint Arch. 2015 (2015)
Alexandros Tzannes, George C. Caragea, Uzi Vishkin, Rajeev Barua
Lazy Scheduling: A Runtime Adaptive Scheduler for Declarative Parallelism. ACM Trans. Program. Lang. Syst. 36 (3) (2014)
James Alexander Edwards, Uzi Vishkin
Parallel algorithms for Burrows-Wheeler compression and decompression. Theor. Comput. Sci. 525 (2014)
Uzi Vishkin
Is multicore hardware for general-purpose parallel processing broken? Commun. ACM 57 (4) (2014)
James Alexander Edwards, Uzi Vishkin
Brief announcement: truly parallel burrows-wheeler compression and decompression. SPAA (2013)
James Alexander Edwards, Uzi Vishkin
Better speedups using simpler parallel programming for graph connectivity and biconnectivity. PMAM (2012)
James Alexander Edwards, Uzi Vishkin
Brief announcement: speedups for parallel graph triconnectivity. SPAA (2012)
Uzi Vishkin
Using simple abstraction to reinvent computing for parallelism. Commun. ACM 54 (1) (2011)
Fuat Keceli, Alexandros Tzannes, George C. Caragea, Rajeev Barua, Uzi Vishkin
Toolchain for Programming, Simulating and Studying the XMT Many-Core Architecture. IPDPS Workshops (2011)
Fuat Keceli, Tali Moreshet, Uzi Vishkin
Power-Performance Comparison of Single-Task Driven Many-Cores. ICPADS (2011)
Alexandros Tzannes, Rajeev Barua, Uzi Vishkin
Improving Run-Time Scheduling for General-Purpose Parallel Code. PACT (2011)
Yves Robert, William J. Dally, Jack J. Dongarra, Satoshi Matsuoka, Robert Schreiber, Horst D. Simon, Uzi Vishkin
Panel Statement. IPDPS (2011)
George Constantin Caragea, Uzi Vishkin
Brief announcement: better speedups for parallel max-flow. SPAA (2011)
George C. Caragea, Alexandros Tzannes, Fuat Keceli, Rajeev Barua, Uzi Vishkin
Resource-Aware Compiler Prefetching for Fine-Grained Many-Cores. Int. J. Parallel Program. 39 (5) (2011)
Michael N. Horak, Steven M. Nowick, Matthew Carlberg, Uzi Vishkin
A Low-Overhead Asynchronous Interconnection Network for GALS Chip Multiprocessors. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 30 (4) (2011)
George C. Caragea, Alexandros Tzannes, Fuat Keceli, Rajeev Barua, Uzi Vishkin
Resource-Aware Compiler Prefetching for Many-Cores. ISPDC (2010)
Fuat Keceli, Tali Moreshet, Uzi Vishkin
Thermal Management of a Many-Core Processor under Fine-Grained Parallelism. Euro-Par Workshops (1) (2010)
Alexandros Tzannes, George C. Caragea, Rajeev Barua, Uzi Vishkin
Lazy binary-splitting: a run-time adaptive work-stealing scheduler. PPOPP (2010)
Shane Torbert, Uzi Vishkin, Ron Tzur, David J. Ellison
Is teaching parallel algorithmic thinking to high school students possible?: one teacher's experience. SIGCSE (2010)
Michael N. Horak, Steven M. Nowick, Matthew Carlberg, Uzi Vishkin
A Low-Overhead Asynchronous Interconnection Network for GALS Chip Multiprocessors. NOCS (2010)
Aydin O. Balkan, Gang Qu, Uzi Vishkin
Mesh-of-Trees and Alternative Interconnection Networks for Single-Chip Parallelism. IEEE Trans. Very Large Scale Integr. Syst. 17 (10) (2009)
Uzi Vishkin
Algorithmic approach to designing an easy-to-program system: Can it lead to a HW-enhanced programmer's workflow add-on? ICCD (2009)
George C. Caragea, A. Beliz Saybasili, Xingzhi Wen, Uzi Vishkin
Brief announcement: performance potential of an easy-to-program PRAM-on-chip prototype versus state-of-the-art processor. SPAA (2009)
Martti Forsell, H. Peter Hofstee, Ahmed Jerraya, Chris R. Jesshope, Uzi Vishkin, Jesper Larsson Träff
HPPC 2009 Panel: Are Many-Core Computer Vendors on Track? Euro-Par Workshops (2009)
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) (2008)
Thomas M. DuBois, Bryant C. Lee, Yi Wang, Marc Olano, Uzi Vishkin
XMT-GPU: A PRAM Architecture for Graphics Computation. ICPP (2008)
Xingzhi Wen, Uzi Vishkin
Fpga-based prototype of a pram-on-chip processor. Conf. Computing Frontiers (2008)
Aydin O. Balkan, Gang Qu, Uzi Vishkin
An area-efficient high-throughput hybrid interconnection network for single-chip parallel processing. DAC (2008)
Xingzhi Wen, Uzi Vishkin
PRAM-on-chip: first commitment to silicon. SPAA (2007)
Aydin O. Balkan, Michael N. Horak, Gang Qu, Uzi Vishkin
Layout-Accurate Design and Implementation of a High-Throughput Interconnection Network for Single-Chip Parallel Processing. Hot Interconnects (2007)
Uzi Vishkin
Toward Realizing a PRAM-on-a-Chip Vision. Euro-Par Workshops (2007)
Fang Liu, Uzi Vishkin, Stuart D. Milner
Bootstrapping Free-Space Optical Networks. IEEE J. Sel. Areas Commun. 24 (S-12) (2006)
Pei Gu, Uzi Vishkin
Case study of gate-level logic simulation on an extremely fine-grained chip multiprocessor. J. Embed. Comput. 2 (2) (2006)
Aydin O. Balkan, Gang Qu, Uzi Vishkin
A Mesh-of-Trees Interconnection Network for Single-Chip Parallel Processing. ASAP (2006)
Stuart D. Milner, Jaime Llorca, Archana Anibha, Uzi Vishkin
A bootstrapping model for directional wireless networks. IEEE Commun. Lett. 10 (12) (2006)
Fang Liu, Uzi Vishkin, Stuart D. Milner
Bootstrapping Free-Space Optical Networks. IPDPS (2005)
Uzi Vishkin
PRAM-On-Chip: A Quest for Not-So-Obvious Non-obviousness. MFCS (2004)
Aydin O. Balkan, Gang Qu, Uzi Vishkin
Arbitrate-and-move primitives for high throughput on-chip interconnection networks. ISCAS (2) (2004)
Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin
Towards a First Vertical Prototyping of an Extremely Fine-Grained Parallel Programming Approach. Theory Comput. Syst. 36 (5) (2003)
Shay Kutten, David Peleg, Uzi Vishkin
Deterministic Resource Discovery in Distributed Networks. Theory Comput. Syst. 36 (5) (2003)
Uzi Vishkin
Two techniques for reconciling algorithm parallelism with memory constraints. SPAA (2002)
Samir Khuller, Uzi Vishkin, Neal E. Young
A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover CoRR (2002)
Shay Kutten, David Peleg, Uzi Vishkin
Deterministic resource discovery in distributed networks. SPAA (2001)
Uzi Vishkin
What to Do with All this Hardware? (Invited Lecture). CPM (2001)
Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin
Evaluating the XMT Parallel Programming Model. IPDPS (2001)
Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin
Evaluating the XMT Parallel Programming Model. HIPS (2001)
Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin
Towards a first vertical prototyping of an extremely fine-grained parallel programming approach. SPAA (2001)
Uzi Vishkin
A PRAM-on-Chip Vision (invited abstract). SPIRE (2000)
Uzi Vishkin
A no-busy-wait balanced tree parallel algorithmic paradigm. SPAA (2000)
Graham Cormode, Mike Paterson, Süleyman Cenk Sahinalp, Uzi Vishkin
Communication complexity of document exchange. SODA (2000)
Shlomit Dascal, Uzi Vishkin
Experiments With List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism. ACM J. Exp. Algorithmics 5 (2000)
Shlomit Dascal, Uzi Vishkin
Experiments with List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism. WAE (1999)
Yishay Mansour, Noam Nisan, Uzi Vishkin
Trade-offs between Communication Throughput and Parallel Time. J. Complex. 15 (1) (1999)
Uzi Vishkin, Shlomit Dascal, Efraim Berkovich, Joseph Nuzman
Explicit Multi-Threading (XMT) Bridging Models for Instruction Parallelism (Extended Abstract). SPAA (1998)
Silvia M. Müller, Uzi Vishkin
Conflict-Free Access to Multiple Single-Ported Register Files. IPPS (1997)
Uzi Vishkin
From Algorithm Parallelism to Instruction-Level Parallelism: An Encode-Decode Chain Using Prefix-Sum. SPAA (1997)
Uzi Vishkin
Can Parallel Algorithms Enhance Seriel Implementation? Commun. ACM 39 (9) (1996)
Süleyman Cenk Sahinalp, Uzi Vishkin
Efficient Approximate and Dynamic Matching of Patterns Using a Labeling Paradigm (extended abstract). FOCS (1996)
Omer Berkman, Baruch Schieber, Uzi Vishkin
A fast parallel algorithm for finding the convex hull of a sorted point set. Int. J. Comput. Geom. Appl. 6 (2) (1996)
Joseph F. JáJá, Kwan Woo Ryu, Uzi Vishkin
Sorting Strings and Constructing Digital Search Trees in Parallel. Theor. Comput. Sci. 154 (2) (1996)
Rajeev Raman, Uzi Vishkin
Parallel algorithms for database operations and a database operation for parallel algorithms. IPPS (1995)
Omer Berkman, Uzi Vishkin
Almost Fully-parallel Parentheses Matching. Discret. Appl. Math. 57 (1) (1995)
Uzi Vishkin
On a Technique for Parsing a String (Abstract). CPM (1995)
Yossi Matias, Uzi Vishkin
A note on reducing parallel model simulations to integer sorting. IPPS (1995)
Süleyman Cenk Sahinalp, Uzi Vishkin
On a Parallel-Algorithms Method for String Matching Problems. CIAC (1994)
Richard Cole, Uzi Vishkin
On the Detection of Robust Curves. CVGIP Graph. Model. Image Process. 56 (3) (1994)
Joseph F. JáJá, Kwan Woo Ryu, Uzi Vishkin
Sorting Strings and Constructing Digital Search Trees in Parallel. IPPS (1994)
Samir Khuller, Uzi Vishkin, Neal E. Young
A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers. J. Algorithms 17 (2) (1994)
Yishay Mansour, Noam Nisan, Uzi Vishkin
Trade-offs between communication throughput and parallel time. STOC (1994)
Samir Khuller, Uzi Vishkin
Biconnectivity Approximations and Graph Carvings. J. ACM 41 (2) (1994)
Omer Berkman, Joseph F. JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin
Top-Bottom Routing Around a Rectangle is as Easy as Computing Prefix Minima. SIAM J. Comput. 23 (3) (1994)
Gad M. Landau, Uzi Vishkin
Pattern Matching in a Digitized Image. Algorithmica 12 (4/5) (1994)
Uzi Vishkin
Can Parallel Algorithms Enhance Serial Implementation? IPPS (1994)
Rajeev Raman, Uzi Vishkin
Optimal Randomized Parallel Algorithms for Computing the Row Maxima of a Totally Monotone Matrix. SODA (1994)
Samir Khuller, Uzi Vishkin
On the Parallel Complexity of Digraph Reachability. Inf. Process. Lett. 52 (5) (1994)
Michael T. Goodrich, Yossi Matias, Uzi Vishkin
Optimal Parallel Approximation for Prefix Sums and Integer Sorting. SODA (1994)
Omer Berkman, Uzi Vishkin
Finding Level-Ancestors in Trees. J. Comput. Syst. Sci. 48 (2) (1994)
Süleyman Cenk Sahinalp, Uzi Vishkin
Symmetry breaking for suffix tree construction. STOC (1994)
Omer Berkman, Uzi Vishkin
Recursive Star-Tree Parallel Data Structure. SIAM J. Comput. 22 (2) (1993)
Gad M. Landau, Uzi Vishkin
Two Dimensional Pattern Matching in a Digitized Image. CPM (1993)
Omer Berkman, Baruch Schieber, Uzi Vishkin
Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values. J. Algorithms 14 (3) (1993)
Michael T. Goodrich, Yossi Matias, Uzi Vishkin
Approximate Parallel Prefix Computation and its Applications. IPPS (1993)
Samir Khuller, Uzi Vishkin, Neal E. Young
A primal-dual parallel approximation technique applied to weighted set and vertex cover. IPCO (1993)
Omer Berkman, Uzi Vishkin
On Parallel Integer Merging Inf. Comput. 106 (2) (1993)
Amihood Amir, Gad M. Landau, Uzi Vishkin
Efficient Pattern Matching with Scaling. J. Algorithms 13 (1) (1992)

Uzi Vishkin.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Uzi Vishkin