Yossi Matias

According to our database1, Yossi Matias authored at least 106 papers between 1987 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Awards

ACM Fellow

ACM Fellow 2009, "For contributions to the analysis of large data sets and data streams.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Customization scenarios for de-identification of clinical notes.
BMC Med. Inf. & Decision Making, 2020

Detecting Deficient Coverage in Colonoscopies.
CoRR, 2020

2019
Spectral Algorithm for Low-rank Multitask Regression.
CoRR, 2019

Personalizing ASR for Dysarthric and Accented Speech with Limited Data.
CoRR, 2019

ML for Flood Forecasting at Scale.
CoRR, 2019

Towards Global Remote Discharge Estimation: Using the Few to Estimate The Many.
CoRR, 2019

Audio De-identification - a New Entity Recognition Task.
Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2019

Differentially Private Learning of Geometric Concepts.
Proceedings of the 36th International Conference on Machine Learning, 2019

Self-similar Epochs: Value in arrangement.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
LSH Microbatches for Stochastic Gradients: Value in Rearrangement.
CoRR, 2018

2013
Nowcasting with Google Trends.
Proceedings of the String Processing and Information Retrieval, 2013

2012
On Big Data Algorithmics.
Proceedings of the Algorithms - ESA 2012, 2012

Contextual OTP: Mitigating Emerging Man-in-the-Middle Attacks with Wireless Hardware Tokens.
Proceedings of the Applied Cryptography and Network Security, 2012

2011
Mind the (gender) gap: can a two-hour visit to a hi-tech company change perceptions about computer science?
Inroads, 2011

2010
Suggesting friends using the implicit social graph.
Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2010

2009
Google's Auction for TV Ads.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2008
Cloud Computing - a new era in large scale information and data management systems.
Proceedings of the Advances in Databases and Information Systems, 2008

2007
Optimal workload-based weighted wavelet synopses.
Theor. Comput. Sci., 2007

Efficient pebbling for list traversal synopses with application to program rollback.
Theor. Comput. Sci., 2007

Calibration and Profile based Synopses Error Estimation and Synopses Reconciliation.
Proceedings of the 23rd International Conference on Data Engineering, 2007

2006
Efficient Bundle Sorting.
SIAM J. Comput., 2006

Trends in high performance analytics.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2006

LTS: The List-Traversal Synopses System.
Proceedings of the Next Generation Information Technologies and Systems, 2006

tau-xSynopses - a System for Run-Time Management of XML Synopses.
Proceedings of the Next Generation Information Technologies and Systems, 2006

Inner-Product Based Wavelet Synopses for Range-Sum Queries.
Proceedings of the Algorithms, 2006

The Design and Architecture of the tau-Synopses System.
Proceedings of the Advances in Database Technology, 2006

Synopses Reconciliation Via Calibration in the tau-Synopses System.
Proceedings of the Advances in Database Technology, 2006

2005
Data Streams and Data Synopses for Massive Data Sets.
Proceedings of the Knowledge Discovery in Databases: PKDD 2005, 2005

Delayed-dictionary compression for packet networks.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

2004
Fractional XSketch Synopses for XML Databases.
Proceedings of the Database and XML Technologies, 2004

t-Synopses: A System for Run-Time Management of Remote Synopses.
Proceedings of the 20th International Conference on Data Engineering, 2004

Adaptive Probing and Communication in Sensor Networks.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks: Third International Conference, 2004

2003
Dynamic Generation of Discrete Random Variates.
Theory Comput. Syst., 2003

Spectral Bloom Filters.
Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, 2003

Efficient Pebbling for List Traversal Synopses.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
Placing search in context: the concept revisited.
ACM Trans. Inf. Syst., 2002

Fast incremental maintenance of approximate histograms.
ACM Trans. Database Syst., 2002

Tracking Join and Self-Join Sizes in Limited Storage.
J. Comput. Syst. Sci., 2002

Online Subpath Profiling.
Proceedings of the Compiler Construction, 11th International Conference, 2002

2001
The Effect of Flexible Parsing for Dynamic Dictionary-Based Data Compression.
ACM Journal of Experimental Algorithmics, 2001

2000
Guest Editors' Foreword.
Theory Comput. Syst., 2000

Context-based Space Filling Curves.
Comput. Graph. Forum, 2000

Dynamic Maintenance of Wavelet-Based Histograms.
Proceedings of the VLDB 2000, 2000

On the temporal HZY compression scheme.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999
On secure and pseudonymous client-relationships with multiple servers.
ACM Trans. Inf. Syst. Secur., 1999

An Optical Simulation of Shared Memory.
SIAM J. Comput., 1999

Can a Shared-Memory Model Serve as a Bridging Model for Parallel Computation?
Theory Comput. Syst., 1999

The Space Complexity of Approximating the Frequency Moments.
J. Comput. Syst. Sci., 1999

Provably Efficient Scheduling for Languages with Fine-Grained Parallelism.
J. ACM, 1999

Consistent, Yet Anonymous, Web Access with LPWA.
Commun. ACM, 1999

Modeling Parallel Bandwidth: Local versus Global Restrictions.
Algorithmica, 1999

