- Reachability and distance queries via 2hop labels Edith Cohen \Lambda Eran Halperin y Haim Kaplan y Uri Zwick y
- Aging Through Cascaded Caches: Performance Issues in the Distribution of Web Content
- Finding Interesting Associations without Support Edith Cohen Mayur Datar Shinji Fujiwara Aristides Gionis Piotr Indyk
- BalancedReplication Algorithms for Distribution Trees \Lambda Edith Cohen Haim Kaplan
- E. Tardos. A strongly polynomial algorithm to solve combinatorial linear programs. Oper. Res., 34:250--256, 1986.
- SpatiallyDecaying Aggregation Over a Network: Model and Algorithms
- A Case for Associative Peer to Peer Overlays Edith Cohen
- [16] L. M. Goldschlager, R. A. Shaw, and J. Staples. The maximum flow problem is logspace complete for P. Theor. Comp. Sci., 21:105--111, 1982.
- Predicting and Bypassing EndtoEnd Internet Service Degradations
- SizeEstimation Framework with Applications
- Efficient Estimation Algorithms for Neighborhood Variance and Other Moments
- Exploiting Regularities in Web Traffic Patterns for Cache Replacement
- E#cient Sequences of Trials Edith Cohen # Amos Fiat + Haim Kaplan +
- Performance Aspects Of Distributed Caches Using TTLbased Consistency \Lambda
- Aging Through Cascaded Caches: Performance Issues in the Distribution of Web Content
- The Age Penalty and its Effect on Cache Performance
- Optimal Oblivious Routing in Polynomial Time Yossi Azar # Edith Cohen + Amos Fiat # Haim Kaplan # Harald R
- Refreshment Policies for Web Content Caches Edith Cohen Haim Kaplan
- Search and Replication in Unstructured Peer-to-Peer Networks Edith Cohen
- Approximating Matrix Multiplication for Pattern Recognition Tasks
- Connection Caching Edith Cohen Haim Kaplan Uri Zwick
- Competitive analysis of the LRFU paging algorithm \Lambda Edith Cohen Haim Kaplan Uri Zwick
- Approximating Matrix Multiplication for Pattern Recognition Tasks
- Packet Classification in Large ISPs: Design and Evaluation of Decision Tree Classifiers
- Efficient parallel shortestpaths in digraphs with a separator decomposition
- Perceptrons http://www.research.att.com/edith
- Coping with Network Failures: Routing Strategies for Optimal Demand Oblivious Restoration
- Fast algorithms for constructing tspanners and paths with stretch t
- Proactive Caching of DNS Records: Addressing a Performance Bottleneck
- Improving EndtoEnd Performance of the Web Using Server Volumes and Proxy Filters
- Exploiting Regularities in Web Traffic Patterns for Cache Replacement
- Sketching Unaggregated Data Streams for Subpopulation-Size Queries
- Restoration by Path Concatenation: Fast Recovery of MPLS Paths
- Caching Documents with Variable Sizes and Fetching Costs: An LPBased Approach \Lambda
- MULTIRATE DETECTION FOR THE IS95 CDMA FORWARD TRAFFIC CHANNELS Edith Cohen and HuiLing Lou
- Learning Noisy Perceptrons by a Perceptron in Polynomial Time
- MULTIRATE DETECTION FOR THE IS95A CDMA FORWARD TRAFFIC CHANNELS USING THE 13KBPS SPEECH CODER
- Processing Top-k Queries from Samples Edith Cohen
- Learning Noisy Perceptrons by a Perceptron in Polynomial Time
- [1] K. L. Clarkson. Linear programming in O(n \Theta 3 d 2 ) time. Information Processing
- Strongly PolynomialTime and NC Algorithms for Detecting Cycles in Periodic
- Performance Aspects Of Distributed Caches Using TTLbased Consistency
- Managing TCP Connections under Persistent HTTP Edith Cohen Haim Kaplan Jeffrey D. Oldham \Lambda
- Evaluating ServerAssisted Cache Replacement Edith Cohen, Balachander Krishnamurthy, and Jennifer Rexford
- Restoration by Path Concatenation: Fast Recovery of MPLS Paths
- Reachability and distance queries via 2hop labels Edith Cohen \Lambda Eran Halperin y Haim Kaplan y Uri Zwick y
- Improvise: Interactive Multimedia Process Visualization Environment
- Recognizing Properties of Periodic Graphs Edith Cohen \Lambda and Nimrod Megiddo y
- INFOCOM 2000 1 Prefetching the Means for Document Transfer
- Replication Strategies in Unstructured PeertoPeer Networks
- Finding Interesting Associations without Support Pruning Edith Cohen \Lambda Mayur Datar y Shinji Fujiwara z Aristides Gionis x Piotr Indyk --
- Bottom-k Sketches: Better and More Efficient Estimation of Aggregates
- Associative Search in Peer to Peer Networks: Harnessing Latent Semantics
- Proactive Caching of DNS Records: Addressing a Performance Bottleneck
- Refreshment Policies for Web Content Caches Edith Cohen Haim Kaplan
- [10] M. Gondran and M. Minoux. Graphs and Algorithms. John Wiley & Sons, New York, [11] K. Kapoor and P. M. Vaidya. Speeding up Karmarkar's algorithm for multicommodity
- Structure Prediction and Computation of Sparse Matrix Products
- AllPairs SmallStretch Paths Edith Cohen \Lambda Uri Zwick y
- Algorithms and Estimators for Summarization of Unaggregated Data Streams
- Using selective pathdoubling for parallel shortestpath computations
- Polylogtime and nearlinear work approximation scheme for undirected shortest paths
- Improved Algorithms for Linear Inequalities with Two Variables per Inequality
- Labeling Dynamic XML Trees Edith Cohen
- Connection Caching under Various Models of Communication
- Making IntraDomain Routing Robust to Changing and Uncertain Traffic Demands
- Algorithms and Estimators for Accurate Summarization of Internet Traffic
- Search and Replication in Unstructured Peer-to-Peer Networks
- Summarizing Data using Bottom-k Sketches Edith Cohen
- Maintaining TimeDecaying Stream Aggregates Edith Cohen Martin Strauss
- Prefetching the Means for Document Transfer: A New Approach for Reducing Web Latency
- When Piecewise Determinism Is Almost True Edith Cohen YiMin Wang Gaurav Suri \Lambda
- Search and Replication in Unstructured Peer-to-Peer Networks
- Balanced-Replication Algorithms for Distribution Trees
- Efficient Algorithms for Predicting Requests to Web Servers Edith Cohen, Balachander Krishnamurthy, and Jennifer Rexford
- Predicting and Bypassing EndtoEnd Internet Service Degradations
- Connection Caching: Model and Algorithms ? Edith Cohen
