Partially mirrored at: US mirror site for Idit Keidar’s publications

2024 | 2023  | 2022  |  2021  |  2020  |  2019  |  2018  |  2017  |  2020  |  2016  |  2015  |  2014  |  2013  |  2012  |  2011  |  2010  |  2009  |  2008  |  2007  |  2006  |  2005  |  2004  |  2003  |  2002  |  2001  |  2000  |  1999  |  1998  |  1997  |  1996  |  1995  |  1994

2024

• O. Naor and I. Keidar: Expected Linear Round Synchronization: The Missing Link for Linear Byzantine SMR.
  Distributed Computing, January 2024. Previous version in DISC’20.

2023

• R. Fakhoury, A. Braginsky, I. Keidar, and Y. Zuriel: Nova: Safe Off-Heap Memory Allocation and Reclamation.
  In OPODIS’23, Dec 2023. LIPIcs, Volume 286, OPODIS 2023 .
• S. Cohen and I. Keidar: Brief Announcement: Subquadratic Multivalued Asynchronous Byzantine Agreement WHP.
  In DISC’23, October 2023.
• I. Keidar, O. Naor, O. Poupko, E. Shapiro: Cordial Miners: Fast and Efficient Consensus for Every Eventuality.
  In DISC’23, October 2023.
• S. Elias Zada, A. Rinberg, and I. Keidar: Quancurrent: A Concurrent Quantiles Sketch.
  In SPAA’23, June 2023.
• A. Rinberg and I. Keidar: Intermediate Value Linearizability: A Quantitative Correctness Criterion.
  In Journal of the ACM, February 2023. Previous version in DISC’20 (Best Student Paper).

2022

• S. Cohen, I. Keidar, A. Spiegelman: Make Every Word Count: Adaptive BA with Fewer Words.
  In OPODIS’22, December 2020. Previous version: arXiv:2202.09123, February 2022.
• O. Naor, I. Keidar: On Payment Channels in Asynchronous Money Transfer Systems.
  In DISC’22, October 2022. Previous version: arXiv:2202.06693, February 2022.
• A. Rinberg, A. Spiegelman, E. Bortnikov, E. Hillel, I. Keidar, H. Serviansky, and L. Rhodes: Fast Concurrent Data Sketches.
  In ACM Transactions on Parallel Computing Volume 9 Issue 2, June 2022. Article No. 6, pp 1–35. https://doi.org/10.1145/3512758. Previous version in PPoPP 2020.
• L. Zeno, D. Ports, J. Nelson, D. Kim, S. Landau Feibish, I.Keidar, A. Rinberg, A. Rashelbach, I. De-Paula, and M. Silberstein: SwiSh: Distributed Shared State Abstractions for Programmable Switches.
  In NSDI’22, April 2022.
• A. Rinberg, T. Solomon, R. Shlomo, G. Khazma, G. Lushi, I. Keidar, and P. Ta-Shma: DSON: JSON CRDT Using Delta-Mutations For Document Stores. 
  In VLDB’22, Sydney, Australia (and hybrid), September 2022; PVLDB 15(5), pp.\ 1053-1065, Jan 2022.

2021

• G. Assa, H. Meir, G. Gueta, I. Keidar, and A. Spiegelman: Using Nesting to Push the Limits of Transactional Data Structure Libraries.
  In OPODIS 2021, December 2021.
• S. Cohen and I. Keidar: Tame the Wild with Byzantine Linearizability: Reliable Broadcast, Snapshots, and Asset Transfer.
  In DISC 2021, October 2021. arXiv:2102.10597
• I. Keidar, E. Kokoris-Kogias, O. Naor, and A. Spiegelman: All You Need is DAG.
  In PODC 2021, July 2021. Video; arXiv:2102.08325v2.
• A. Spiegelman, I. Keidar, and M. Tennenholtz: Game of Coins.
  In ICDCS 2021, July 2021. Slides; arXiv:1805.08979.
• S. Cohen, I. Keidar, and O. Naor: Byzantine Agreement with Less Communication: Recent Advances.
  ACM SIGACT News 52:1, March 2021.

2020

• A. Rinberg and I. Keidar: Intermediate Value Linearizability: A Quantitative Correctness Criterion.
  In DISC 2020, Oct 2020; DISC Best Student Paper Award.
  Full version: arXiv:2006.12889, video.
• S. Cohen, I. Keidar, and A. Spiegelman: Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP.
  In DISC 2020, Oct 2020.
  Full version: arXiv:2002.06545, video.
• O. Naor and I. Keidar: Expected Linear Round Synchronization: The Missing Link for Linear Byzantine SMR.
  In DISC 2020, Oct 2020.
  Full version: arXiv:2002.07539, February 2020, video.
• D. Yakira, A. Asayag, I. Grayevsky, and I. Keidar: Economically Viable Randomness.
  arXiv:2007.03531, July 2020.
• D. Basin, E. Bortnikov, A. Braginsky, G. Golan-Gueta, E. Hillel, I. Keidar, and M. Sulamy: KiWi: A Key-Value Map for Scalable Real-Time Analytics .
  In ACM Transactions on Parallel Computing (TOPC) Special Issue with selected papers from PPoPP’17, June 2020; article No. 16.
  doi 10.1145/3399718, KiWi code.
• E. Gilad, E. Bortnikov, A. Braginsky, Y. Gottesman, E. Hillel, I. Keidar, N. Moscovici, and R. Shahout: EvenDB: Optimizing Key-Value Storage for Spatial Locality.
  In EuroSys 2020, April 2020.
  EuroSys paper, talk slides, poster, video (short, long).
• A. Rinberg, A. Spiegelman, E. Bortnikov, E. Hillel, I. Keidar, H. Serviansky, and L. Rhodes: Fast Concurrent Data Sketches.
  In 25th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (PPoPP), San Diego, CA, USA, Feb 2020.
  Open-source code (apache incubator), artifact, PPoPP paper, full paper: arXiv:1902.10995.
• G. Sheffi, D. Basin, E. Bortnikov, D. Carmel, and I. Keidar: Scalable Top-K Retrieval with Sparta.
  In 25th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (PPoPP), San Diego, CA, USA, Feb 2020.
• H. Meir, E. Bortnikov, A. Braginsky, D. Basin, Y. Gottesman, E. Hillel, I. Keidar, E. Meir, G. Sheffi, and Y. Zuriel: Oak: A Scalable Off-Heap Allocated Key-Value Map.
  In 25th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (PPoPP), San Diego, CA, USA, Feb 2020.
  Oak repository, talk slides.
• G. Assa, H. Meir, G. Golan-Gueta, I. Keidar, A. Spiegelman: Using Nesting to Push the Limits of Transactional Data Structure Libraries.
  Poster in 25th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (PPoPP), San Diego, CA, USA, Feb 2020.
  Full version: arXiv:2001.00363, PPoPP extended abstract, poster.

2019

• K. Lev-Ari, A. Spiegelman, I. Keidar, and D. Malkhi: FairLedger: A Fair Blockchain Protocol for Financial Institutions.
  In OPODIS 2019.
  Best Paper Award.
