- Broadcast Disks with Polynomial Cost Functions Amotz Bar-Noyy
- Tell Me Who I Am: An Interactive Recommendation System
- Tell Me Who I Am: An Interactive Recommendation System
- Wireless Networks 10, 157168, 2004 2004 Kluwer Academic Publishers. Manufactured in The Netherlands.
- Distrib. Comput. (2006) 18(6): 453460 DOI 10.1007/s00446-005-0127-6
- Distributed Error Confinement Extended Abstract
- Distributed Error Confinement Yossi Azar Shay Kutten Boaz Patt-Shamir
- 492 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 9, NO. 4, AUGUST 2001 Jitter Control in QoS Networks
- Digital Object Identifier (DOI) 10.1007/s00446-003-0101-0 Distrib. Comput. (2004) 14:
- Efficient algorithms for periodic scheduling Amotz Bar-Noy a
- DOI: 10.1007/s00453-005-1182-x Algorithmica (2006) 45: 183208
- Wireless Netw (2006) 12:723731 DOI 10.1007/s11276-006-6531-4
- A Game of Timing and Visibility Ben Gurion University
- A Time Optimal Self-Stabilizing Synchronizer Using A Phase Clock
- Approximate Distributed Top-k Queries Boaz Patt-Shamir
- MST Construction in O(log log n) Communication Rounds (Extended Abstract)
- Jitter-Approximation Tradeoff for Periodic Scheduling Zvika Brakerski
- Collaboration of Untrusting Peers with Changing Interests
- Adaptive Stabilization of Reactive Protocols Shay Kutten1
- Improved Recommendation Systems Extended Abstract
- Distributed Approximate Matching Zvi Lotker
- High Entropy Random Selection Protocols Harry Buhrman
- Video Distribution Under Multiple Constraints EXTENDED ABSTRACT
- Theoretical Computer Science 370 (2007) 254264 www.elsevier.com/locate/tcs
- BUFFER OVERFLOW MANAGEMENT IN QoS SWITCHES ALEXANDER KESSELMAN, ZVI LOTKER, YISHAY MANSOUR,
- RENT, LEASE OR BUY: RANDOMIZED ALGORITHMS FOR MULTISLOPE SKI RENTAL
- Efficient Periodic Scheduling by Trees Amotz Bar-Noy Vladimir Dreizin Boaz Patt-Shamir
- Adaptive Collaboration in Peer-to-Peer Systems (Extended Abstract)
- Tight Bounds for Distributed Selection Fabian Kuhn
- Distributed Coloring in ~O( log n) Bit Rounds
- A Note on Efficient Aggregate Queries in Sensor Networks Preliminary Version
- Buffer Overflows of Merging Streams Alex Kesselman
- Asynchronous Recommendation Systems EXTENDED ABSTRACT
- A Jamming-Resistant MAC Protocol for Single-Hop Wireless Networks
- Multiple Priority, Per Flow, Dual GCRA Rate Controller for ATM Switches
- Improved Distributed Approximate Matching Department of Communication
- Communication-Efficient Probabilistic Quorum Systems for Sensor Networks (Preliminary Abstract)
- Publish and Perish: Definition and Analysis of an n-Person Publication Impact Game
- SIAM J. COMPUT. c 2005 Society for Industrial and Applied Mathematics Vol. 35, No. 1, pp. 120131
- Asynchronous and Fully Self-Stabilizing Time-Adaptive Majority Consensus
- Competitive Analysis of Buffer Policies with SLA Commitments
- Approximate Top-k Queries in Sensor Networks (Extended Abstract)
- General Perfectly Periodic Scheduling Extended Abstract
- Collaborate With Strangers to Find Own Preferences Extended Abstract
- Collaborate With Strangers to Find Own Preferences Baruch Awerbuch
- Optimal Smoothing Schedules for Real-Time Streams EXTENDED ABSTRACT
- 510.6401 Design and Analysis of Algorithms December 26, 2011 Patt-Shamir
- Efficient Periodic Scheduling by Trees Amotz Bar-Noy Vladimir Dreizin Boaz Patt-Shamir
- Buffer Overflows of Merging Streams Alex Kesselman
- Return of the Primal-Dual: Distributed Metric Facility Saurav Pandit Sriram Pemmaraju
- MST Construction in O(log log n) Communication Rounds (Extended Abstract)
- Tight Bounds for Clock Synchronization
- TEL AVIV UNIVERSITY THE IBY AND ALADAR FLEISCHMAN FACULTY OF ENGINEERING
- : 1,..., nC S S ,cos ( )it S i. " -C)Z n .(
- Balls & Bins m -n .) (
- TEL-AVIV UNIVERSITY THE IBY AND ALADAR FLEISCHMAN FACULTY OF ENGINEERING
- 510.6401 Design and Analysis of Algorithms Patt-Shamir
- ,-computationOnline-Ack(Acknowledge , .)Ack ,
- 510.6401 Design and Analysis of Algorithms December 12, 2011 Patt-Shamir
- Local MST Computation with Short Advice Pierre Fraigniaud
- Refined Quorum Systems Rachid Guerraoui
- 510.6401 Design and Analysis of Algorithms November 7, 2011 Patt-Shamir
- Collaborate With Strangers to Find Own Preferences Baruch Awerbuch
- Distributed Coloring in (logn) Bit Rounds Kishore Kothapalli
- TEL AVIV UNIVERSITY The Iby and Aladar Fleischman Faculty of Engineering
- Introduction Advising Schemes for MST
- Multiple Priority, Per Flow, Dual GCRA Rate Controller for ATM Switches
- )Distributed Computing( :":ksss ...21
- Theoretical Computer Science 370 (2007) 254264 www.elsevier.com/locate/tcs
- A Note on Efficient Aggregate Queries in Sensor Networks Preliminary Version
- Refined Quorum Rachid Guerraoui
- -Cache Replacement: 1.Cache hit- 0.
- BUFFER OVERFLOW MANAGEMENT IN QoS SWITCHES ALEXANDER KESSELMAN, ZVI LOTKER, YISHAY MANSOUR,
- Competitive Analysis of Buffer Policies with SLA Commitments
- THE IBY AND ALADAR FLEISCHMAN FACULTY OF ENGINEERING Diagnosis of OSA Syndrome
- Jitter-Approximation Tradeoff for Periodic Scheduling Zvika Brakerski
- 510.6401 Design and Analysis of Algorithms Patt-Shamir
- 510.6401 Design and Analysis of Algorithms Patt-Shamir
- 510.6401 Design and Analysis of Algorithms Patt-Shamir
- Traversals of Object Structures: Specification and Efficient Implementation
- Distributed Selection Fabian Kuhn
- A Jamming-Resistant MAC Protocol for Single-Hop Wireless Networks
- Optimal Smoothing Schedules for Real-Time Streams EXTENDED ABSTRACT
- THE IBY AND ALADER FLEISCHMAN FACULTY OF ENGINEERING
- Improved Distributed Approximate Matching Department of Communication
- Publish and Perish: Definition and Analysis of an n-Person Publication Impact Game
- Video Distribution Under Multiple Constraints EXTENDED ABSTRACT
- Vector Bin Packing with Multiple-Choice Extended Abstract
- A Time Optimal Self-Stabilizing Synchronizer Using A Phase Clock
- 492 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 9, NO. 4, AUGUST 2001 Jitter Control in QoS Networks
- Approximate Top-k Queries in Sensor Networks (Extended Abstract)
- Distributed Discovery of Large Near-Cliques Zvika Brakerski
- Tell Me Who I Am: An Interactive Recommendation System
- Distributed Computation of The Fabian Kuhn, ETH Zurich
- Improved Distributed Approximate Matching Department of Communication
- RENT, LEASE OR BUY: RANDOMIZED ALGORITHMS FOR MULTISLOPE SKI RENTAL
- I d Di t ib t dImproved Distributed Approximate MatchingApproximate Matching
- Improved Recommendation Systems Extended Abstract
- Distributed Error Confinement Yossi Azar Shay Kutten Boaz Patt-Shamir
- Digital Object Identifier (DOI) 10.1007/s00446-003-0101-0 Distrib. Comput. (2004) 14:
- Guolong Lin College of Computer and Information Science
- Distrib. Comput. (2006) 18(6): 453460 DOI 10.1007/s00446-005-0127-6
- TEL AVIV UNIVERSITY THE IBY AND ALADAR FLEISCHMAN FACULTY OF ENGINEERING
- Distance Approximation in Bounded-Degree and General Sparse Graphs
- Wireless Networks 10, 157168, 2004 2004 Kluwer Academic Publishers. Manufactured in The Netherlands.
- Approximation Algorithms for Multiprocessor Scheduling under Uncertainty
- TEL AVIV UNIVERSITY THE IBY AND ALADAR FLEISCHMAN FACULTY OF ENGINEERING
- Self Organizing Lists: Head of List
- TELAVIVUNIVERSITY@-THE IBY AND ALADAR FLEISCHMAN FACULTY OF ENGINEERING
- 510.6401 Design and Analysis of Algorithms January 16, 2011 Patt-Shamir
- Collaborate With Strangers to Find Own Preferences* Extended Abstract
- Tight Bounds for Clock Synchronization [Extended Abstract]
- : ,com.gmail@shnimrod/11/1031 Load Balancing
- A Note on Efficient Aggregate Queries in Sensor Networks Preliminary Version
- : G=(V,E) 'C:V->N (u,v) EC(v) C(u).
- Fast Distributed Scheduling via Primal-Dual Alessandro Panconesi
- 510.6401 Design and Analysis of Algorithms October 31, 2011 Patt-Shamir
- 510.6401 Design and Analysis of Algorithms January 2, 2011 Patt-Shamir
- TEL AVIV UNIVERSITY THE IBY AND ALADAR FLEISCHMAN FACULTY OF ENGINEERING
- Broadcast Disks with Polynomial Cost Functions Amotz Bar-Noyy
- Wireless Netw (2006) 12:723731 DOI 10.1007/s11276-006-6531-4
- Distributed Computation of the Mode Fabian Kuhn
- Tell Me Who I Am: An Interactive Recommendation System
- Adaptive Stabilization of Reactive Protocols Shay Kutten1
- 1.3-( 3COL.) 2.( Clique) : ,G V EK : .G
- '1,22.2.2010 -20, .
- Finding Similar Users in Social Networks EXTENDED ABSTRACT
- 510.6401 Design and Analysis of Algorithms Patt-Shamir
- Asynchronous Recommendation Systems EXTENDED ABSTRACT
- Adaptive Collaboration in Peer-to-Peer Systems (Extended Abstract)
- General Perfectly Periodic Scheduling Extended Abstract
- Distributed and Parallel Algorithms for Weighted Vertex Cover and other Covering Problems
- SIAM J. COMPUT. c 2005 Society for Industrial and Applied Mathematics Vol. 35, No. 1, pp. 120131
- Communication-Efficient Probabilistic Quorum Systems for Sensor Networks (Preliminary Abstract)
- DOI: 10.1007/s00453-005-1182-x Algorithmica (2006) 45: 183208
- Efficient algorithms for periodic scheduling Amotz Bar-Noy a
- Final Presentation: "Jamming Resistant MAC protocol"
- 510.6401 Design and Analysis of Algorithms Patt-Shamir
- RENT, LEASE OR BUY: RANDOMIZED ALGORITHMS FOR MULTISLOPE SKI RENTAL
- )Secretary problem( 1( , -.
- TELAVIVUNIVERSITY@-THE IBY AND ALADAR FLEISCHMAN FACULTY OF ENGINEERING
- 510.6401 Design and Analysis of Algorithms Patt-Shamir
- 0 5-Flow A. 1 1-Flow B.
- 5 (11.22.225) k( Center-K:)
- : 1121121/11 1. onflict resolutionC
- Distributed Approximation of Cellular Coverage Boaz Patt-Shamir1
- Return of the Primal Dual: Distributed Metric
- Approximate Distributed Top-k Queries Boaz Patt-Shamir
- 510.6401 Design and Analysis of Algorithms December 5, 2011 Patt-Shamir
- A Game of Timing and Visibility Ben Gurion University
- Competitive Buffer Management with Packet Dependencies Alex Kesselman Boaz Patt-Shamir Gabriel Scalosub
- ,: . " 1,0. C( , Turing-
- Asynchronous and Fully Self-Stabilizing Time-Adaptive Majority Consensus
- High Entropy Random Selection Protocols Harry Buhrman
- Distributed Error Confinement Extended Abstract
- Distributed Approximate Matching Zvi Lotker
- Collaboration of Untrusting Peers with Changing Interests
