Yehuda Afek | Academic Influence

Yehuda Afek's AcademicInfluence.com Rankings

Yehuda Afek

Computer Science

#2932

World Rank

#3069

Historical Rank

Software Engineering

#328

World Rank

#334

Historical Rank

Database

#8202

World Rank

#8555

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Yehuda Afek's Degrees

Bachelors Computer Science Technion – Israel Institute of Technology
Masters Computer Science Technion – Israel Institute of Technology
PhD Computer Science Technion – Israel Institute of Technology

Similar Degrees You Can Earn

Why Is Yehuda Afek Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Yehuda Afek is an Israeli computer scientist at Tel Aviv University, and is known for his work on network cyber security and fault tolerant distributed computing. Yehuda cofounded Riverhead Networks in 2000, and was the head of the School of Computer Science in Tel Aviv University in 2014–2016.

(See a Problem?)

Yehuda Afek's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Atomic snapshots of shared memory (1990) (425)
A Biological Solution to a Fundamental Distributed Computing Problem (2011) (151)
Memory-Efficient Self Stabilizing Protocols for General Networks (1990) (147)
A Dynamic Convolutional Layer for short rangeweather prediction (2015) (146)
Atomic snapshots of shared memory (1993) (146)
Applying static network protocols to dynamic networks (1987) (138)
Fast concurrent queues for x86 processors (2013) (136)
Lazy caching (1993) (126)
Improved BGP convergence via ghost flushing (2003) (117)
The Local Detection Paradigm and Its Application to Self-Stabilization (1997) (111)
Local stabilizer (1997) (110)
Wait-free made fast (1995) (108)
Time and message bounds for election in synchronous and asynchronous complete networks (1985) (106)
Beeping a maximal independent set (2011) (106)
Self-stabilizing unidirectional network algorithms by power-supply (1997) (95)
Quasi-Linearizability: Relaxed Consistency for Improved Concurrency (2010) (90)
Phantom: a simple and effective flow control scheme (1996) (78)
Long-lived renaming made adaptive (1999) (75)
Long-lived adaptive collect with applications (1999) (73)
Reliable communication over unreliable channels (1994) (72)
A completeness theorem for a class of synchronization objects (1993) (71)
Fast, wait-free (2k-1)-renaming (1999) (66)
End-to-end communication in unreliable networks (1988) (65)
Local management of a global resource in a communication network (1987) (63)
Self-stabilization over unreliable communication media (1993) (58)
Long lived adaptive splitter and applications (2002) (58)
CBTree: A Practical Concurrent Self-Adjusting Search Tree (2012) (54)
Mosaicking of orthorectified aerial images (1998) (53)
Detecting Heavy Flows in the SDN Match and Action Model (2017) (53)
The slide mechanism with applications in dynamic networks (1992) (49)
Improved BGP convergence via ghost flushing (2004) (49)
Wait-free Test-and-Set (Extended Abstract) (1992) (48)
A bounded first-in, first-enabled solution to the l-exclusion problem (1994) (47)
A lazy cache algorithm (1989) (47)
Elections in Anonymous Networks (1994) (47)
Asynchrony from Synchrony (2012) (46)
Computing with faulty shared objects (1995) (43)
Sparser: A Paradigm for Running Distributed Algorithms (1992) (43)
Computing with faulty shared memory (1992) (43)
Disentangling multi-object operations (extended abstract) (1997) (41)
Network anti-spoofing with SDN data plane (2017) (41)
Scalable Producer-Consumer Pools Based on Elimination-Diffraction Trees (2010) (40)
Common2 extended to stacks and unbounded concurrency (2006) (39)
The k-simultaneous consensus problem (2010) (39)
Self-stabilization of the alternating-bit protocol (1989) (38)
Distributed Algorithms for Unidirectional Networks (1994) (38)
Upper and lower bounds for routing schemes in dynamic networks (1989) (37)
Pessimistic Software Lock-Elision (2012) (37)
Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms (1999) (36)
Dynamic bandwidth allocation policies (1996) (36)
Software-improved hardware lock elision (2014) (35)
Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract) (2000) (34)
Consensus power makes (some) sense! (extended abstract) (1994) (34)
Towards Consistency Oblivious Programming (2011) (33)
Slide-The Key to Polynomial End-to-End Communication (1997) (33)
Sampling and Large Flow Detection in SDN (2015) (33)
Cache index-aware memory allocation (2011) (30)
Simple and Efficient Election Algorithms for Anonymous Networks (1989) (29)
Restoration by path concatenation: fast recovery of MPLS paths (2001) (28)
Lowering STM Overhead with Static Analysis (2010) (28)
Programming with hardware lock elision (2013) (28)
Routing with a clue (1999) (27)
Distributed computing building blocks for rational agents (2014) (27)
Election and traversal in unidirectional networks (1984) (26)
On the structure and application of BGP policy atoms (2002) (25)
Detecting global termination conditions in the face of uncertainty (1987) (24)
Fast and scalable rendezvousing (2011) (23)
Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus (2006) (23)
NFV-based IoT Security for Home Networks using MUD (2019) (22)
The Velox Transactional Memory Stack (2010) (21)
Self-Stabilization of the Alternating-Bit Protocol (1989) (20)
The CB tree: a practical concurrent self-adjusting search tree (2014) (20)
Fence-free work stealing on bounded TSO processors (2014) (20)
Brief announcement: view transactions: transactional model with relaxed consistency checks (2010) (19)
Space and Step Complexity Efficient Adaptive Collect (2005) (18)
Bootstrap network resynchronization (extended abstract) (1991) (18)
Bounds on the shared memory requirements for long-lived & adaptive objects (extended abstract) (2000) (18)
Benign Failure Models for Shared Memory (Preliminary Version) (1993) (17)
Mitigating DNS random subdomain DDoS attacks by distinct heavy hitters sketches (2017) (17)
Deterministic Objects: Life Beyond Consensus (2016) (17)
Convergence complexity of optimistic rate based flow control algorithms (extended abstract) (1996) (17)
Restoration by path concatenation: fast recovery of MPLS paths (2001) (17)
The Power of Multimedia: Combining Point-to-Point and Multiaccess Networks (2018) (16)
Adaptive long-lived renaming using bounded memory (1999) (16)
Temporally Bounding TSO for Fence-Free Asymmetric Synchronization (2015) (15)
Amalgamated Lock-Elision (2015) (14)
Space efficient deep packet inspection of compressed web traffic (2012) (14)
Making DPI Engines Resilient to Algorithmic Complexity Attacks (2016) (14)
The Instancy of Snapshots and Commuting Objects (1999) (14)
Routing with a clue (2001) (13)
A Bounded First-In, First-Enabled Solution to the 1-Exclusion Problem (1990) (13)
Zero-Day Signature Extraction for High-Volume Attacks (2019) (13)
Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus (2009) (13)
A simple characterization of asynchronous computations (2015) (12)
NXNSAttack: Recursive DNS Inefficiencies and Vulnerabilities (2020) (12)
MCA2: Multi-Core Architecture for Mitigating Complexity Attacks (2012) (11)
Group Renaming (2008) (11)
Automated signature extraction for high volume attacks (2013) (10)
Orange: multi field openflow based range classifier (2015) (9)
On the complexity of global computation in the presence of link failures: the general case (1993) (9)
From bounded to unbounded concurrency objects and back (2011) (9)
Interrupting snapshots and the Java size method (2009) (8)
The power of multi-objects (extended abstract) (1996) (8)
Synchronization power depends on the register size (1993) (8)
Distributed computing : 27th International Symposium, DISC 2013, Jerusalem, Israel, October 14-18, 2013, proceedings (2013) (8)
Cheating by Duplication: Equilibrium Requires Global Knowledge (2017) (8)
Failure detectors in loosely named systems (2008) (8)
Reduced Hardware Lock Elision (2014) (7)
The Power of Multiobjects (1999) (7)
Efficient Processing of Multi-connection Compressed Web Traffic (2011) (7)
Trainet: a new label switching scheme (2000) (7)
Recursive design of hardware priority queues (2013) (7)
Optimal Time-Space Tradeoff for Shared Memory Leader Election (1997) (7)
Efficient adaptive collect algorithms (2007) (6)
Efficient Distinct Heavy Hitters for DNS DDoS Attack Detection (2016) (6)
Wait-free made fast (Extended Abstract). (1995) (6)
Delimiting the power of bounded size synchronization objects (extended abstract) (1994) (6)
Efficient Lock Free Privatization (2010) (5)
The power of multimedia: combining point-to point and multi-access networks (1988) (5)
Consensus in Equilibrium: Can One Against All Decide Fairly? (2019) (5)
Oblivious Collaboration (2011) (5)
A Wealth of Sub-Consensus Deterministic Objects (2018) (5)
Cross-Entrance Consistent Range Classifier with OpenFlow (2014) (4)
Ranges and cross-entrance consistency with OpenFlow (2014) (4)
The Role of A-priori Information in Networks of Rational Agents (2019) (4)
Demo: NFV-based IoT Security at the ISP Level (2020) (4)
Synchronization power depends on the register size (Preliminary Version) (1993) (3)
Dynamic Fast and Long-Lived Renaming ( Extended Abstract ) (1999) (3)
Optimal Pheromone Utilization (2014) (3)
Eradicating Attacks on the Internal Network with Internal Network Policy (2019) (3)
Holdout SGD: Byzantine Tolerant Federated Learning. (2020) (3)
Mosaicking of Ort horectified Aerial Images (1998) (3)
Selecting a Leader in a Network of Finite State Machines (2018) (3)
DNS Negative Caching in the Wild (2019) (3)
Brief Announcement: Object Oriented Consensus (2017) (3)
The Life in 1-Consensus (2017) (2)
Local Fail-safe Network Reset Procedure (1987) (2)
Distributed Synchronization Protocols for Sdh Networks (1995) (2)
Upper and Lower Bounds for Routing Schemes in Dynamic Networks (Abstract) (1989) (2)
Chips and Boards Through MOSIS (1985) (2)
Interrupting Snapshots and the JavaTM^{\mbox{\tiny TM}} Size() Method (2009) (2)
Renaming and the weakest family of failure detectors (2012) (1)
Coping with context switches in lock-based software transactional memory (2011) (1)
Musical Chairs (2012) (1)
DISTRIBUTED ALGORITHMS FORUNIDIRECTIONAL NETWORKS (1994) (1)
Convergence complexity of optimistic rate based flow control algorithms (brief announcement) (1996) (1)
Long-lived Adaptive Collect with Applications ( Extended Abstract ) (1999) (1)
Less Is More: Consensus Gaps Between Restricted and Unrestricted Objects (2006) (1)
Space Eecient Fair Queuing by Stochastic Memory Multiplexing (1997) (1)
Distributed Computing With the Cloud (2021) (1)
Fast and scalable rendezvousing (2013) (1)
Optimal and Resilient Pheromone Utilization in Ant Foraging (2015) (1)
The Synergy of Finite State Machines (2018) (1)
Evaluating the Addition of Non-Transactional Loads to HTM (2014) (1)
MUDirect: Protecting P2P IoT Devices with MUD (2021) (1)
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, PODC '98, Puerto Vallarta, Mexico, June 28 - July 2, 1998 (1998) (1)
Computing with Faulty Shared Memory (Extended Abstract). (1992) (1)
Object Oriented Consensus (2017) (1)
D C ] 1 0 Ju n 20 11 MIS on the fly ( Extended Abstract ) (2011) (0)
Proceedings of the 27th International Symposium on Distributed Computing - Volume 8205 (2013) (0)
MIS on the fly (2011) (0)
Brief Announcement: The Synergy of Finite State Machines (2017) (0)
Acknowledgment of Reviewers, 2017 (2017) (0)
Sharing and Acquisition of Message-Identifiers in Metropolitan-Area Networks (1989) (0)
Faster task allocation by idle ants (2015) (0)
Idle Ants Have a Role (2015) (0)
Beeping an MIS (2011) (0)
2018 Edsger W. Dijkstra Prize in Distributed Computing (2018) (0)
Session details: Best papers (2011) (0)
Session details: Concurrent objects (2012) (0)
The Bit Complexity of the Predecessor Problem (1997) (0)
Local Stabilizer (Brief Announcement). (1997) (0)
Adaptive Long-Lived RenamingUsing Bounded Memory ( Extended Abstract ) (1999) (0)
Renaming and the weakest family of failure detectors (2012) (0)
2022 Principles of Distributed Computing Doctoral Dissertation Award (2022) (0)
Space E ffi cient Deep Packet Inspection of Compressed Web Tra ffi c (2012) (0)
Beeping a maximal independent set (2012) (0)
The CB tree: a practical concurrent self-adjusting search tree (2014) (0)
A King in every two consecutive tournaments (2019) (0)
Restoration by Path Con atenation : Fast Re overy of MPLS Paths (2001) (0)
Virtual-credit: Efficient end-to-end credit based flow control (1997) (0)
Interrupting snapshots and the Java[superscript TM] size() method (2012) (0)
Acknowledgment to reviewers—2017 (2017) (0)
Brief Announcement: Quasi-Linearizability: Relaxed Consistency for Improved Concurrency (2010) (0)
Session details: Session 7 (2016) (0)

This paper list is powered by the following services:

Other Resources About Yehuda Afek

en.wikipedia.org

What Schools Are Affiliated With Yehuda Afek?

Yehuda Afek is affiliated with the following schools: