- Round-like behavior in multiple disks on a bus Phillip B. Gibbons
- How to Make Personalized Web Browsing Simple, Secure, and Anonymous
- Modeling and optimizing I/O throughput of multiple disks on a bus
- Consistent yet Anonymous Web Access with LPWA Eran Gabber Phillip B. Gibbons David M. Kristol
- Information Processing Letters 93 (2005) 9197 www.elsevier.com/locate/ipl
- DOI: 10.1007/s00224-002-1046-6 Theory Comput. Systems 35, 391432 (2002)
- 0022-0000/02 $35.00 2002 Elsevier Science (USA)
- Cache-and-Query for Wide Area Sensor Databases Amol Deshpande,
- 22 PERVASIVE computing Published by the IEEE CS and IEEE ComSoc 1536-1268/03/$17.00 2003 IEEE S E N S O R A N D A C T U AT O R N E T W O R K S
- Expanded Technical Report. The original version appears In Proceedings of the ACM SIGCOMM Conference on Computer
- Ensuring Spatio-Temporal Consistency in Distributed Networks of Smart Cameras
- Database-Centric Programming for Wide-Area Sensor Systems
- Wavelet Synopses with Error Guarantees Minos Garofalakis Phillip B. Gibbons
- Fractal Prefetching B-Trees: Optimizing Both Cache and Disk Performance
- Congressional Samples for Approximate Answering of Group-By Queries
- Join Synopses for Approximate Query Answering Swarup Acharya Phillip B. Gibbons Viswanath Poosala Sridhar Ramaswamy
- Aqua: A Fast Decision Support System Using Approximate Query Answers
- New Sampling-Based Summary Statistics for Improving Approximate Query Answers
- Fast Incremental Maintenance of Approximate PHILLIP B. GIBBONS
- Bifocal Sampling for Skew-Resistant Join Size Estimation
- Beyond Availability: Towards a Deeper Understanding of Machine Failure Characteristics in Large Distributed Systems
- Room Synchronizations Guy E. Blelloch Perry Cheng
- Post-Mortem Black-Box Correctness Tests for Basic Parallel Data Structures
- Theory Comput. Systems 32, 327359 (1999) 1999 Springer-Verlag
- Algorithmica (1999) 24: 381404 Algorithmica
- Space-Efficient Scheduling of Parallelism with Synchronization Variables
- 1996 InternationalConference on Parallel Processina WorkshoP WHAT GOOD ARE SHARED-MEMORYMODELS?
- THE QUEUE-READ QUEUE-WRITE PRAM MODEL: ACCOUNTING FOR CONTENTION IN PARALLEL ALGORITHMS
- IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 8, NO. 9, SEPTEMBER 1997 943 Accounting for Memory Bank Contention
- TESTING SHARED MEMORIES PHILLIP B. GIBBONS AND EPHRAIM KORACH
- E cient Low-Contention Parallel Algorithms Phillip B. Gibbons
- The Connectivity and Fault-Tolerance of the Internet Topology Christopher R. Palmer Georgos Siganos Michalis Faloutsos
- On Secure and Pseudonymous Client-Relationships with Multiple Servers
- Fast Incremental Maintenance of Approximate Histograms Phillip B. Gibbons Yossi Matias Viswanath Poosala
- Design and Implementation of the Lucent Personalized Web Assistant (LPWA)
- The ALqua Approximate Query Answering System Swar,up Acharya Phillip B. Gibbons Viswanath Poosala Sridhar Ramaswamy*
- IrisNet: An Architecture for Internet-scale Sensing Services
- Scheduling Space-Sharing for Internet Advertising Micah Adler Phillip B. Gibbonsy Yossi Matiasz
- IrisNet: Internet-scale Resource-Intensive Sensor Services Amol Deshpande,
- Distinct Sampling for Highly-Accurate Answers to Distinct Values Queries and Event Reports
- To appear in THEORETICAL COMPUTER SCIENCE, 1997. Copyright Elsevier The Queue-Read Queue-Write
- Distributed Streams Algorithms for Sliding Windows
- Distributed Streams Algorithms for Sliding Windows Phillip B. Gibbons
- Estimating Simple Functions on the Union of Data Streams
- Demo Abstract: Claytronics Highly Scalable Communications, Sensing, and Actuation Networks
- ANF: A Fast and Scalable Tool for Data Mining in Massive Graphs-
- A Distributed Filtering Architecture for Multimedia Sensors , Phillip B. Gibbons
