Welcome to D
SIGMOD 2004
PODS 2004
SIGMOD RECOR
CIKM 2004
DASFAA 2004
DBPL 2003
DE-BULLETIN
DEBS 2004
DMKD 2004
DMSN 2004
DOLAP 2004
DPDJ 2004
EDBT 2004
ER 2003
GIS 2004
HDP 2004
HYPERTEXT 20
ICDE 2004
ICDT 2003
JCDL 2004
MDM
MIR 2004
MIS 2004
MMDB 2004
MOBIDE 2003
RIDE 2004
SBBD 2003
SIGIR FORUM
SIGIR 2004
SIGKDD EXPLO
SIGKDD 2004
SSDBM 2004
SSTD 2003
TIME 2004
TODS 2004
VLDB 2004
VLDB Journal
WEBDB 2004
WIDM 2004
XIME-P 2004
Footer

Yossi Matias

Papers on DiSC'04


t-Synopses: A System for Run-Time Management of Remote Synopses

Publications


Note: Links lead to the DBLP on the Web.

Yossi Matias

Yossi Matias, Daniel Urieli : Optimal Workload-Based Weighted Wavelet Synopses. ICDT 2005 : 368-382

Iftach Ragoler , Yossi Matias, Nimrod Aviram : Adaptive Probing and Communication in Sensor Networks. ADHOC-NOW 2004 : 280-293

Yossi Matias, Leon Portman : t-Synopses: A System for Run-Time Management of Remote Synopses. EDBT 2004 : 865-867

Yossi Matias, Leon Portman : t-Synopses: A System for Run-Time Management of Remote Synopses. ICDE 2004 : 864-865

Natasha Drukh , Neoklis Polyzotis , Minos N. Garofalakis , Yossi Matias: Fractional XSketch Synopses for XML Databases. XSym 2004 : 189-203

Yossi Matias, Ely Porat : Efficient Pebbling for List Traversal Synopses. ICALP 2003 : 918-928

Saar Cohen , Yossi Matias: Spectral Bloom Filters. SIGMOD Conference 2003 : 241-252

Yossi Matias, Ely Porat : Efficient pebbling for list traversal synopses CoRR cs.DS/0306104 : (2003)

Yossi Matias, Jeffrey Scott Vitter , Wen-Chun Ni : Dynamic Generation of Discrete Random Variates. Theory Comput. Syst. 36 (4): 329-358 (2003)

David Oren , Yossi Matias, Shmuel Sagiv : Online Subpath Profiling. CC 2002 : 78-94

Phillip B. Gibbons , Yossi Matias, Viswanath Poosala : Fast incremental maintenance of approximate histograms. ACM Trans. Database Syst. 27 (3): 261-298 (2002)

Lev Finkelstein , Evgeniy Gabrilovich , Yossi Matias, Ehud Rivlin , Zach Solan , Gadi Wolfman , Eytan Ruppin : Placing search in context: the concept revisited. ACM Trans. Inf. Syst. 20 (1): 116-131 (2002)

Yossi Matias, Jeffrey Scott Vitter , Neal E. Young : Approximate Data Structures with Applications CoRR cs.DS/0205010 : (2002)

Noga Alon , Phillip B. Gibbons , Yossi Matias, Mario Szegedy : Tracking Join and Self-Join Sizes in Limited Storage. J. Comput. Syst. Sci. 64 (3): 719-747 (2002)

Lev Finkelstein , Evgeniy Gabrilovich , Yossi Matias, Ehud Rivlin , Zach Solan , Gadi Wolfman , Eytan Ruppin : Placing search in context: the concept revisited. WWW 2001 : 406-414

Yossi Matias, Nasir Rajpoot , Süleyman Cenk Sahinalp : The Effect of Flexible Parsing for Dynamic Dictionary-Based Data Compression. ACM Journal of Experimental Algorithms 6 : 10 (2001)

Z. Cohen , Yossi Matias, S. Muthukrishnan , Süleyman Cenk Sahinalp , Jacob Ziv : On the temporal HZY compression scheme. SODA 2000 : 185-186

Yossi Matias, Eran Segal , Jeffrey Scott Vitter : Efficient bundle sorting. SODA 2000 : 839-848

Yossi Matias, Jeffrey Scott Vitter , Min Wang : Dynamic Maintenance of Wavelet-Based Histograms. VLDB 2000 : 101-110

