| 2008 |
|---|
| 106 | | Yossi Matias:
Cloud Computing - a new era in large scale information and data management systems.
ADBIS (local proceedings) 2008: 2 |
| 2007 |
|---|
| 105 | EE | Yariv Matia,
Yossi Matias:
Calibration and Profile based Synopses Error Estimation and Synopses Reconciliation.
ICDE 2007: 446-455 |
| 104 | EE | Yossi Matias,
Daniel Urieli:
Optimal workload-based weighted wavelet synopses.
Theor. Comput. Sci. 371(3): 227-246 (2007) |
| 103 | EE | Yossi Matias,
Ely Porat:
Efficient pebbling for list traversal synopses with application to program rollback.
Theor. Comput. Sci. 379(3): 418-436 (2007) |
| 2006 |
|---|
| 102 | EE | Yossi Matias,
Leon Portman,
Natasha Drukh:
The Design and Architecture of the tau-Synopses System.
EDBT 2006: 1088-1091 |
| 101 | EE | Yariv Matia,
Yossi Matias,
Leon Portman:
Synopses Reconciliation Via Calibration in the tau-Synopses System.
EDBT 2006: 1139-1142 |
| 100 | EE | Yossi Matias,
Daniel Urieli:
Inner-Product Based Wavelet Synopses for Range-Sum Queries.
ESA 2006: 504-515 |
| 99 | EE | Natasha Drukh,
Yariv Matia,
Yossi Matias,
Leon Portman:
tau-xSynopses - a System for Run-Time Management of XML Synopses.
NGITS 2006: 351-352 |
| 98 | EE | Michael Furman,
Yossi Matias,
Ely Porat:
LTS: The List-Traversal Synopses System.
NGITS 2006: 353-354 |
| 97 | EE | Yossi Matias:
Trends in high performance analytics.
SIGMOD Conference 2006: 720 |
| 96 | EE | Yossi Matias,
Eran Segal,
Jeffrey Scott Vitter:
Efficient Bundle Sorting.
SIAM J. Comput. 36(2): 394-410 (2006) |
| 2005 |
|---|
| 95 | EE | Yossi Matias,
Daniel Urieli:
Optimal Workload-Based Weighted Wavelet Synopses.
ICDT 2005: 368-382 |
| 94 | EE | Yossi Matias,
R. Refua:
Delayed-dictionary compression for packet networks.
INFOCOM 2005: 1443-1454 |
| 93 | EE | Yossi Matias:
Data Streams and Data Synopses for Massive Data Sets.
PKDD 2005: 8-9 |
| 2004 |
|---|
| 92 | EE | Iftach Ragoler,
Yossi Matias,
Nimrod Aviram:
Adaptive Probing and Communication in Sensor Networks.
ADHOC-NOW 2004: 280-293 |
| 91 | EE | Yossi Matias,
Leon Portman:
t-Synopses: A System for Run-Time Management of Remote Synopses.
EDBT 2004: 865-867 |
| 90 | EE | Yossi Matias,
Leon Portman:
t-Synopses: A System for Run-Time Management of Remote Synopses.
ICDE 2004: 864-865 |
| 89 | EE | Natasha Drukh,
Neoklis Polyzotis,
Minos N. Garofalakis,
Yossi Matias:
Fractional XSketch Synopses for XML Databases.
XSym 2004: 189-203 |
| 2003 |
|---|
| 88 | EE | Yossi Matias,
Ely Porat:
Efficient Pebbling for List Traversal Synopses.
ICALP 2003: 918-928 |
| 87 | EE | Saar Cohen,
Yossi Matias:
Spectral Bloom Filters.
SIGMOD Conference 2003: 241-252 |
| 86 | EE | Yossi Matias,
Ely Porat:
Efficient pebbling for list traversal synopses
CoRR cs.DS/0306104: (2003) |
| 85 | EE | Yossi Matias,
Jeffrey Scott Vitter,
Wen-Chun Ni:
Dynamic Generation of Discrete Random Variates.
Theory Comput. Syst. 36(4): 329-358 (2003) |
| 2002 |
|---|
| 84 | EE | David Oren,
Yossi Matias,
Shmuel Sagiv:
Online Subpath Profiling.
CC 2002: 78-94 |
| 83 | EE | Phillip B. Gibbons,
Yossi Matias,
Viswanath Poosala:
Fast incremental maintenance of approximate histograms.
ACM Trans. Database Syst. 27(3): 261-298 (2002) |
| 82 | EE | 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) |
| 81 | EE | Yossi Matias,
Jeffrey Scott Vitter,
Neal E. Young:
Approximate Data Structures with Applications
CoRR cs.DS/0205010: (2002) |
| 80 | EE | 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) |
| 2001 |
|---|
| 79 | EE | 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 |
| 78 | | Yossi Matias,
Nasir Rajpoot,
Süleyman Cenk Sahinalp:
The Effect of Flexible Parsing for Dynamic Dictionary-Based Data Compression.
ACM Journal of Experimental Algorithmics 6: 10 (2001) |
| 2000 |
|---|
| 77 | EE | Z. Cohen,
Yossi Matias,
S. Muthukrishnan,
Süleyman Cenk Sahinalp,
Jacob Ziv:
On the temporal HZY compression scheme.
SODA 2000: 185-186 |
| 76 | EE | Yossi Matias,
Eran Segal,
Jeffrey Scott Vitter:
Efficient bundle sorting.
SODA 2000: 839-848 |
| 75 | EE | Yossi Matias,
Jeffrey Scott Vitter,
Min Wang:
Dynamic Maintenance of Wavelet-Based Histograms.
VLDB 2000: 101-110 |
| 74 | | Revital Dafner,
Daniel Cohen-Or,
Yossi Matias:
Context-based Space Filling Curves.
Comput. Graph. Forum 19(3): (2000) |
| 73 | EE | Thomas H. Cormen,
Frank K. H. A. Dehne,
Pierre Fraigniaud,
Yossi Matias:
Guest Editors' Foreword.
Theory Comput. Syst. 33(5/6): 335-335 (2000) |
| 1999 |
|---|
| 72 | EE | 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 |
| 71 | EE | 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 |
| 70 | EE | Noga Alon,
Phillip B. Gibbons,
Yossi Matias,
Mario Szegedy:
Tracking Join and Self-Join Sizes in Limited Storage.
PODS 1999: 10-20 |
| 69 | EE | 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 |
| 68 | EE | Phillip B. Gibbons,
Yossi Matias:
Synopsis Data Structures for Massive Data Sets.
SODA 1999: 909-910 |
| 67 | EE | Yossi Matias,
Süleyman Cenk Sahinalp:
On the Optimality of Parsing in Dynamic Dictionary Based Data Compression.
SODA 1999: 943-944 |
| 66 | EE | 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) |
| 65 | EE | Micah Adler,
Phillip B. Gibbons,
Yossi Matias,
Vijaya Ramachandran:
Modeling Parallel Bandwidth: Local versus Global Restrictions.
Algorithmica 24(3-4): 381-404 (1999) |
| 64 | EE | 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) |
| 63 | EE | Guy E. Blelloch,
Phillip B. Gibbons,
Yossi Matias:
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism.
J. ACM 46(2): 281-321 (1999) |
| 62 | | Noga Alon,
Yossi Matias,
Mario Szegedy:
The Space Complexity of Approximating the Frequency Moments.
J. Comput. Syst. Sci. 58(1): 137-147 (1999) |
| 61 | | Leslie Ann Goldberg,
Yossi Matias,
Satish Rao:
An Optical Simulation of Shared Memory.
SIAM J. Comput. 28(5): 1829-1847 (1999) |
| 60 | EE | 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) |
| 1998 |
|---|
| 59 | | 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 |
| 58 | EE | Yossi Matias,
S. Muthukrishnan,
Süleyman Cenk Sahinalp,
Jacob Ziv:
Augmenting Suffix Trees, with Applications.
ESA 1998: 67-78 |
| 57 | EE | Eran Gabber,
Markus Jakobsson,
Yossi Matias,
Alain J. Mayer:
Curbing Junk E-Mail via Secure Classification.
Financial Cryptography 1998: 198-213 |
| 56 | EE | 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 |
| 55 | EE | Phillip B. Gibbons,
Yossi Matias:
New Sampling-Based Summary Statistics for Improving Approximate Query Answers.
SIGMOD Conference 1998: 331-342 |
| 54 | EE | Yossi Matias,
Jeffrey Scott Vitter,
Min Wang:
Wavelet-Based Histograms for Selectivity Estimation.
SIGMOD Conference 1998: 448-459 |
| 53 | | 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) |
| 52 | EE | Joseph Gil,
Yossi Matias:
Simple Fast Parallel Hashing by Oblivious Execution.
SIAM J. Comput. 27(5): 1348-1375 (1998) |
| 51 | | 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) |
| 50 | EE | Phillip B. Gibbons,
Yossi Matias,
Vijaya Ramachandran:
The Queue-Read Queue-Write Asynchronous PRAM Model.
Theor. Comput. Sci. 196(1-2): 3-29 (1998) |
| 1997 |
|---|
| 49 | | 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 |
| 48 | EE | Guy E. Blelloch,
Phillip B. Gibbons,
Girija J. Narlikar,
Yossi Matias:
Space-Efficient Scheduling of Parallelism with Synchronization Variables.
SPAA 1997: 12-23 |
| 47 | EE | Phillip B. Gibbons,
Yossi Matias,
Vijaya Ramachandran:
Can Shared-Memory Model Serve as a Bridging Model for Parallel Computation?
SPAA 1997: 72-83 |
| 46 | EE | Micah Adler,
Phillip B. Gibbons,
Vijaya Ramachandran,
Yossi Matias:
Modeling Parallel Bandwidth: Local vs. Global Restrictions.
SPAA 1997: 94-105 |
| 45 | EE | Yossi Matias,
Alain J. Mayer,
Abraham Silberschatz:
Lightweight Security Primitives for E-Commerce.
USENIX Symposium on Internet Technologies and Systems 1997 |
| 44 | EE | Phillip B. Gibbons,
Yossi Matias,
Viswanath Poosala:
Fast Incremental Maintenance of Approximate Histograms.
VLDB 1997: 466-475 |
| 43 | EE | 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) |
| 1996 |
|---|
| 42 | | Phillip B. Gibbons,
Yossi Matias,
Vijaya Ramachandran:
The Queue-Read Queue-Write Asynchronous PRAM Model.
Euro-Par, Vol. II 1996: 279-292 |
| 41 | | Phillip B. Gibbons,
Yossi Matias,
Vijaya Ramachandran:
Asynchrony versus Bulk-Synchrony in QRQW PRAM model (Abstract).
PODC 1996: 176 |
| 40 | EE | Sumit Ganguly,
Phillip B. Gibbons,
Yossi Matias,
Abraham Silberschatz:
Bifocal Sampling for Skew-Resistant Join Size Estimation.
SIGMOD Conference 1996: 271-281 |
| 39 | EE | Noga Alon,
Yossi Matias,
Mario Szegedy:
The Space Complexity of Approximating the Frequency Moments.
STOC 1996: 20-29 |
| 38 | EE | Christos Faloutsos,
Yossi Matias,
Abraham Silberschatz:
Modeling Skewed Distribution Using Multifractals and the `80-20' Law.
VLDB 1996: 307-317 |
| 37 | EE | Denise B. Kandel,
Yossi Matias,
Ron Unger,
Peter Winkler:
Shuffling Biological Sequences.
Discrete Applied Mathematics 71(1-3): 171-185 (1996) |
| 36 | EE | 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) |
| 35 | | Phillip B. Gibbons,
Yossi Matias,
Vijaya Ramachandran:
Efficient Low-Contention Parallel Algorithms.
J. Comput. Syst. Sci. 53(3): 417-442 (1996) |
| 34 | | Joseph Gil,
Yossi Matias:
An Effective Load Balancing Policy for Geometric-Decaying Algorithms.
J. Parallel Distrib. Comput. 36(2): 185-188 (1996) |
| 33 | EE | Yossi Matias,
Assaf Schuster:
Fast, Efficient Mutual and Self Simulations for Shared Memory and Reconfigurable Mesh.
Parallel Algorithms Appl. 8(3-4): 195-221 (1996) |
| 1995 |
|---|
| 32 | EE | Omer Berkman,
Yossi Matias:
Fast parallel algorithms for minimum and related problems with small integer inputs.
IPPS 1995: 203-207 |
| 31 | EE | Yossi Matias,
Uzi Vishkin:
A note on reducing parallel model simulations to integer sorting.
IPPS 1995: 208-212 |
| 30 | | Omer Berkman,
Phillip B. Gibbons,
Yossi Matias:
On the Power of Randomization for the Common PRAM.
ISTCS 1995: 229-240 |
| 29 | EE | Guy E. Blelloch,
Phillip B. Gibbons,
Yossi Matias:
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism.
SPAA 1995: 1-12 |
| 28 | EE | 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 |
| 27 | | Samir Khuller,
Yossi Matias:
A Simple Randomized Sieve Algorithm for the Closest-Pair Problem
Inf. Comput. 118(1): 34-37 (1995) |
| 26 | | Omer Berkman,
Yossi Matias:
Fast Parallel Algorithms for Minimum and Related Problems with Small Integer Inputs.
Parallel Processing Letters 5: 223-230 (1995) |
| 1994 |
|---|
| 25 | | Joseph Gil,
Yossi Matias:
Simple Fast Parallel Hashing.
ICALP 1994: 239-250 |
| 24 | | Yossi Matias,
Jeffrey Scott Vitter,
Neal E. Young:
Approximate Data Structures with Applications.
SODA 1994: 187-194 |
| 23 | | Michael T. Goodrich,
Yossi Matias,
Uzi Vishkin:
Optimal Parallel Approximation for Prefix Sums and Integer Sorting.
SODA 1994: 241-250 |
| 22 | | Phillip B. Gibbons,
Yossi Matias,
Vijaya Ramachandran:
The QRQW PRAM: Accounting for Contention in Parallel Algorithms.
SODA 1994: 638-648 |
| 21 | EE | Phillip B. Gibbons,
Yossi Matias,
Vijaya Ramachandran:
Efficient Low-Contention Parallel Algorithms.
SPAA 1994: 236-247 |
| 20 | EE | Leslie Ann Goldberg,
Yossi Matias,
Satish Rao:
An Optical Simulation of Shared Memory.
SPAA 1994: 257-267 |
| 19 | | Yehuda Afek,
Yossi Matias:
Elections in Anonymous Networks
Inf. Comput. 113(2): 312-330 (1994) |
| 18 | | Joseph Gil,
Yossi Matias:
Designing Algorithms by Expectations.
Inf. Process. Lett. 51(1): 31-34 (1994) |
| 17 | | Joseph Gil,
Yossi Matias:
Fast and Efficient Simulations among CRCW PRAMs.
J. Parallel Distrib. Comput. 23(2): 135-148 (1994) |
| 1993 |
|---|
| 16 | | Yossi Matias:
Semi-dynamic Closest-pair Algorithms.
CCCG 1993: 264-271 |
| 15 | | Michael T. Goodrich,
Yossi Matias,
Uzi Vishkin:
Approximate Parallel Prefix Computation and its Applications.
IPPS 1993: 318-325 |
| 14 | | Yossi Matias,
Jeffrey Scott Vitter,
Wen-Chun Ni:
Dynamic Generation of Discrete Random Variates.
SODA 1993: 361-370 |
| 13 | | 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 |
| 1992 |
|---|
| 12 | | Amihood Amir,
Martin Farach,
Yossi Matias:
Efficient Randomized Dictionary Matching Algorithms (Extended Abstract).
CPM 1992: 262-275 |
| 11 | | Martin Dietzfelbinger,
Joseph Gil,
Yossi Matias,
Nicholas Pippenger:
Polynomial Hash Functions Are Reliable (Extended Abstract).
ICALP 1992: 235-246 |
| 10 | | Omer Berkman,
Yossi Matias,
Uzi Vishkin:
Randomized Range-Maxima inNearly-Constant Parallel Time.
ISAAC 1992: 135-144 |
| 9 | | Joseph Gil,
Yossi Matias:
Leaders Election Without Conflict Resolution Rule - Fast and Efficient Randomized Simulations among CRCW PRAMs.
LATIN 1992: 204-218 |
| 8 | | Omer Berkman,
Yossi Matias,
Uzi Vishkin:
Randomized Range-Maxima in Nearly-Constant Parallel Time.
Computational Complexity 2: 350-373 (1992) |
| 1991 |
|---|
| 7 | | Joseph Gil,
Yossi Matias,
Uzi Vishkin:
Towards a Theory of Nearly Constant Time Parallel Algorithms
FOCS 1991: 698-710 |
| 6 | | Joseph Gil,
Yossi Matias:
Fast Hashing on a PRAM - Designing by Expectation.
SODA 1991: 271-280 |
| 5 | | Yossi Matias,
Uzi Vishkin:
Converting High Probability into Nearly-Constant Time-with Applications to Parallel Hashing (Extended Abstract)
STOC 1991: 307-316 |
| 4 | | Yossi Matias,
Uzi Vishkin:
On Parallel Hashing and Integer Sorting.
J. Algorithms 12(4): 573-606 (1991) |
| 1990 |
|---|
| 3 | | Yossi Matias,
Uzi Vishkin:
On Parallel Hashing and Integer Sorting (Extended Summary).
ICALP 1990: 729-743 |
| 1989 |
|---|
| 2 | | Yossi Matias,
Yehuda Afek:
Simple and Efficient Election Algorithms for Anonymous Networks.
WDAG 1989: 183-194 |
| 1987 |
|---|
| 1 | EE | Yossi Matias,
Adi Shamir:
A Video Scrambling Technique Based On Space Filling Curves.
CRYPTO 1987: 398-417 |
