Zobrazeno 1 - 10
of 173
pro vyhledávání: '"Uzi Vishkin"'
Autor:
Uzi Vishkin
Publikováno v:
Communications of the ACM. 65:32-34
Autor:
James L. Edwards, Uzi Vishkin
Publikováno v:
ACM Transactions on Parallel Computing. 8:1-18
Boolean satisfiability (SAT) is an important performance-hungry problem with applications in many problem domains. However, most work on parallelizing SAT solvers has focused on coarse-grained, mostly embarrassing, parallelism. Here, we study fine-gr
Autor:
Uzi Vishkin
Publikováno v:
Proceedings of the Thirteenth International Workshop on Programming Models and Applications for Multicores and Manycores.
Autor:
Michael K.B. Ford, Ananth Hari, Oscar Rodriguez, Junyan Xu, Justin Lack, Cihan Oguz, Yu Zhang, Andrew J. Oler, Ottavia M. Delmonte, Sarah E. Weber, Mary Magliocco, Jason Barnett, Sandhya Xirasagar, Smilee Samuel, Luisa Imberti, Paolo Bonfanti, Andrea Biondi, Clifton L. Dalgard, Stephen Chanock, Lindsey B. Rosen, Steven M. Holland, Helen C. Su, Luigi D. Notarangelo, Uzi Vishkin, Corey T. Watson, S. Cenk Sahinalp, Kerry Dobbs, Elana Shaw, Miranda F. Tompkins, Camille Alba, Adelani Adeleye, Samuel Li, Jingwen Gu
Publikováno v:
Cell Systems. 13:808-816.e5
Human immunoglobulin heavy chain (IGH) locus on chromosome 14 includes more than 40 functional copies of the variable gene (IGHV), which are critical for the structure of antibodies that identify and neutralize pathogenic invaders as a part of the ad
Publikováno v:
SPAA
The current paper provides preliminary statements of the panelists ahead of a panel discussion at the ACM SPAA 2021 conference on the topic: algorithm-friendly architecture versus architecture-friendly algorithms.
Publikováno v:
2012 ASEE Annual Conference & Exposition Proceedings.
Publikováno v:
Journal of Cryptology. 32:941-972
Oblivious RAM (ORAM) is a cryptographic primitive that allows a trusted CPU to securely access untrusted memory, such that the access patterns reveal nothing about sensitive data. ORAM is known to have broad applications in secure processor design an
Publikováno v:
ACM Transactions on Programming Languages and Systems. 36:1-51
Lazy scheduling is a runtime scheduler for task-parallel codes that effectively coarsens parallelism on load conditions in order to significantly reduce its overheads compared to existing approaches, thus enabling the efficient execution of more fine
Autor:
Uzi Vishkin
Publikováno v:
Communications of the ACM. 57:35-39
The current generation of general-purpose multicore hardware must be fixed to support more application domains and to allow cost-effective parallel programming.
Autor:
James A. Edwards, Uzi Vishkin
Publikováno v:
Theoretical Computer Science. 525:10-22
We present work-optimal PRAM algorithms for Burrows-Wheeler compression and decompression of strings over a constant alphabet. For a string of length n, the depth of the compression algorithm is O(log^2n), and the depth of the corresponding decompres