Revital Dafner , Daniel Cohen-Or , Yossi Matias: Context-based Space Filling Curves. Comput. Graph. Forum 19 (3): (2000)

Thomas H. Cormen , Frank K. H. A. Dehne , Pierre Fraigniaud , Yossi Matias: Guest Editors' Foreword. Theory Comput. Syst. 33 (5/6): 335-335 (2000)

Yossi Matias, Nasir Rajpoot , Süleyman Cenk Sahinalp : The Effect of Flexible Parsing for Dynamic Dictionary Based Data Compression. Data Compression Conference 1999 : 238-246

Rakesh D. Barve , Phillip B. Gibbons , Bruce Hillyer , Yossi Matias, Elizabeth A. M. Shriver , Jeffrey Scott Vitter : Round-Like Behavior in Multiple Disks on a Bus. IOPADS 1999 : 1-9

Noga Alon , Phillip B. Gibbons , Yossi Matias, Mario Szegedy : Tracking Join and Self-Join Sizes in Limited Storage. PODS 1999 : 10-20

Rakesh D. Barve , Elizabeth A. M. Shriver , Phillip B. Gibbons , Bruce Hillyer , Yossi Matias, Jeffrey Scott Vitter : Modeling and Optimizing I/O Throughput of Multiple Disks on a Bus. SIGMETRICS 1999 : 83-92

Phillip B. Gibbons , Yossi Matias: Synopsis Data Structures for Massive Data Sets. SODA 1999 : 909-910

Yossi Matias, Süleyman Cenk Sahinalp : On the Optimality of Parsing in Dynamic Dictionary Based Data Compression. SODA 1999 : 943-944

Eran Gabber , Phillip B. Gibbons , David M. Kristol , Yossi Matias, Alain J. Mayer : On secure and pseudonymous client-relationships with multiple servers. ACM Trans. Inf. Syst. Secur. 2 (4): 390-415 (1999)

Micah Adler , Phillip B. Gibbons , Yossi Matias, Vijaya Ramachandran : Modeling Parallel Bandwidth: Local versus Global Restrictions. Algorithmica 24 (3-4): 381-404 (1999)

Eran Gabber , Phillip B. Gibbons , David M. Kristol , Yossi Matias, Alain J. Mayer : Consistent, Yet Anonymous, Web Access with LPWA. Commun. ACM 42 (2): 42-47 (1999)

Guy E. Blelloch , Phillip B. Gibbons , Yossi Matias: Provably Efficient Scheduling for Languages with Fine-Grained Parallelism. J. ACM 46 (2): 281-321 (1999)

Noga Alon , Yossi Matias, Mario Szegedy : The Space Complexity of Approximating the Frequency Moments. J. Comput. Syst. Sci. 58 (1): 137-147 (1999)

Leslie Ann Goldberg , Yossi Matias, Satish Rao : An Optical Simulation of Shared Memory. SIAM J. Comput. 28 (5): 1829-1847 (1999)

Phillip B. Gibbons , Yossi Matias, Vijaya Ramachandran : Can a Shared-Memory Model Serve as a Bridging Model for Parallel Computation? Theory Comput. Syst. 32 (3): 327-359 (1999)

Yossi Matias, Nasir Rajpoot , Süleyman Cenk Sahinalp : Implementation and Experimental Evaluation of Flexible Parsing for Dynamic Dictionary Based Data Compression. Algorithm Engineering 1998 : 49-61

Yossi Matias, S. Muthukrishnan , Süleyman Cenk Sahinalp , Jacob Ziv : Augmenting Suffix Trees, with Applications. ESA 1998 : 67-78

Eran Gabber , Markus Jakobsson , Yossi Matias, Alain J. Mayer : Curbing Junk E-Mail via Secure Classification. Financial Cryptography 1998 : 198-213

Rakesh D. Barve , Elizabeth A. M. Shriver , Phillip B. Gibbons , Bruce Hillyer , Yossi Matias, Jeffrey Scott Vitter : Modeling and Optimizing I/O Throughput of Multiple Disks on a Bus (Summary). SIGMETRICS 1998 : 264-265

Phillip B. Gibbons , Yossi Matias: New Sampling-Based Summary Statistics for Improving Approximate Query Answers. SIGMOD Conference 1998 : 331-342