On the Optimality of Parsing in Dynamic Dictionary Based Data Compression.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Synopsis Data Structures for Massive Data Sets.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Modeling and Optimizing I/O Throughput of Multiple Disks on a Bus.
Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, 1999

Round-Like Behavior in Multiple Disks on a Bus.
Proceedings of the Sixth Workshop on I/O in Parallel and Distributed Systems, 1999

1998
The Queue-Read Queue-Write Asynchronous PRAM Model.
Theor. Comput. Sci., 1998

Simple Fast Parallel Hashing by Oblivious Execution.
SIAM J. Comput., 1998

The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms.
SIAM J. Comput., 1998

Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains.
J. Algorithms, 1998

Implementation and Experimental Evaluation of Flexible Parsing for Dynamic Dictionary Based Data Compression.
Proceedings of the Algorithm Engineering, 1998

On Secure and Pseudonymous Client-Relationships with Multiple Servers.
Proceedings of the 3rd USENIX Workshop on Electronic Commerce, Boston, Massachusetts, USA, August 31, 1998

Wavelet-Based Histograms for Selectivity Estimation.
Proceedings of the SIGMOD 1998, 1998

New Sampling-Based Summary Statistics for Improving Approximate Query Answers.
Proceedings of the SIGMOD 1998, 1998

Modeling and Optimizing I/O Throughput of Multiple Disks on a Bus (Summary).
Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems, 1998

Curbing Junk E-Mail via Secure Classification.
Proceedings of the Financial Cryptography, 1998

Augmenting Suffix Trees, with Applications.
Proceedings of the Algorithms, 1998

1997
Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors.
IEEE Trans. Parallel Distrib. Syst., 1997

Parallel algorithms column: on the search for suitable models.
SIGACT News, 1997

Lightweight Security Primitives for E-Commerce.
Proceedings of the 1st USENIX Symposium on Internet Technologies and Systems, 1997

Space-Efficient Scheduling of Parallelism with Synchronization Variables.
Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997

Modeling Parallel Bandwidth: Local vs. Global Restrictions.
Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997

How to Make Personalized Web Browising Simple, Secure, and Anonymous.
Proceedings of the Financial Cryptography, 1997

1996
Fast, Efficient Mutual and Self Simulations for Shared Memory and Reconfigurable Mesh.
Parallel Algorithms Appl., 1996

An Effective Load Balancing Policy for Geometric-Decaying Algorithms.
J. Parallel Distributed Comput., 1996

Efficient Low-Contention Parallel Algorithms.
J. Comput. Syst. Sci., 1996

Frequency-Spatial Transformation: A Proposal for Parsimonious Intra-Cortical Communication.
Int. J. Neural Syst., 1996

Shuffling Biological Sequences.
Discret. Appl. Math., 1996

Modeling Skewed Distribution Using Multifractals and the '80-20' Law.
Proceedings of the VLDB'96, 1996

Bifocal Sampling for Skew-Resistant Join Size Estimation.
Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, 1996

Asynchrony versus Bulk-Synchrony in QRQW PRAM model (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995
A Simple Randomized Sieve Algorithm for the Closest-Pair Problem
Inf. Comput., April, 1995

Fast Parallel Algorithms for Minimum and Related Problems with Small Integer Inputs.
Parallel Processing Letters, 1995

On the Power of Randomization for the Common PRAM.
Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995

A note on reducing parallel model simulations to integer sorting.
Proceedings of IPPS '95, 1995

1994
Elections in Anonymous Networks
Inf. Comput., September, 1994

Fast and Efficient Simulations among CRCW PRAMs.
J. Parallel Distributed Comput., 1994

Designing Algorithms by Expectations.
Inf. Process. Lett., 1994

Approximate Data Structures with Applications.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Optimal Parallel Approximation for Prefix Sums and Integer Sorting.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

The QRQW PRAM: Accounting for Contention in Parallel Algorithms.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Simple Fast Parallel Hashing.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993
Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Approximate Parallel Prefix Computation and its Applications.
Proceedings of the Seventh International Parallel Processing Symposium, 1993

Semi-dynamic Closest-pair Algorithms.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992
Randomized Range-Maxima in Nearly-Constant Parallel Time.
Computational Complexity, 1992

Leaders Election Without Conflict Resolution Rule - Fast and Efficient Randomized Simulations among CRCW PRAMs.
Proceedings of the LATIN '92, 1992

Randomized Range-Maxima inNearly-Constant Parallel Time.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992

Polynomial Hash Functions Are Reliable (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

Efficient Randomized Dictionary Matching Algorithms (Extended Abstract).
Proceedings of the Combinatorial Pattern Matching, Third Annual Symposium, 1992

1991
On Parallel Hashing and Integer Sorting.
J. Algorithms, 1991

Converting High Probability into Nearly-Constant Time-with Applications to Parallel Hashing (Extended Abstract)
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Fast Hashing on a PRAM - Designing by Expectation.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

Towards a Theory of Nearly Constant Time Parallel Algorithms
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990
On Parallel Hashing and Integer Sorting (Extended Summary).
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1989
Simple and Efficient Election Algorithms for Anonymous Networks.
Proceedings of the Distributed Algorithms, 1989

1987
A Video Scrambling Technique Based On Space Filling Curves.
Proceedings of the Advances in Cryptology, 1987


  Loading...