- Data-Centric Reconfiguration with Network-Attached Disks Alexander Shraer
- Challenges in Evaluating Distributed Algorithms Idit Keidar
- Abstract--This paper addresses cache organization in Chip Multiprocessor (CMPs). We introduce Nahalal, a novel non-uniform cache (NUCA) topology that enables fast access to shared data for all processors, while preserving the vicinity of
- How to Choose a Timing Model? Idit Keidar Alexander Shraer
- Exposing and Eliminating Vulnerabilities to Denial of Service Attacks in Secure Gossip-Based Multicast
- Towards Survivability of Application-Level Multicast Gal Badishi
- Scalable Real-time Gateway Assignment in Mobile Mesh Networks
- Byzantine Disk Paxos Optimal Resilience with Byzantine Shared Memory
- Exposing and Eliminating Vulnerabilities to Denial of Service Attacks in Secure GossipBased Multicast
- Dynamic Voting for Consistent Primary Components 1 Danny Dolev Idit Keidar Esti Yeger Lotem
- Scalable Flat-Combining Based Synchronous Queues
- Defending Systems Against Application-Level Denial of Service Attacks
- Virtual Synchrony Semantics: A Client -Server Implementation
- A ClientServer Oriented Algorithm for Virtually Synchronous Group Membership in WANs \Lambda
- WaitFree Regular Storage from Byzantine Components Ittai Abraham # Gregory Chockler + Idit Keidar # Dahlia Malkhi
- EquiCast: Scalable Multicast with Selfish Users Idit Keidar
- Utilizing Shared Data in Chip Multiprocessors with the Nahalal Architecture
- Araneola: A Scalable Reliable Multicast System for Dynamic Environments Roie Melamed
- Evaluating the Running Time of a Communication Round over the Internet
- Towards Survivability of ApplicationLevel Multicast Gal Badishi
- QoS Preserving Totally Ordered Multicast Ziv BarJoseph
- Octopus: A Fault-Tolerant and Efficient Ad-hoc Routing Protocol Roie Melamed
- Do not Crawl in the DUST: Different URLs with Similar Text Extended Abstract
- Abstract --A new generation of high-performance engines now combine graphics-oriented parallel processors with a cache
- Nomadic Service Points Edward Bortnikov Israel Cidon Idit Keidar
- How to Choose a Timing Model? Idit Keidar Alexander Shraer
- Failure Detectors in Omission Failure Environments Danny Dolev \Lambda Roy Friedman y Idit Keidar z Dahlia Malkhi x
- SUPPORTINGGROUPWARE IN MOBILENETWORKS Israel Cidon
- Byzantine Disk Paxos Optimal Resilience with Byzantine Shared Memory
- SUPPORTING GROUPWARE IN MOBILE NETWORKS Israel Cidon
- Tolerant Value Speculation in Coarse-Grain Streaming Computations Nathaniel Azuelos, Idit Keidar
- Scalable Load-Distance Balancing in Large Networks Edward Bortnikov Israel Cidon Idit Keidar
- Byzantine Resilient Random Membership Sampling Edward Bortnikov1
- Nomadic Service Points Edward Bortnikov Israel Cidon Idit Keidar
- Dynamic Voting for Consistent Primary Components \Lambda Esti Yeger Lotem
- Exposing and Eliminating Vulnerabilities to Denial of Service Attacks in Secure GossipBased Multicast #
- Evaluating Unstructured Peer-to-Peer Lookup Overlays Idit Keidar
- Do Not Crawl in the DUST: Different URLs with Similar Text
- Moshe: A Group Membership Service for WANs Idit Keidar
- Octopus: A Fault-Tolerant and Efficient Ad-hoc Routing Protocol Roie Melamed
- EarlyDelivery Dynamic Atomic Broadcast (Extended Abstract) #
- CachingEnhanced Scalable Reliable Multicast Carolos Livadas
- An InheritanceBased Technique for Building Simulation Proofs Incrementally
- Reliable Collaboration Using Unreliable ALEXANDER SHRAER
- Understanding and Mitigating the Effects of DenialofService Attacks on Secure
- Evaluating the Running Time of a Communication Round over the Internet
- 1. Challenges in Evaluating Distributed Idit Keidar
- Optimistic Virtual Synchrony \Lambda Jeremy Sussman
- Efficient Dynamic Aggregation Yitzhak Birk, Idit Keidar, Liran Liss, and Assaf Schuster
- Wait-Free Regular Storage from Byzantine Components Ittai Abraham
- Evaluating Unstructured PeertoPeer Lookup Overlays Idit Keidar
- Dynamic Service Management in Infrastructure-Based Mobile Networks
- Correctness of Gossip-Based Membership under Message Loss
- Timeliness, Failure-Detectors, and Consensus Performance
- ACM SIGACT News Distributed Computing Column 3 Sergio Rajsbaum
- Exposing and Eliminating Vulnerabilities to Denial of Service Attacks in Secure GossipBased
- Nomadic Service Points Edward Bortnikov Israel Cidon Idit Keidar
- Byzantine Disk Paxos: Optimal Resilience with Byzantine Shared Memory
- How to Choose a Timing Model? Idit Keidar and Alexander Shraer
- Reliable Distributed Storage A Research Perspective
- Designing a CachingBased Reliable Multicast Protocol Carolos Livadas Idit Keidar Nancy A. Lynch
- EquiCast: Scalable Multicast with Selfish Users # Idit Keidar
- Idit Keidar Curriculum Vitae July 4, 2011
- Abstract--This paper addresses cache organization in Chip Multiprocessors (CMPs). We show that in CMP systems it is
- Dynamic Atomic Storage Without Consensus Marcos K. Aguilera
- Power Reduction Techniques for Networks-on-Chip Amit Berman
- Fail-Aware Untrusted Storage Christian Cachin
- Deleting Files in the Celeste Peer-to-Peer Storage System Gal Badishi
- Fail-Aware Untrusted Storage Christian Cachin
- Moshe: A Group Membership Service for WANs Idit Keidar
- Keeping DenialofService Attackers in the Dark Gal Badishi 1 , Amir Herzberg 2 , and Idit Keidar 1
- An Inheritance-Based Technique for Building Simulation Proofs Incrementally
- Performance Evaluation of Distributed Algortihms over the Internet
- 1. Open Questions on Consensus Performance in Well-Behaved Runs
- On the Cost of Fault-Tolerant Consensus When There Are No Faults { A Tutorial
- Octopus: A FaultTolerant and Efficient Adhoc Routing Protocol Roie Melamed
- Fault Tolerant Video on Demand Services \Lambda Tal Anker Danny Dolev Idit Keidar
- Early-Delivery Dynamic Atomic Broadcast Ziv Bar-Joseph Idit Keidar
- Nomadic Service Assignment Edward Bortnikov Israel Cidon Idit Keidar
- MaGMA: Mobility and Group Management Architecture for RealTime Collaborative Applications #
- Availability Study of Dynamic Voting Algorithms Kyle W. Ingols
- Want Scalable Computing? Speculate! # Idit Keidar
- On Formal Modeling of Agent Computations Tadashi Araragi 1 , Paul Attie 2 3 , Idit Keidar 2 , Kiyoshi Kogure 1 ,
- Discouraging Selfishness in Lossy Peer-to-Peer Networks
- A VIRTUALLY SYNCHRONOUS GROUP MULTICAST ALGORITHM FOR WANS: FORMAL APPROACH
- Do Not Crawl In The DUST:Do Not Crawl In The DUST: Different URLS, Similar TextDifferent URLS, Similar Text
- On Avoiding Spare Aborts in Transactional Memory Idit Keidar Dmitri Perelman
- Challenges in Evaluating Distributed Algorithms Idit Keidar
- The Need for Realistic Failure Models in Protocol Design Idit Keidar
- Group Communication Specifications: A Comprehensive Study Roman Vitenberg
- Availability Study of Dynamic Voting Algorithms Kyle Ingols
- A Simple Proof of the Uniform Consensus Synchronous Lower Bound
- Designing a Caching-Based Reliable Multicast Protocol Carolos Livadas Idit Keidar Nancy A. Lynch
- Group Communication Specifications: A Comprehensive Study
- Distributed Clustering for Robust Aggregation in Large Networks Ittay Eyal Idit Keidar Raphael Rom
- Improving Efficiency and Enhancing Concurrency of Untrusted Storage Christian Cachin
- Availability Study of Dynamic Voting Algorithms Kyle Ingols Idit Keidar
- Decentralized Electronic Mail Sivan Bercovici, Yaniv Frishman
- Caching-Enhanced Scalable Reliable Multicast Carolos Livadas
- IMPOSSIBILITY RESULTS AND LOWER BOUNDS FOR CONSENSUS UNDER LINK FAILURES
- A ClientServer Approach to Virtually Synchronous Group Multicast: Speci\Thetacations and Algorithms
- Group Communication Speci cations: A Comprehensive Study
- A ClientServer Approach to Virtually Synchronous Group Multicast: Specifications, Algorithms, and Proofs
- D M I T R I P E R E L M A N I D I T K E I D A R
- How to Build a Dam: Fighting Application-Level DoS Attacks Gal Badishi
- Supporting Groupware in Mobile Networks
- Failure Detectors in Omission Failure Environments \Lambda Danny Dolev y Roy Friedman z Idit Keidar y Dahlia Malkhi x
- A Simple Proof of the Uniform Consensus Synchronous Lower Bound
- Timeliness, FailureDetectors, and Consensus Performance Idit Keidar
- How to Choose a Timing Model? Idit Keidar Alexander Shraer
- Distributed ith the advent of storage area network
- SMV: Selective Multi-Versioning STM Dmitri Perelman Anton Bishevsky Oleg Litmanovich Idit Keidar
- A VIRTUALLY SYNCHRONOUS GROUP MULTICAST ALGORITHM FOR WANS: FORMAL APPROACH #
- Byzantine Disk Paxos: Optimal Resilience with Byzantine Shared Memory #
- Optimistic Virtual Synchrony Jeremy Sussman \Lambda Idit Keidar y Keith Marzullo z
- Xlans ---A Graphical Display Communication Protocols
- Poster Abstract: A QoS WMN with Mobility Support Edward Bortnikov Israel Cidon Idit Keidar Tal Kol Arkady Vaisman
- Deleting Files in the Celeste Peer-to-Peer Storage System Gal Badishi
- Timeliness, Failure-Detectors, and Consensus Performance Idit Keidar
- On Avoiding Spare Aborts in Transactional Memory Idit Keidar
- Veracity Radius -Capturing the Locality of Distributed Computations Yitzhak Birk
- Araneola: A Scalable Reliable Multicast System for Dynamic Environments
- An Inheritance-Based Technique for Building Simulation Proofs Incrementally
- Optimal Resilience Wait-Free Storage from Byzantine Components: Inherent Costs and Solutions
- Araneola: A Scalable Reliable Multicast System for Dynamic Environments Roie Melamed
- A General Framework for Highly Available Services Based on Group Communication
- Keeping Denial-of-Service Attackers in the Dark Gal Badishi1
- Venus: Verification for Untrusted Cloud Storage Alexander Shraer
- Byzantine Resilient Random Membership Sampling Edward Bortnikov1
- SIAM J. COMPUT. c 2010 Society for Industrial and Applied Mathematics Vol. 39, No. 8, pp. 38303859
- SMV: Selective Multi-Versioning STM Dmitri Perelman
- On Maintaining Multiple Versions in STM Dmitri Perelman
- Dynamic Atomic Storage Without Consensus Marcos K. Aguilera
- IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES
- Order is Power: Selective Packet Interleaving for Energy Efficient Networks-on-Chip
- Sources of Instability in Data Center Multicast Dmitry Basin
- On Maintaining Multiple Versions in STM Dmitri Perelman
- Abstract--In the current deep sub-micron age, interconnect reliability is a subject of major concern, and is crucial for a
- Transactifying Apache's Cache Module Haggai Eran
- IEEE COMPUTER ARCHITECTURE LETTER 1 Many-Core vs. Many-Thread Machines
- EquiCast: Scalable Multicast with Selfish Idit Keidar
- Fork Sequential Consistency is Blocking Christian Cachin
- Discouraging Selfishness in Lossy Peer-to-Peer Networks Alex Friedman and Idit Keidar
- An Empirical Study of Denial of Service Mitigation Techniques Gal Badishi
- Scalable Load-Distance Balancing Edward Bortnikov Israel Cidon Idit Keidar
- Keeping Denial-of-Service Attackers in the Dark Gal Badishi, Amir Herzberg, and Idit Keidar
- Local On-Line Maintenance of Scalable Pub/Sub Infrastructure Alexander Shraer
- Distributed Computing manuscript No. (will be inserted by the editor)
- Want Scalable Computing? Speculate! Idit Keidar
- Timeliness, Failure-Detectors, and Consensus Performance Idit Keidar
- Exposing and Eliminating Vulnerabilities to Denial of Service Attacks in Secure Gossip-Based
- Zooming in on Network-on-Chip Architectures Israel Cidon
- Exposing and Eliminating Vulnerabilities to Denial of Service Attacks in Secure Gossip-Based Multicast
- The Need for Realistic Failure Models in Protocol Design Idit Keidar
- A Framework for Highly Available Services Based on Group Communication
- Scalable Services for Dynamic Wide-Area Environments
- Do Not Crawl in the DUST: Different URLs with Similar Text
- Beaver on IPSec -Protection from DoS Attacks
- EquiCast: Scalable Multicast with Selfish Users Idit Keidar Roie Melamed Ariel Orda
- Nomadic Service Points Edward Bortnikov Israel Cidon Idit Keidar
- Do Not Crawl in the dust: Different URLs with Similar Text
- Improving Denial of Service Resistance using Dynamic Local Adaptations
- MaGMA: Mobility and Group Management Architecture for Real-Time Collaborative Applications
- Moshe: A Group Membership Service for WANs Idit Keidar
- W I N T E R 2 0 1 0 -2 0 1 1 I D I T K E I D A R
- SMV: Selective Multi-Versioning STM Dmitri Perelman , Anton Byshevsky, Oleg Litmanovich, and Idit Keidar
- LiMoSense Live Monitoring in Dynamic Sensor Networks
- CAF E: Scalable Task Pools with Adjustable Fairness and Contention
- IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES
- Dynamic Computations in Ever-Changing Networks Invited Talk Abstract
- Distrib. Comput. DOI 10.1007/s00446-011-0143-7
- W I N T E R 2 0 1 1 -2 0 1 2 I D I T K E I D A R
- CAF E: Scalable Task Pools with Adjustable Fairness and Contention