• A. Rinberg, A. Spiegelman, E. Bortnikov, E. Hillel, I. Keidar and H. Serviansky: Fast Concurrent Data Sketches.
  arXiv:1902.10995, and brief announcement in PODC 2019; newer version in PPoPP20.

2018

• A. Spiegelman, I. Keidar, and M. Tennenholtz: Game of Coins.
  arXiv:1805.08979.
• A. Berger, I. Keidar, and A. Spiegelman: Integrated Bounds for Disintegrated Storage.
  In 32nd International Symposium on DIStributed Computing (DISC), New Orleans, USA, October 2018. Talk slides.
• E. Bortnikov, A. Braginsky, E. Hillel, I. Keidar, and G. Sheffi: Accordion: Better Memory Organization for LSM Key-Value Stores.
  In 44th International Conference on Very Large Databases (VLDB) Industry Track, Rio De Janeiro, Brazil, August 2018. PVLDB 11:12.
  Talk slides, poster.
• O. Shacham, Y. Gottesman, A. Bergman, E. Bortnikov, E. Hillel, and I. Keidar: Taking Omid to the Clouds: Fast, Scalable Transactions for Real-Time Cloud Analytics.
  In 44th International Conference on Very Large Databases (VLDB) Industry Track, Rio De Janeiro, Brazil, August 2018. PVLDB 11:12.
  paper, talk slides, poster, Apache Incubator Omid.

2017

• N. Kraus, D. Carmel, and I. Keidar: Fishing in the Stream: Similarity Search over Endless Data.
  In 2017 IEEE International Conference on Big Data (BigData), December 2017, Boston, MA, USA.
• N. Shalev, I. Keidar, Y. Weinsberg, Y. Moatti, and E. Ben-Yehuda: WatchIT: Who Watches Your IT Guy?
  In 26th ACM Symp. on Operating Systems Principles (SOSP), Shanghai, China, October 2017.
  paper, poster.
• A. Spiegelman, I. Keidar, and D. Malkhi: Dynamic Reconfiguration: Abstraction and Optimal Asynchronous Solution.
  In 31st Int’l Symp. on Distributed Computing (DISC), Vienna, Austria, October 2017.
• R. Gelashvili, I. Keidar, A. Spiegelman, and R. Wattenhofer: Towards Reduced Instruction Sets for Synchronization.
  Brief Announcement in 31st Int’l Symp. on Distributed Computing (DISC), Vienna, Austria, October 2017.
  arXiv:1705.02808.
• A. Spiegelman and I. Keidar: On Liveness of Dynamic Storage.
  In 24th Int’l Colloquium on Structural Information and Communication Complexity (SIROCCO), Porquerolles, France, June 2017.
• K. Lev-Ari, E. Bortnikov, I. Keidar, and A. Shraer: Composing Ordered Sequential Consistency.
  In Information Processing Letters (IPL), DOI 10.1016/j.ipl.2017.03.004, March 2017.
• O. Shacham, F. Perez-Sorrosal, E. Bortnikov, E. Hillel, I. Keidar, I. Kelly, M. Morel, and S. Paranjpye: Omid, Reloaded: Scalable and Highly-Available Transaction Processing.
  In 15th USENIX Conference on File and Storage Technologies (FAST), Santa Clara, CA, February 2017.
  Download: Apache Incubator Omid.
• D. Basin, E. Bortnikov, A. Braginsky, G. Golan-Gueta, E. Hillel, I. Keidar and M. Sulamy: KiWi: A Key-Value Map for Scalable Real-Time Analytics .
  In 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), Austin, Texas, February 2017.
  Full version in ACM TOPC 2020, KiWi code.

2016

• A. Spiegelman and I. Keidar: Dynamic Atomic Snapshots.
  In 20th Int’l Conf. on Principles of Distributed Systems (OPODIS), Madrid, Spain, December 2016.
• N. Kraus, D. Carmel, I. Keidar, and M. Orenbach: NearBucket-LSH: Efficient Similarity Search in P2P Networks.
  In 9th Int’l Conf. on Similarity Search and Applications (SISAP), Tokyo, Japan, October 2016.
• A. Spiegelman, Y. Cassuto, G. Chockler, and I. Keidar: Space Bounds for Reliable Storage: Fundamental Limits of Coding.
  In ACM Symp. on Principles of Distributed Computing (PODC), Chicago, IL, USA, July 2016.
  Download: PODC’16 paper, OPODIS’15 keynote abstract, talk slides.
• K. Lev-Ari, E. Bortnikov, I. Keidar, and A. Shraer: Modular Composition of Coordination Services.
  In Usenix Annual Technical Conference (ATC), Denver, Co, USA, June 2016.
  Download: ZooNet code. I-Core day talk: video.
• A. Spiegelman, G. Golan-Gueta and I. Keidar: Transactional Data Structure Libraries.
  In 37th annual ACM SIGPLAN Conf. on Programming Language Design and Implementation (PLDI), Santa Barbara, CA, USA, June 2016.
  PLDI 2016 Distinguished Paper.
  Download: paper, talk slides, code (Java version).
• T. Morad, N. Shalev, I. Keidar, A. Kolodny, and U. Weiser: EFS: Energy-Friendly Scheduler for Memory Bandwidth Constrained Systems.
  In Journal of Parallel and Distributed Computing (JPDC) 95, Special Issue on Energy Efficient Multi-Core and Many-Core Systems, pages 3-14 September 2016.
• N. Shalev, E. Harpaz, H. Porat, I. Keidar, and Y. Weinsberg: CSR: Core Surprise Removal in Commodity Operating Systems .
  In 21st Int’l Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS), Atlanta, GA, USA, April 2016.
  Download: paper, poster, talk slides.

2015

• I. Keidar and D. Perelman: Multi-versioning in Transactional Memory.
  Chapter 7 in Transactional Memory; Foundations, Algorithms, Tools, and Applications, LNCS volume 8913, 2015, pages 150-165.
• A. Spiegelman, I. Keidar, and D. Malkhi: Dynamic Reconfiguration: A Tutorial.
  Tutorial, presented in Int’l Conf. on Principles of Distributed Computing(OPODIS), Rennes, France, December 2015.
  Download: paper, talk slides.
• A. Spiegelman, Y. Cassuto, G. Chockler, and I. Keidar: Space Bounds for Reliable Storage: Fundamental Limits of Coding.
  Keynote lecture, presented in Int’l Conf. on Principles of Distributed Computing(OPODIS), Rennes, France, December 2015.
  Long version in PODC 2016.
• K. Lev-Ari, G. Chockler, and I. Keidar: A Constructive Approach for Proving Data Structures’ Linearizability.
  In DISC’15, Tokyo, Japan, October 2015.
• M. Arbel, G. Golan-Gueta, E. Hillel, and I. Keidar: Towards Automatic Lock Removal for Scalable Synchronization.
  In DISC’15, Tokyo, Japan, October 2015.
  Full version available here.
• G. Golan-Gueta, E. Bortnikov, E. Hillel, and I. Keidar: Scaling Concurrent Log-Structured Data Stores.
  In EuroSys’15, Bordeaux, France, April 2015.
  Download: poster (OSDI’14), cLSM implementation in RocksDB
• I. Keidar and D. Perelman: On Avoiding Spare Aborts in Transactional Memory.
  In Springer Theory of Computing Systems (TCS), February 2015.
  Previous version in SPAA 2009.

2014

• K. Lev-Ari, G. Chockler, and I. Keidar: On Correctness of Data Structures under Reads-Write Concurrency.
  In 28th Int’l Symp. on DIStributed Computing (DISC), pages 273-287, October 2014, Austin, Texas.
• S. Patterson, Y. Eldar, and I. Keidar: Distributed Compressed Sensing For Static and Time-Varying Networks.
  IEEE Transactions on Signal Processing, 62(19), pages 4931-4946, 2014.
• I. Eyal, I. Keidar, and R. Rom: LiMoSense – Live Monitoring in Dynamic Sensor Networks.
  In Distributed Computing, 27(5), pages 313-328, April 2014.
  Previous version in ALGOSENSORS’11.
  Talk slides: pptx.
• O. Itzhak, I. Keidar, A. Kolodny, and U. C. Weiser: Performance scalability and dynamic behavior of Parsec benchmarks on many-core processors.
  In 4th Workshop on Systems for Future Multicore Architectures (SFMA 2014), co-located with EuroSys 2014.
• M. Silberstein, B. Ford, I. Keidar, E. Witchel: GPUfs: Integrating a File System with GPUs.
  In ACM Transactions on Computer Systems (TOCS) 32(1), February 2014.
  Earlier version in ASPLOS’13.

2013

• S. Patterson, Y. Eldar, and I. Keidar: Distributed Compressed Sensing in Dynamic Networks.
  In the 1st IEEE Global Conf. on Signal and Information Processing (GlobalSIP’13), December 2013, Austin, Texas.
  Full version (also of ICASSP’13 paper): Distributed Compressed Sensing For Static and Time-Varying Networks, arXiv:1308.6086v1.
• I. Eyal, K. Birman, I. Keidar, and R. van Renesse: Ordering Transactions with Prediction in Distributed Object Store.
  In the 7th W’shop on Large-Scale Distributed Systems and Middleware (LADIS ’13), co-located with the 24th ACM Symp. on Operating Systems Principles (SOSP’13), Farmington, Pennsylvania, November 2013.
  Also in SOSP’13 poster session: poster pdf.
• I. Eyal, I. Keidar, S. Patterson, and R. Rom: In-Network Analytics for Ubiquitous Sensing.
  In the 27th Int’l Symp. on DIStributed Computing (DISC), Lecture Notes in Computer Science Volume 8205, pages 512-526, Jerusalem, Israel, October 2013.
• I. Eyal, F. Junqueira, and I. Keidar: Thinner Clouds with Preallocation.
  In 5th USENIX Workshop on Hot Topics in Cloud Computing (HotCloud ’13), San Jose, CA, June 2013.
• S. Patterson, Y. Eldar, and I. Keidar: Distributed Sparse Signal Recovery For Sensor Networks.
  In 38th Int’l Conf on Acoustics, Speech, and Signal Processing (ICASSP’13), May 2013.
