His primary scientific interests are in Parallel computing, Garbage collection, Theoretical computer science, Data structure and Java. Much of his study explores Parallel computing relationship to Memory management. His study on Garbage collection is covered under Garbage.
He has included themes like Concurrent zero knowledge, Oracle, Cryptography and Protocol in his Theoretical computer science study. His work carried out in the field of Data structure brings together such families of science as Discrete mathematics, Binary logarithm and Distributed computing. His Java research is multidisciplinary, relying on both Multiprocessing and Reference counting.
The scientist’s investigation covers issues in Garbage collection, Parallel computing, Data structure, Distributed computing and Memory management. Erez Petrank interconnects Heap and Operating system in the investigation of issues within Garbage collection. His studies deal with areas such as Java, Thread, Compiler and Concurrency as well as Parallel computing.
His Data structure study combines topics from a wide range of disciplines, such as Synchronization, Queue, Theoretical computer science and Linked list. His Theoretical computer science research includes elements of Computational complexity theory, Homomorphic encryption, Concurrent zero knowledge and Trapdoor function. In his research, Fault tolerance is intimately related to Shared memory, which falls under the overarching field of Distributed computing.
His primary areas of study are Concurrent data structure, Data structure, Distributed computing, Non-blocking algorithm and Record locking. He has researched Concurrent data structure in several fields, including Tree traversal, Hazard pointer, Transactional memory and Parallel computing. Parallel computing and Thread safety are two areas of study in which Erez Petrank engages in interdisciplinary research.
The study incorporates disciplines such as Computer architecture and Computer network in addition to Data structure. His Distributed computing research incorporates elements of Scalability, Overhead, Double-ended priority queue, Correctness and Shared memory. Erez Petrank combines subjects such as Garbage collection and Programmer with his study of Scheme.
Erez Petrank spends much of his time researching Non-blocking algorithm, Distributed computing, Concurrent data structure, Data structure and Garbage collection. His Non-blocking algorithm study incorporates themes from Double-ended priority queue and Queue management system. His Distributed computing research includes themes of Record locking, Priority queue and Shared memory.
His study in Concurrent data structure is interdisciplinary in nature, drawing from both Dram, Non-volatile memory and Hash table. His research combines Queue and Data structure. Erez Petrank focuses mostly in the field of Garbage collection, narrowing it down to topics relating to Programmer and, in certain cases, Memory management, Manual memory management and Garbage.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Extending Oblivious Transfers Efficiently
Yuval Ishai;Joe Kilian;Kobbi Nissim;Erez Petrank.
international cryptology conference (2003)
Extending Oblivious Transfers Efficiently
Yuval Ishai;Joe Kilian;Kobbi Nissim;Erez Petrank.
international cryptology conference (2003)
Identity Escrow
Joe Kilian;Erez Petrank.
international cryptology conference (1998)
Identity Escrow
Joe Kilian;Erez Petrank.
international cryptology conference (1998)
The hardness of approximation: gap location
Erez Petrank.
Computational Complexity (1994)
The hardness of approximation: gap location
Erez Petrank.
Computational Complexity (1994)
The hardness of approximation: gap location
E. Petrank.
symposium on the theory of computing (1993)
Black-box concurrent zero-knowledge requires ilde {Ω} (logn) rounds
Ran Canetti;Joe Kilian;Erez Petrank;Alon Rosen.
symposium on the theory of computing (2001)
Black-box concurrent zero-knowledge requires ilde {Ω} (logn) rounds
Ran Canetti;Joe Kilian;Erez Petrank;Alon Rosen.
symposium on the theory of computing (2001)
CBC MAC for Real-Time Data Sources
Erez Petrank;Charles Rackoff.
Journal of Cryptology (2000)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
IBM (United States)
Technion – Israel Institute of Technology
Brown University
Weizmann Institute of Science
Bar-Ilan University
Technion – Israel Institute of Technology
University of California, San Diego
Bocconi University
Boston University
Alfréd Rényi Institute of Mathematics
University of Southampton
University of Oxford
Nanjing University of Posts and Telecommunications
University of California, Berkeley
University of Illinois at Urbana-Champaign
Utrecht University
Michigan Technological University
Uppsala University
University of Oxford
University of Utah
University of Clermont Auvergne
Medical College of Wisconsin
University Medical Center Groningen
King's College London
University of Skövde
University of Valencia