Yossi Matias, Jeffrey Scott Vitter , Min Wang : Wavelet-Based Histograms for Selectivity Estimation. SIGMOD Conference 1998 : 448-459

Omer Berkman , Yossi Matias, Prabhakar Ragde : Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains. J. Algorithms 28 (2): 197-215 (1998)

Joseph Gil , Yossi Matias: Simple Fast Parallel Hashing by Oblivious Execution. SIAM J. Comput. 27 (5): 1348-1375 (1998)

Phillip B. Gibbons , Yossi Matias, Vijaya Ramachandran : The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms. SIAM J. Comput. 28 (2): 733-769 (1998)

Phillip B. Gibbons , Yossi Matias, Vijaya Ramachandran : The Queue-Read Queue-Write Asynchronous PRAM Model. Theor. Comput. Sci. 196 (1-2): 3-29 (1998)

Eran Gabber , Phillip B. Gibbons , Yossi Matias, Alain J. Mayer : How to Make Personalized Web Browising Simple, Secure, and Anonymous. Financial Cryptography 1997 : 17-32

Guy E. Blelloch , Phillip B. Gibbons , Girija J. Narlikar , Yossi Matias: Space-Efficient Scheduling of Parallelism with Synchronization Variables. SPAA 1997 : 12-23

Phillip B. Gibbons , Yossi Matias, Vijaya Ramachandran : Can Shared-Memory Model Serve as a Bridging Model for Parallel Computation? SPAA 1997 : 72-83

Micah Adler , Phillip B. Gibbons , Vijaya Ramachandran , Yossi Matias: Modeling Parallel Bandwidth: Local vs. Global Restrictions. SPAA 1997 : 94-105

Yossi Matias, Alain J. Mayer , Abraham Silberschatz : Lightweight Security Primitives for E-Commerce. USENIX Symposium on Internet Technologies and Systems 1997

Phillip B. Gibbons , Yossi Matias, Viswanath Poosala : Fast Incremental Maintenance of Approximate Histograms. VLDB 1997 : 466-475

Guy E. Blelloch , Phillip B. Gibbons , Yossi Matias, Marco Zagha : Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors. IEEE Trans. Parallel Distrib. Syst. 8 (9): 943-958 (1997)

Phillip B. Gibbons , Yossi Matias, Vijaya Ramachandran : The Queue-Read Queue-Write Asynchronous PRAM Model. Euro-Par, Vol. II 1996 : 279-292

Phillip B. Gibbons , Yossi Matias, Vijaya Ramachandran : Asynchrony versus Bulk-Synchrony in QRQW PRAM model (Abstract). PODC 1996 : 176

Sumit Ganguly , Phillip B. Gibbons , Yossi Matias, Abraham Silberschatz : Bifocal Sampling for Skew-Resistant Join Size Estimation. SIGMOD Conference 1996 : 271-281

Noga Alon , Yossi Matias, Mario Szegedy : The Space Complexity of Approximating the Frequency Moments. STOC 1996 : 20-29