• M. Silberstein, B. Ford, I. Keidar and E. Witchel: GPUfs: Integrating a File System with GPUs.
  In the 18th Int’l Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS`13), Houston, Texas, March 2013.
  Talk slides: pdf.

2012

• N. Azuelos, Y. Etsion, I. Keidar, A. Zaks, and E. Ayguade: Introducing Speculative Optimizations in Task Dataflow with Language Extensions and Runtime Support.
  In Data-Flow Execution Models for Extreme Scale Computing (DFM), in conjunction with PACT’12, September 2012.
• I. Eyal, I. Keidar, S. Patterson, and R. Rom: Global Estimation with Local Communication.
  Tech. Rep. CCIT 809, Technion EE, May 2012.
  Poster in SYSTOR 2012 – the 5th Int’l Systems and Storage Conf., June 2012.
• E. Gidron, I. Keidar, D. Perelman, and Y. Perez: SALSA: Scalable and Low Synchronization NUMA-aware Algorithm for Producer-Consumer Pools.
  In the 24th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA’12), Pittsburgh, Pennsylvania, USA, June 25-27, 2012.
  Talk slides: pptx.
  Full version: Tech. Rep. CCIT 807, Technion EE, Jan 2011.

2011

• I. Eyal, I. Keidar, and R. Rom: Distributed Data Clustering in Sensor Networks.
  In Distributed Computing 24:5, pages 207-222, November 2011. (Previous version in PODC’10.)
  Talk slides: pptx.
• D. Perelman, A. Byshevsky, O. Litmanovich, and I. Keidar: SMV: Selective Multi-Versioning STM.
  In the 25th Int’l Symp. on Distributed Computing (DISC’11), pages 125-140, Rome, Italy, September 2011.
  Full version: Tech. Rep. CCIT 781, Technion EE, January 2011. (Preliminary version in TRANSACT’10, April 2010.)
  Talk slides: pptx, pdf.
• D. Basin, R. Fan, I. Keidar, O. Kiselov, and D. Perelman: CAFE: Scalable Task Pools with Adjustable Fairness and Contention.
  In the 25th Int’l Symp. on Distributed Computing (DISC’11), pages 475-488, Rome, Italy, September 2011.
  Talk slides: pptx.
• I. Eyal, I. Keidar, and R. Rom: LiMoSense – Live Monitoring in Dynamic Sensor Networks .
  In the 7th Int’l Symp. on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS’11), Saarbruecken, Germany, September 2011.
  Full version in Distributed Computing 2014.
  Talk slides: pptx.
• M. Aguilera, I. Keidar, D. Malkhi, and A. Shraer: Dynamic Atomic Storage without Consensus.
  In Journal of the ACM (JACM), 58:2, April 2011. (Previous version in PODC’09.)
  Talk slides: ppt. ACM DL Bibliometrics:
• C. Cachin, I. Keidar, and A. Shraer: Fail-Aware Untrusted Storage.
  In SIAM Journal on Computing (SICOMP) 40:2, pages 493-533, April 2011. (Previous version in DSN’09.)
  Talk slides: ppt.
• N. Azuelos, I. Keidar, and A. Zaks: Tolerant Value Speculation in Coarse-Grain Streaming Computations.
  In the 25th IEEE Int’l Parallel and Distributed Processing Symp. (IPDPS’11), pages 490-501, Anchorage, Alaska, May 2011.
• M. Silberstein and I. Keidar: A Shared File System Abstraction for Heterogeneous Architectures.
  Tech. Rep. CCIT 782, Technion EE, January 2011.

2010

• M. Gurevich and I. Keidar: Correctness of Gossip-Based Membership under Message Loss.
  In SIAM Journal on Computing (SICOMP) 39:8, pages 3830-3859, December 2010. (Previous version in PODC’09.)
  Talk slides: ppt.
• M. Aguilera, I. Keidar, D. Malkhi, J.-P. Martin, and A. Shraer: Reconfiguring Replicated Atomic Storage: A Tutorial.
  In the Bulletin of the European Association for Theoretical Computer Science (BEATCS) 102, pages 84-108, Distributed Computing Column, October 2010.
• A. Shraer, C. Cachin, A. Cidon, I. Keidar, Y. Michalevsky, and D. Shaket: Venus: Verification for Untrusted Cloud Storage.
  In the ACM Cloud Computing Security Workshop (CCSW’10), co-located with the 17th ACM Conf. on Computer and Communications Security (CCS), Chicago, IL, October 2010.
  Talk slides: pptx. ACM DL Bibliometrics:
• Z. Guz, O. Itzhak, I. Keidar, A. Kolodny, A. Mendelson, and U. C. Weiser: Threads vs. Caches: Modeling the Behavior of Parallel Workloads.
  In the 28th IEEE Int’l Conf. on Computer Design (ICCD’10), Amsterdam, Netherlands, October 2010.
• A. Berman, R. Ginosar, and I. Keidar: Order is Power: Selective Packet Interleaving for Energy Efficient Networks-on-Chip.
  In the 18th IEEE/IFIP Int’l Conf. on VLSI and System-on-Chip (VLSI-SoC’10), Madrid, Spain, September 2010.
• D. Basin, K. Birman, I. Keidar, and Y. Vigfusson: Sources of Instability in Data Center Multicast.
  In the 4th ACM SIGOPS/SIGACT W’shop on Large Scale Distributed Systems and Middleware (LADIS’10), Zurich, Switzerland, July 2010.
  Talk slides: pptx.
• A. Shraer, J-P. Martin, D. Malkhi, and I. Keidar: Data-Centric Reconfiguration with Network-Attached Disks.
  In the 4th ACM SIGOPS/SIGACT W’shop on Large Scale Distributed Systems and Middleware (LADIS’10), Zurich, Switzerland, July 2010.
  Talk slides: pptx.
• I. Eyal, I. Keidar, and R. Rom: Distributed Data Classification in Sensor Networks .
  In the 29th ACM Symp. on Principles of Distributed Computing (PODC’10), pages 151-160, Zurich, Switzerland, July 2010.
  Full version in Distributed Computing 2011.
  Talk slides: pptx.
• D. Perelman, R. Fan, and I. Keidar: On Maintaining Multiple Versions in STM.
  In the 29th ACM Symp. on Principles of Distributed Computing (PODC’10), pages 16-25, Zurich, Switzerland, July 2010.
  Full version: Tech. Rep. CCIT 765, Technion EE, May 2010.
  Talk slides: pptx.
• D. Perelman and I. Keidar: SMV: Selective Multi-Versioning STM.
  In the 5th ACM SIGPLAN W’shop on Transactional Computing (TRANSACT’10) , Paris, France, April 2010.
  Full version: Tech. Rep. CCIT 781, Technion EE, Jan 2011.
  Talk slides: pptx, pdf.

2009

• A. Berman and I. Keidar: Low-Overhead Error Detection for Networks-on-Chip.
  In the 27th IEEE Int’l Conf. on Computer Design (ICCD’09), Lake Tahoe, CA, October 2009.
• I. Keidar and D. Perelman: On Avoiding Spare Aborts in Transactional Memory.
  In the 21st ACM Symp. on Parallelism in Algorithms and Architectures (SPAA 09), pages 59-68, Calgary, Canada, August 2009.
  Full version in TCS, 2015.
  pdf (SPAA version), pptx.
• M. Gurevich and I. Keidar: Correctness of Gossip-Based Membership under Message Loss.
  In the 28th ACM Symp. on Principles of Distributed Computing (PODC’09), pages 151-160, Calgary, Canada, August 2009.
  (Full version in SIAM Journal on Computing (SICOMP) December 2010).
  pdf (PODC version), pdf (full version), ppt.
• M. Aguilera, I. Keidar, D. Malkhi, and A. Shraer: Dynamic Atomic Storage Without Consensus.
  In the 28th ACM Symp. on Principles of Distributed Computing (PODC’09), pages 17-25, Calgary, Canada, August 2009.
  Full version in JACM 2011; available as Tech. Rep. CCIT 731, Technion EE, May 2009.
  pdf (PODC version), pdf (full version), ppt.
• C. Cachin, I. Keidar, and A. Shraer: Fail-Aware Untrusted Storage.
  In the 39th IEEE/IFIP Int’l Conf. on Dependable Systems and Networks (DSN), pages 494-503, Estoril, Portugal, June-July 2009.
  Full version in SICOMP 2011.
  pdf (DSN version), pdf (full version), ppt.
• I. Eyal, I. Keidar, and R. Rom: Distributed Clustering for Robust Aggregation in Large Networks.
  In the 5th W’shop on Hot Topics in System Dependability (HotDep’09), co-located with DSN’09, June 2009.
  pdf, ppt.
• C. Cachin, I. Keidar, and A. Shraer: Trusting the Cloud.
  ACM SIGACT News Distributed Computing Column, 40(2), pages 81-86, June 2009.
• H. Eran, O. Lutzky, Z. Guz, and I. Keidar: Transactifying Apache’s Cache Module.
  In SYSTOR 2009 – The Int’l Systems and Storage Conf., May 2009.
• Z. Guz, E. Bolotin, I. Keidar, A. Kolodny, A. Mendelson, and U. Weiser: Many-Core vs. Many-Thread Machines: Stay Away From the Valley.
  In IEEE Computer Architecture Letters (CAL) vol. 8, April 2009.
• G. Chockler, R. Guerraoui, I. Keidar, and M. Vukolic: Reliable Distributed Storage.
  In IEEE Computer 42:4, pages 60-67, April 2009.
• E. Bortnikov, M. Gurevich, I. Keidar, G. Kliot, and A. Shraer: Brahms: Byzantine Resilient Random Membership Sampling.
  In Computer Networks (COMNET) Special Issue on Gossiping in Distributed Systems, 53:13, pages 2340–2359, August 2009.
  (Previous version in PODC’08.)
  pdf, ppt.
• I. Keidar, R. Melamed, and A. Orda: EquiCast: Scalable Multicast with Selfish Users.
  In Computer Networks (COMNET) Special Issue on Gossiping in Distributed Systems, published online March 2009.
  (Previous version in PODC’06.)
  pdf, ppt.
• G. Badishi, G. Caronni, I. Keidar, R. Rom, and G. Scott: Deleting Files in the Celeste Peer-to-Peer Storage System.
  In Journal of Parallel and Distributed Computing (JPDC), published online March 2009.
  (Previous version in SRDS’06.)
• C. Cachin, I. Keidar, and A. Shraer: Fork Sequential Consistency is Blocking.
  In Information Processing Letters (IPL) 109:7, pages 360-364, March 2009.
  (Tech. Rep. CCIT 697, Technion EE, May 2008; CoRR abs/0805.2068.)
• A. Friedman and I. Keidar: Discouraging Selfishness in Lossy Peer-to-Peer Networks.
  Tech. Rep. CCIT 715, Technion EE, January 2009.
• Z. Bar-Yossef, I. Keidar, and U. Schonfeld: Do not Crawl in the DUST: Different URLs with Similar Text.
  In ACM Transactions on the Web (TWEB) 3:1, article 3, January 2009.
  (Previous version in WWW’07.)
• U. Schmid, B. Weiss, and I. Keidar: Impossibility Results and Lower Bounds for Consensus Under Link Failures.
  In SIAM Journal on Computing (SICOMP) 38:5, pages 1912-1951, published online January 2009.

2008

• R. Melamed and I. Keidar: Araneola: A Scalable Reliable Multicast System for Dynamic Environments.
  In Journal of Parallel and Distributed Computing (JPDC) 68:12, pages 1539-1560, December 2008.
• I. Keidar and A. Shraer: How to Choose a Timing Model?
  In IEEE Transactions on Parallel and Distributed Systems (TPDS) 19:10, pages 1367-1380, October 2008.
  (Previous version in DSN’07.)
  pdf, pdf.gz.
• G. Badishi, A. Herzberg, I. Keidar, O. Romanov, and A. Yachin: An Empirical Study of Denial of Service Mitigation Techniques.
  In the 27th IEEE Int’l Symp. on Reliable Distributed Systems (SRDS’08), Naples, Italy, pages 115-124, October 2008.
• E. Bortnikov, M. Gurevich, I. Keidar, G. Kliot, and A. Shraer: Brahms: Byzantine Resilient Random Membership Sampling.
  In the 27th ACM Symp. on Principles of Distributed Computing (PODC’08), pages 145-154, July 2008.
  Full version in COMNET.
  pdf (PODC paper), pdf (long version), ppt.
• Z. Guz, I. Keidar, A. Kolodny, and U. Weiser: Utilizing Shared Data in Chip Multiprocessors with the Nahalal Architecture.
  In the 20th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA’08), special track on Hardware and Software Techniques to Improve the Programmability of Multicore Machines, pages 1-10, June 2008.
  SPAA Best Paper Award.
  pdf, ppt.
• G. Badishi and I. Keidar: Improving Denial of Service Resistance using Dynamic Local Adaptations.
  In the 23rd Annual ACM Symp. on Applied Computing (SAC), Dependable and Adaptive Distributed Systems (DADS) track, pages 2212-2218, Fortaleza, Ceara, Brazil, March 2008.
• C. Cachin, I. Keidar, and A. Shraer: Improving Efficiency and Enhancing Concurrency of Untrusted Storage.
  In the 6th USENIX Conf. on File and Storage Technologies (FAST ’08), work-in-progress (WiP) and poster session, San Jose, CA, February 2008.
• E. Bortnikov, I. Cidon, I. Keidar, T. Kol, and A. Vaisman: A QoS WMN with Mobility Support.
  In ACM SIGMOBILE Mobile Computing and Communications Review (MC2R) 12:1, Special Issue with MobiCom 2007 poster abstracts, pages 46-48, January 2008.
• R. Melamed, I. Keidar, and Y. Barel: Octopus: A Fault-Tolerant and Efficient Ad-hoc Routing Protocol.
  In Wireless Networks (WINET) 14:6, pages 731-743, December 2008.
  pdf, pdf.gz.

2007

• E. Bortnikov, I. Cidon, and I. Keidar: Scalable Real-time Gateway Assignment in Mobile Mesh Networks.
  In ACM CoNEXT ‘2007, New York, December 2007.
• G. Chockler, R. Guerraoui, and I. Keidar: Amnesic Distributed Storage.
  In the 21st Int’l Symp. on Distributed Computing (DISC’07), Lecture Notes in Computer Science Volume 4731, pages 139-151, September 2007.
• E. Bortnikov, I. Cidon, and I. Keidar: Scalable Load-Distance Balancing.
  In the 21st Int’l Symp. on Distributed Computing (DISC’07), Lecture Notes in Computer Science Volume 4731, pages 77-91, September 2007.Presented at the 2nd W’shop on Locality Preserving Distributed Computing Methods (LOCALITY ’07), co-located with PODC’07, August 2007.
  (Full version: Tech. Rep. CCIT 587, Technion EE , May 2006.)
• A. Shraer, S. Bercovici, G. Chockler, I. Keidar, R. Melamed, Y. Tock, and R. Vitenberg: Local Building Blocks for a Scalable Pub/Sub Infrastructure.
  Presented at the 2nd W’shop on Locality Preserving Distributed Computing Methods (LOCALITY ’07), co-located with PODC’07, August 2007.
• G. Badishi, A. Herzberg, and I. Keidar: Keeping Denial-of-Service Attackers in the Dark.
  In IEEE Transactions on Dependable and Secure Computing (TDSC) 4:3, pages 191-204, July-September 2007.
  (Previous version in DISC 2005.)
• E. Bortnikov, I. Cidon, and I. Keidar: Nomadic Service Assignment.
  IEEE Transactions on Mobile Computing (TMC) 6:8, pages 915-928, August 2007.
  (Previous version, entitled Nomadic Service Points, in IEEE INFOCOM 2006.)
  IEEE TMC paper: pdf, pdf.gz. Infocom paper: ps, ps.gz, pdf, pdf.gz.
• I. Keidar and A. Shraer: How to Choose a Timing Model?
  In the 37th IEEE/IFIP Int’l Conf. on Dependable Systems and Networks (DSN), pages 389-398, June 2007.
  Full version in IEEE Transactions on Parallel and Distributed Systems (TPDS).
  DSN paper: ps, ps.gz, pdf, pdf.gz. Full version (TPDS) (pdf).
• A. Shraer, G. Chockler, I. Keidar, R. Melamed, Y. Tock, and R. Vitenberg: Local On-Line Maintenance of Scalable Pub/Sub Infrastructure.
  In the 37th IEEE/IFIP Int’l Conf. on Dependable Systems and Networks (DSN ’07) Fast Abstracts Supplement, pages 408-409, June 2007.
• Z. Guz, I. Keidar, A. Kolodny, and U. Weiser: Nahalal: Cache Organization for Chip Multiprocessors.
  In IEEE Computer Architecture Letters (CAL) 6:1, pages 21-24, May 2007.
  (Longer version: Tech. Rep. CCIT 600, Technion EE , September 2006.)
• Z. Bar-Yossef, I. Keidar, and U. Schonfeld: Do not Crawl in the DUST: Different URLs with Similar Text.
  In the 16th Int’l World Wide Web Conf. (WWW’07), pages 111-120, May 2007.
  Full version (in TWEB) (pdf), WWW’07 paper (pdf).
• R. Gindin, I. Cidon, and I. Keidar: NoC-Based FPGA: Architecture and Routing.
  In the 1st ACM/IEEE Int’l Symp. on Networks-on-Chips (NOCS), pages 253-262, May 2007.
• P. Dutta, R. Guerraoui, and I. Keidar: The Overhead of Consensus Failure Recovery.
  In Distributed Computing 19:5-6, pages 373-386, April 2007, Springer.
• I. Abraham, G. Chockler, I. Keidar, and D. Malkhi: Wait-Free Regular Storage from Byzantine Components.
  In Information Processing Letters (IPL) 101:2, pages 60-65, January 2007.
  ps, ps.gz, pdf, pdf.gz.

2006

• E. Bortnikov, I. Cidon, and I. Keidar: Nomadic Service Points.
  In IEEE INFOCOM 2006, April 2006.
  Full version: IEEE Transactions on Mobile Computing (TMC) 6:8, pages 915-928, August 2007.
  IEEE TMC paper: pdf, pdf.gz. Infocom paper: ps, ps.gz, pdf, pdf.gz.
• P. Pal, P. Rubel, M. Atighetchi, F. Webber, W. Sanders, M. Seri, H. Ramasamy, J. Lyons, T. Courtney, A. Agbaria, M. Cukier, J. Gossett, and I. Keidar: An Architecture for Adaptive Intrusion-Tolerant Applications.
  Software: Practice and Experience (SP&E) 36:12, Special Issue on Experiences with Auto-adaptive and Reconfigurable Systems, pages 1331-1354, October 2006, Wiley.
• G. Badishi, G. Caronni, I. Keidar, R. Rom, and G. Scott: Deleting Files in the Celeste Peer-to-Peer Storage System.
  In the 25th IEEE Symp. on Reliable Distributed Systems (SRDS’06), pages 29-38, October 2006.
  Full version in Journal of Parallel and Distributed Computing (JPDC).
• I. Keidar and A. Schuster: Want Scalable Computing? Speculate!
  In ACM SIGACT News 37(3), Distributed Computing Column 23, pages 59-66, September 2006.
  ps, ps.gz, pdf, pdf.gz.
• Y. Birk, I. Keidar, L. Liss, and A. Schuster: Efficient Dynamic Aggregation.
  In the 20th Int’l Symp. on Distributed Computing (DISC’06), Lecture Notes in Computer Science Volume 4167, pages 90-104, September 2006.
  paper (pdf), talk slides (ppt).
• I. Keidar and A. Shraer: Timeliness, Failure Detectors, and Consensus Performance.
  In the 25th ACM Symp. on Principles of Distributed Computing (PODC’06), pages 169-178, July 2006.
  ps, ps.gz, pdf, pdf.gz, ppt.
• Y. Birk, I. Keidar, L. Liss, A. Schuster, and R. Wolff: Veracity Radius – Capturing the Locality of Distributed Computations.
  In the 25th ACM Symp. on Principles of Distributed Computing (PODC’06), pages 102-111, July 2006.
  pdf, pdf.gz.
• I. Keidar, R. Melamed, and A. Orda: EquiCast: Scalable Multicast with Selfish Users.
  In the 25th ACM Symp. on Principles of Distributed Computing (PODC’06), pages 63-71, July 2006.
  Full version in COMNET.
  ps, ps.gz, pdf, pdf.gz, ppt.
• S. Bercovici, Y. Frishman, I. Keidar, and A. Tal: Decentralized Electronic Mail.
  In proceedings Int’l W’shop on Dynamic Distributed Systems (IWDDS) in conjunction with the 26th Int’l Conf. on Distributed Computing Systems (ICDCS’06), July 2006.
• U. Schonfeld, Z. BarYossef, and I. Keidar: Do not Crawl in the DUST: Different URLs with Similar Text.
  Poster in 15th Int’l World Wide Web Conf. (WWW’06), May 2006.
  (Full version: Tech. Rep. CCIT 601, Technion EE , October 2006.)
  Poster (pdf), short WWW paper (pdf), full version (pdf).
• I. Keidar and R. Melamed: Evaluating Unstructured Peer-to-Peer Lookup Overlays.
  In ACM Symp. on Applied Computing (SAC’06), Dependable and Adaptive Distributed Systems (DADS) Track, pages 675-679, April 2006.
  ps, ps.gz, pdf, pdf.gz.
• I. Abraham, G. Chockler, I. Keidar, and D. Malkhi: Byzantine Disk Paxos: Optimal Resilience with Byzantine Shared Memory.
  In Distributed Computing 18:5, pages 387-408, April 2006, Springer.
  ps, ps.gz, pdf, pdf.gz.
• G. Badishi, I. Keidar, and A. Sasson: Exposing and Eliminating Vulnerabilities to Denial of Service Attacks in Secure Gossip-Based Multicast.
  In IEEE Transactions on Dependable and Secure Computing (TDSC) 3:1, pages 45-61, March 2006.
  ps, ps.gz, pdf, pdf.gz, ppt.

2005

• I. Cidon and I. Keidar: Zooming in on Network-on-Chip Architectures.
  Tech. Rep. CCIT 565, Technion EE , December 2005.
• R. Melamed, I. Keidar, and Y. Barel: Octopus: A Fault-Tolerant and Efficient Ad-hoc Routing Protocol.
  In the 24th IEEE Symp. on Reliable Distributed Systems (SRDS’05), pages 39-49, October 2005.
  ps, ps.gz, pdf, pdf.gz.
• G. Badishi, A. Herzberg, and I. Keidar: Keeping Denial-of-Service Attackers in the Dark.
  In the 19th Int’l Symp. on Distributed Computing (DISC’05), Lecture Notes in Computer Science Volume 3724, pages 18-32, September 2005.
  Full version in IEEE Transactions on Dependable and Secure Computing (TDSC) 4:3, pages 191-204, July 2007.
  DISC version: ps, ps.gz, pdf, pdf.gz.
• G. Badishi, A. Herzberg, and I. Keidar: How to Build a Dam: Fighting Application-Level DoS Attacks.
  In the Int’l Conf. on Dependable Systems and Networks (DSN’05), Fast Abstracts Supplement, June–July, 2005.
  ps, ps.gz, pdf, pdf.gz.
• N. Lavi, I. Cidon, and I. Keidar: MaGMA: Mobility and Group Management Architecture for Real-Time Collaborative Applications.
  In Wiley Journal of Wireless Communications and Mobile Computing (WCMC) 5(7), Special Issue on Mobility, Paging, and Quality of Service Management for Future Wireless Networks, pages 749-772, November 2005.
  ps, ps.gz, pdf, pdf.gz, ppt.

2004

• N. Lavi, I. Cidon, and I. Keidar: Supporting Groupware in Mobile Networks.
  In the 6th IFIP IEEE Int’l Conf. on Mobile and Wireless Communication Networks (MWCN’04), October 2004.
  ps, ps.gz, pdf, pdf.gz, ppt.
• R. Melamed and I. Keidar: Araneola: A Scalable Reliable Multicast System for Dynamic Environments.
  In the 3rd IEEE Int’l Symp. on Network Computing and Applications (IEEE NCA’04), pages 5-14, August-September 2004.
  Full version accepted for publication in Journal of Parallel and Distributed Computing (JPDC).
  Full paper (JPDC): pdf; NCA paper: ps, pdf.
• I. Abraham, G. Chockler, I. Keidar, and D. Malkhi: Byzantine Disk Paxos: Optimal Resilience with Byzantine Shared Memory.
  In the 23rd ACM Symp. on Principles of Distributed Computing (PODC’04), July 2004.
  ps, ps.gz, pdf, pdf.gz.
• G. Badishi, I. Keidar, and A. Sasson: Exposing and Eliminating Vulnerabilities to Denial of Service Attacks in Secure Gossip-Based Multicast.
  In the Int’l Conf. on Dependable Systems and Networks (DSN’04), June-July 2004.
  ps, ps.gz, pdf, pdf.gz, ppt.
• C. Livadas and I. Keidar: Caching-Enhanced Scalable Reliable Multicast.
  In the Int’l Conf. on Dependable Systems and Networks (DSN’04), June-July 2004.
  ps, ps.gz, pdf, pdf.gz.
• G. Badishi, I. Keidar, and R. Melamed: Towards Survivability of Application-Level Multicast .
  In the 2nd Bertinoro W’shop on Future Directions in Distributed Computing (FuDiCo II), June 2004.
  ps, ps.gz, pdf.
• G. Chockler, I. Keidar, and D. Malkhi: Optimal Resilience Wait-Free Storage from Byzantine Components: Inherent Costs and Solutions.
  In the 2nd Bertinoro W’shop on Future Directions in Distributed Computing (FuDiCo II), June 2004.
  ps, ps.gz, pdf.

2003

• I. Keidar: Challenges in Evaluating Distributed Algorithms.
  In Future Directions in Distributed Computing, Lecture Notes in Computer Science Volume 2584, pages 40-44.
  ps, ps.gz, pdf,
• I. Keidar and S. Rajsbaum: Open Questions on Consensus Performance in Well-Behaved Runs.
  In Future Directions in Distributed Computing, Lecture Notes in Computer Science Volume 2584, pages 35-39.
  ps, ps.gz, pdf,
• I. Keidar and S. Rajsbaum: A Simple Proof of the Uniform Consensus Synchronous Lower Bound.
  In Information Processing Letters (IPL) 85(1), pages 47-52, January 2003.
  ps, ps.gz, pdf. pps, pps.gz.

2002

• I. Keidar and R. Khazan: A Virtually Synchronous Group Multicast Algorithm for WANs: Formal Approach.
  In SIAM Journal on Computing (SICOMP) 32(1), pages 78-130, November 2002.
  ps, ps.gz, pdf.
• Z. Bar-Joseph, I. Keidar, and N. Lynch: Early-Delivery Dynamic Atomic Broadcast.
  Extended abstract in the 16th Int’l Symp. on DIStributed Computing (DISC’02), Toulouse, France, October 2002.
  ps, ps.gz, pdf.
  Full version: MIT Tech. Rep. MIT-LCS-TR-840, April 2002.
  ps, ps.gz, pdf.
• I. Keidar, J. Sussman, K. Marzullo, and D. Dolev: Moshe: A Group Membership Service for WANs.
  In ACM Transactions on Computer Systems (TOCS) 20(3), pages 1-48, August 2002.
  ps, ps.gz, pdf, ppt, ppt.gz.
• O. Bakr and I. Keidar: Evaluating the Running Time of a Communication Round over the Internet.
  In the 21st ACM Symp. on Principles of Distributed Computing (PODC’02), Monterey, CA, USA, pages 243-252, July 2002.
  ps, ps.gz, pdf, ppt, ppt.gz.
• I. Keidar: Challenges in Evaluating Distributed Algorithms.
  In the Int’l W’shop on Future Directions in Distributed Computing (FuDiCo), pages 22-25, Bertinoro, Italy, June 2002.
  ps, ps.gz, pdf, pps, pps.gz.
• I. Keidar and K. Marzullo: The Need for Realistic Failure Models in Protocol Design.
  Position paper in the 4th Information Survivability W’shop (ISW) 2001/2002, Vancouver, Canada, March 2002.
  ps, ps.gz, pdf.
• I. Keidar, R. Khazan, N. Lynch, and A. Shvartsman: An Inheritance-Based Technique for Building Simulation Proofs Incrementally.
  In ACM Transactions on Software Engineering and Methodology (TOSEM) 11(1), pages 1-29, January 2002.
  ps, ps.gz, pdf, ppt, ppt.gz.

2001

• I. Keidar and S. Rajsbaum: On the Cost of Fault-Tolerant Consensus When There Are No Faults – A Tutorial.
  MIT Tech. Rep. MIT-LCS-TR-821, May 24, 2001.
  ps, ps.gz, pdf, ppt, ppt.gz.
  Preliminary version in ACM SIGACT News 32(2), Distributed Computing column, pages 45-63, June 2001 (published May 15th, 2001).
• G. Chockler, I. Keidar, and R. Vitenberg: Group Communication Specifications: A Comprehensive Study.
  In ACM Computing Surveys 33(4), pages 1-43, December 2001.
  ps, ps.gz, pdf.
• C. Livadas, I. Keidar, and N. Lynch: Designing a Caching-Based Reliable Multicast Protocol.
  In the Int’l Conf. on Dependable Systems and Networks (DSN’01), Fast Abstracts Supplement, pages B44-B45, July 2001.
  ps, ps.gz, pdf.
• K. Ingols and I. Keidar: Availability Study of Dynamic Voting Algorithms.
  In the 21st IEEE Int’l Conf. on Distributed Computing Systems (ICDCS’01), pages 247-254, April 2001.
  ps, ps.gz, pdf, ppt, ppt.gz.
  (Previous version: MIT Technical Memorandum MIT-LCS-TM-611, November 2000.)
  ps, ps.gz, pdf.
• A. Fekete and I. Keidar: A Framework for Highly Available Services Based on Group Communication.
  In the IEEE Int’l W’shop on Applied Reliable Group Communication (WARGC), held in conjunction with ICDCS’01, pages 57-62, April 2001.
  ps, ps.gz, pdf, ppt, ppt.gz.
  (Previous version: MIT Technical Memorandum MIT-LCS-TM-610, November 2000.)
  ps, ps.gz, pdf.
• I. Keidar: Group Communication.
  Chapter in the Encyclopedia of Distributed Computing, Joseph Urban and Partha Dasgupta, editors, Kluwer Academic Publishers. To be published.
  ps, ps.gz, pdf

2000

• I. Keidar, J. Sussman, K. Marzullo, and D. Dolev: Moshe: A Group Membership Service for WANs.
  MIT Technical Memorandum MIT-LCS-TM-593a, revised September 2000.
  ps, ps.gz, pdf, ppt, ppt.gz.
  (Previous version:
  A Client-Server Oriented Algorithm for Virtually Synchronous Group Membership in WANs.)
  In the 20th Int’l Conf. on Distributed Computing Systems (ICDCS’00), pages 356-365, April 2000.
  ps, ps.gz, pdf.
• Z. Bar-Joseph, I. Keidar, T. Anker, and N. Lynch: QoS Preserving Totally Ordered Multicast.
  In the 5th Int’l Conf. On Principles Of DIstributed Systems (OPODIS’00), pages 143-162, Paris, France, December, 2000.
  ps, ps.gz, pdf.
  (Previous version: MIT Tech. Rep. MIT-LCS-TR-796, January 2000.)
  ps, ps.gz, pdf.
• J. Sussman, I. Keidar, and K. Marzullo: Optimistic Virtual Synchrony.
  In the 19th IEEE Symp. on Reliable Distributed Systems (SRDS’00), pages 42-51, Nurnberg, Germany, October 2000.
  ps, ps.gz, pdf, ppt, ppt.gz.
• I. Keidar, R. Khazan, N. Lynch, and A. Shvartsman: An Inheritance-Based Technique for Building Simulation Proofs Incrementally.
  In the 22nd Int’l Conf. on Software Engineering (ICSE’00), pages 478-487, Limerick, Ireland, June 2000.
  ps, ps.gz, pdf, ppt, ppt.gz.
• I. Keidar and R. Khazan: A Client-Server Approach to Virtually Synchronous Group Multicast: Specifications and Algorithms.
  In the 20th Int’l Conf. on Distributed Computing Systems (ICDCS’00), pages 344-355, April 2000.
  ps, ps.gz, pdf, ppt.
• I. Keidar and D. Dolev: Totally Ordered Broadcast in the Face of Network Partitions.
  Exploiting Group Communication for Replication in Partitionable Networks.
  Chapter 3 of Dependable Network Computing, pages 51-75, D. Avresky Editor, Kluwer Academic Publications. January, 2000.
  ps, ps.gz, pdf.
• T. Araragi, P. Attie, I. Keidar, K. Kogure, V. Luchangco, N. Lynch, and K. Mano: On Formal Modeling of Agent Computations.
  In the 1st NASA W’shop on Formal Approaches to Agent-Based System (FAABS), pages 48-62, April, 2000. Springer Verlag Lecture Notes in Artificial Intelligence 1871.
  ps, ps.gz, pdf.

1999

• I. Keidar and R. Khazan: A Client-Server Approach to Virtually Synchronous Group Multicast: Specifications, Algorithms, and Proofs.
  MIT Tech. Rep. MIT-LCS-TR-794, November 1999.
  ps, ps.gz, pdf.
• J. Sussman, I. Keidar, and K. Marzullo: Optimistic Virtual Synchrony.
  MIT Tech. Rep. MIT-LCS-TR-792, November 1999.
  ps, ps.gz, pdf.
• R. Vitenberg, I. Keidar, G. Chockler, and D. Dolev: Group Communication Specifications: A Comprehensive Study.
  MIT Tech. Rep. MIT-LCS-TR-790, September 1999.
  ps, ps.gz, pdf.
• T. Anker, D. Dolev, and I. Keidar: Fault Tolerant Video-on-Demand Services.
  In the 19th Int’l Conf. on Distributed Computing Systems (ICDCS’99), pages 244-252. June 1999.
  ps, ps.gz, pdf, ppt.

1998

• I. Keidar’s Ph.D. Dissertation: Consistency and High Availability of Information Dissemination in Multi-Processor Networks.
  Institute of Computer Science, The Hebrew University of Jerusalem, Jerusalem, Israel, October, 1998.
  ps, ps.gz, pdf.
• T. Anker, G. Chockler, D. Dolev, and I. Keidar: Scalable Group Membership Services for Novel Applications.
  In Networks in Distributed Computing (DIMACS workshop). Edited by: Marios Mavronicolas, Michael Merritt, and Nir Shavit. DIMACS 45, pages 23-42. American Mathematical Society, 1998.
  ps, ps.gz, pdf.
• I. Keidar and D. Dolev: Increasing the Resilience of Distributed and Replicated Database Systems.
  In the Journal of Computer and System Sciences (JCSS) special issue with selected papers from PODS 1995, 57(3) pages 309-324. December 1998.
  ps, ps.gz, pdf.

1997

• E. Yeger Lotem, I. Keidar, and D. Dolev: Dynamic Voting for Consistent Primary Components.
  In the Sixteenth ACM Symp. on Principles of Distributed Computing (PODC ’97), pages 63-71, August 1997.
  ps, ps.gz, pdf, ppt.
• D. Dolev, R. Friedman, I. Keidar, and D. Malkhi: Failure Detectors in Omission Failure Environments.
  Brief Announcement in the Sixteenth ACM Symp. on Principles of Distributed Computing (PODC ’97), August 1997.
  ps, ps.gz. pdf, Full TR version (previous version).
• T. Anker, G. Chockler, D. Dolev, and I. Keidar: The Caelum Toolkit for CSCW: The Sky is the Limit.
  In the Third Int’l W’shop on Next Generation Information Technologies and Systems (NGITS 97), pages 69-76, June 1997.
  ps, ps.gz, pdf.
• T. Anker, G. Chockler, I. Keidar, M. Rozman, and J. Wexler: Exploiting Group Communication for Highly Available Video-On-Demand Services.
  In proceedings of the 13th Int’l Conf. on Advanced Science and Technology (ICAST97) and the 2nd Int’l Conf. on Multimedia Information Systems (ICMIS 97), pages 265-270, April 1997.
  ps, ps.gz, pdf.

1996

• D. Dolev, R. Friedman, I. Keidar, and D. Malkhi: Failure Detectors in Omission Failure Environments.
  Tech. Rep. 96-1608, of Computer Science, Cornell University. September, 1996.
  Also: Tech. Rep. CS96-13, Institute of Computer Science, The Hebrew University of Jerusalem.
  ps, ps.gz, pdf.
• D. Dolev, I. Keidar, and E. Yeger Lotem: Dynamic Voting for Consistent Primary Components.
  Tech. Rep. CS96-7, Institute of Computer Science, The Hebrew University of Jerusalem, Jerusalem, Israel, June 1996.
  ps, ps.gz, pdf.
• I. Keidar, and D. Dolev: Efficient Message Ordering in Dynamic Networks.
  In the fifteenth ACM Symp. on Principles of Distributed Computing (PODC), May 1996, pages 68-76.
  ps, ps.gz, pdf, ppt.
  (Previous version: Tech. Rep. CS95-5, Institute of Computer Science, The Hebrew University of Jerusalem.)
• G. Chockler, N. Huleihel, I. Keidar, and D. Dolev: Multimedia Multicast Transport Service for Groupware.
  In the TINA Conf. on the Convergence of Telecommunications and Distributed Computing Technologies, September 1996, pages 43-54.
  ps, ps.gz, pdf.
  Full version:
  Supporting Multiple Quality of Service Options with High Performance Groupware.
  Tech. Rep. CS96-3, Institute of Computer Science, The Hebrew University of Jerusalem, March 1996.
  ps, ps.gz pdf,

1995

• I. Keidar and D. Dolev: Increasing the Resilience of Atomic Commit, at No Additional Cost.
  In the 1995 ACM SIGACT-SIGMOD Symp. on Principles of Database Systems (PODS), May 1995, pages 245-254.
  ps, ps.gz, pdf.
  Full version in JCSS, see above.
  (Previous version: Tech. Rep. CS94-18, Institute of Computer Science, The Hebrew University of Jerusalem, October 1994.)

1994

• I. Keidar’s Masters Thesis: A Highly Available Paradigm for Consistent Object Replication.
  Also Tech. Rep. CS95-5, Institute of Computer Science, The Hebrew University of Jerusalem.
  ps, ps.gz, pdf.

 

2021  |  2020  |  2019  |  2018  |  2017  |  2020  |  2016  |  2015  |  2014  |  2013  |  2012  |  2011  |  2010  |  2009  |  2008  |  2007  |  2006  |  2005  |  2004  |  2003  |  2002  |  2001  |  2000  |  1999  |  1998  |  1997  |  1996  |  1995  |  1994