Christos Faloutsos , Yossi Matias, Abraham Silberschatz : Modeling Skewed Distribution Using Multifractals and the `80-20' Law. VLDB 1996 : 307-317

Denise B. Kandel , Yossi Matias, Ron Unger , Peter Winkler : Shuffling Biological Sequences. Discrete Applied Mathematics 71 (1-3): 171-185 (1996)

Regev Levi , Eytan Ruppin , Yossi Matias, James A. Reggia : Frequency-Spatial Transformation: A Proposal for Parsimonious Intra-Cortical Communication. Int. J. Neural Syst. 7 (5): 591-598 (1996)

Phillip B. Gibbons , Yossi Matias, Vijaya Ramachandran : Efficient Low-Contention Parallel Algorithms. J. Comput. Syst. Sci. 53 (3): 417-442 (1996)

Joseph Gil , Yossi Matias: An Effective Load Balancing Policy for Geometric-Decaying Algorithms. J. Parallel Distrib. Comput. 36 (2): 185-188 (1996)

Omer Berkman , Yossi Matias: Fast parallel algorithms for minimum and related problems with small integer inputs. IPPS 1995 : 203-207

Yossi Matias, Uzi Vishkin : A note on reducing parallel model simulations to integer sorting. IPPS 1995 : 208-212

Omer Berkman , Phillip B. Gibbons , Yossi Matias: On the Power of Randomization for the Common PRAM. ISTCS 1995 : 229-240

Guy E. Blelloch , Phillip B. Gibbons , Yossi Matias: Provably Efficient Scheduling for Languages with Fine-Grained Parallelism. SPAA 1995 : 1-12

Guy E. Blelloch , Phillip B. Gibbons , Yossi Matias, Marco Zagha : Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors. SPAA 1995 : 84-94

Samir Khuller , Yossi Matias: A Simple Randomized Sieve Algorithm for the Closest-Pair Problem Inf. Comput. 118 (1): 34-37 (1995)

Omer Berkman , Yossi Matias: Fast Parallel Algorithms for Minimum and Related Problems with Small Integer Inputs. Parallel Processing Letters 5 : 223-230 (1995)

Joseph Gil , Yossi Matias: Simple Fast Parallel Hashing. ICALP 1994 : 239-250

Yossi Matias, Jeffrey Scott Vitter , Neal E. Young : Approximate Data Structures with Applications. SODA 1994 : 187-194

Michael T. Goodrich , Yossi Matias, Uzi Vishkin : Optimal Parallel Approximation for Prefix Sums and Integer Sorting. SODA 1994 : 241-250

Phillip B. Gibbons , Yossi Matias, Vijaya Ramachandran : The QRQW PRAM: Accounting for Contention in Parallel Algorithms. SODA 1994 : 638-648

Phillip B. Gibbons , Yossi Matias, Vijaya Ramachandran : Efficient Low-Contention Parallel Algorithms. SPAA 1994 : 236-247

Leslie Ann Goldberg , Yossi Matias, Satish Rao : An Optical Simulation of Shared Memory. SPAA 1994 : 257-267

Yehuda Afek , Yossi Matias: Elections in Anonymous Networks Inf. Comput. 113 (2): 312-330 (1994)

Joseph Gil , Yossi Matias: Designing Algorithms by Expectations. Inf. Process. Lett. 51 (1): 31-34 (1994)

Joseph Gil , Yossi Matias: Fast and Efficient Simulations among CRCW PRAMs. J. Parallel Distrib. Comput. 23 (2): 135-148 (1994)

Yossi Matias: Semi-dynamic Closest-pair Algorithms. CCCG 1993 : 264-271

Michael T. Goodrich , Yossi Matias, Uzi Vishkin : Approximate Parallel Prefix Computation and its Applications. IPPS 1993 : 318-325

Yossi Matias, Jeffrey Scott Vitter , Wen-Chun Ni : Dynamic Generation of Discrete Random Variates. SODA 1993 : 361-370

Omer Berkman , Yossi Matias, Prabhakar Ragde : Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs. WADS 1993 : 175-187

Amihood Amir , Martin Farach , Yossi Matias: Efficient Randomized Dictionary Matching Algorithms (Extended Abstract). CPM 1992 : 262-275

Martin Dietzfelbinger , Joseph Gil , Yossi Matias, Nicholas Pippenger : Polynomial Hash Functions Are Reliable (Extended Abstract). ICALP 1992 : 235-246

Omer Berkman , Yossi Matias, Uzi Vishkin : Randomized Range-Maxima inNearly-Constant Parallel Time. ISAAC 1992 : 135-144

Joseph Gil , Yossi Matias: Leaders Election Without Conflict Resolution Rule - Fast and Efficient Randomized Simulations among CRCW PRAMs. LATIN 1992 : 204-218

Omer Berkman , Yossi Matias, Uzi Vishkin : Randomized Range-Maxima in Nearly-Constant Parallel Time. Computational Complexity 2 : 350-373 (1992)

Joseph Gil , Yossi Matias, Uzi Vishkin : Towards a Theory of Nearly Constant Time Parallel Algorithms FOCS 1991 : 698-710

Joseph Gil , Yossi Matias: Fast Hashing on a PRAM - Designing by Expectation. SODA 1991 : 271-280

Yossi Matias, Uzi Vishkin : Converting High Probability into Nearly-Constant Time-with Applications to Parallel Hashing (Extended Abstract) STOC 1991 : 307-316

Yossi Matias, Uzi Vishkin : On Parallel Hashing and Integer Sorting. J. Algorithms 12 (4): 573-606 (1991)

Yossi Matias, Uzi Vishkin : On Parallel Hashing and Integer Sorting (Extended Summary). ICALP 1990 : 729-743

Yossi Matias, Yehuda Afek : Simple and Efficient Election Algorithms for Anonymous Networks. WDAG 1989 : 183-194

Yossi Matias, Adi Shamir : A Video Scrambling Technique Based On Space Filling Curves. CRYPTO 1987 : 398-417

1 [ 45 ] [ 64 ]

2 [ 2 ] [ 19 ]

3 [ 38 ] [ 61 ] [ 69 ] [ 79 ]

4 [ 12 ]

5 [ 91 ]

6 [ 55 ] [ 68 ] [ 70 ]

7 [ 8 ] [ 10 ] [ 13 ] [ 26 ] [ 30 ] [ 32 ] [ 52 ]

8 [ 28 ] [ 29 ] [ 42 ] [ 47 ] [ 62 ]

9 [ 86 ]

10 [ 76 ]

11 [ 73 ]

12 [ 72 ]

13 [ 73 ]

14 [ 72 ]

15 [ 11 ]

16 [ 88 ]

17 [ 37 ]

18 [ 12 ]

19 [ 78 ] [ 81 ]

20 [ 72 ]

21 [ 48 ] [ 56 ] [ 63 ] [ 65 ]

22 [ 78 ] [ 81 ]

23 [ 39 ]

24 [ 88 ]

25 [ 21 ] [ 22 ] [ 28 ] [ 29 ] [ 30 ] [ 34 ] [ 39 ] [ 40 ] [ 41 ] [ 42 ] [ 43 ] [ 45 ] [ 46 ] [ 47 ] [ 48 ] [ 49 ] [ 50 ] [ 54 ] [ 55 ] [ 59 ] [ 62 ] [ 63 ] [ 64 ] [ 65 ] [ 67 ] [ 68 ] [ 69 ] [ 70 ] [ 79 ] [ 82 ]

26 [ 6 ] [ 7 ] [ 9 ] [ 11 ] [ 17 ] [ 18 ] [ 25 ] [ 33 ] [ 51 ]

27 [ 20 ] [ 60 ]

28 [ 15 ] [ 23 ]

29 [ 55 ] [ 68 ] [ 70 ]

30 [ 56 ]

31 [ 36 ]

32 [ 27 ]

33 [ 63 ] [ 65 ]

34 [ 35 ]

35 [ 44 ] [ 48 ] [ 56 ] [ 63 ] [ 65 ]

36 [ 57 ] [ 76 ]

37 [ 47 ]

38 [ 14 ] [ 84 ]

39 [ 83 ]

40 [ 11 ]

41 [ 88 ]

42 [ 43 ] [ 82 ]

43 [ 85 ] [ 87 ]

44 [ 89 ] [ 90 ]

45 [ 13 ] [ 52 ]

46 [ 91 ]

47 [ 58 ] [ 71 ] [ 77 ]

48 [ 21 ] [ 22 ] [ 34 ] [ 40 ] [ 41 ] [ 45 ] [ 46 ] [ 49 ] [ 50 ] [ 59 ] [ 64 ]

49 [ 20 ] [ 60 ]

50 [ 35 ]

51 [ 78 ] [ 81 ]

52 [ 35 ] [ 78 ] [ 81 ]

53 [ 83 ]

54 [ 57 ] [ 58 ] [ 66 ] [ 71 ] [ 76 ] [ 77 ]

55 [ 75 ]

56 [ 1 ]

57 [ 55 ] [ 68 ] [ 70 ]

58 [ 37 ] [ 39 ] [ 44 ]

59 [ 78 ] [ 81 ]

60 [ 38 ] [ 61 ] [ 69 ] [ 79 ]

61 [ 36 ]

62 [ 92 ]

63 [ 3 ] [ 4 ] [ 5 ] [ 7 ] [ 8 ] [ 10 ] [ 15 ] [ 23 ] [ 31 ]

64 [ 14 ] [ 24 ] [ 53 ] [ 55 ] [ 68 ] [ 70 ] [ 74 ] [ 75 ] [ 80 ] [ 84 ]

65 [ 53 ] [ 74 ]

66 [ 36 ]

67 [ 78 ] [ 81 ]

68 [ 24 ] [ 80 ]

69 [ 28 ] [ 42 ]

70 [ 57 ] [ 76 ]




©2005 Association for Computing Machinery