Y. Matias

From MaRDI portal
Person:676445

Available identifiers

zbMath Open matias.yossiMaRDI QIDQ676445

List of research outcomes





PublicationDate of PublicationType
Adversarially robust streaming algorithms via differential privacy2024-06-06Paper
Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs2023-01-18Paper
Differentially Private Learning of Geometric Concepts2022-07-22Paper
Polynomial hash functions are reliable2019-12-04Paper
Simple fast parallel hashing2019-04-29Paper
The Effect of Flexible Parsing for Dynamic Dictionary-Based Data Compression2017-06-15Paper
Inner-Product Based Wavelet Synopses for Range-Sum Queries2008-03-11Paper
Efficient pebbling for list traversal synopses with application to program rollback2007-07-16Paper
Efficient Bundle Sorting2007-05-03Paper
Optimal workload-based weighted wavelet synopses2007-03-12Paper
Database Theory - ICDT 20052005-09-13Paper
Provably efficient scheduling for languages with fine-grained parallelism2005-01-25Paper
FAST, EFFICIENT MUTUAL AND SELF SIMULATIONS FOR SHARED MEMORY AND RECONFIGURABLE MESH2004-10-06Paper
https://portal.mardi4nfdi.de/entity/Q47383752004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44492292004-02-08Paper
Dynamic generation of discrete random variates2003-08-26Paper
Tracking join and self-join sizes in limited storage2002-09-12Paper
Scheduling space-sharing for internet advertising2002-09-09Paper
Elections in anonymous networks2000-08-02Paper
Modeling parallel bandwidth: Local versus global restrictions2000-07-10Paper
https://portal.mardi4nfdi.de/entity/Q49455252000-06-07Paper
https://portal.mardi4nfdi.de/entity/Q49527082000-05-10Paper
Can a shared-memory model serve as a bridging model for parallel computation?2000-01-10Paper
https://portal.mardi4nfdi.de/entity/Q42284501999-10-04Paper
The space complexity of approximating the frequency moments1999-09-22Paper
https://portal.mardi4nfdi.de/entity/Q42524221999-07-08Paper
https://portal.mardi4nfdi.de/entity/Q42524041999-06-17Paper
Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains1998-11-24Paper
Simple Fast Parallel Hashing by Oblivious Execution1998-09-21Paper
The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms1998-09-21Paper
The queue-read queue-write asynchronous PRAM model1998-08-13Paper
Shuffling biological sequences1997-11-04Paper
https://portal.mardi4nfdi.de/entity/Q43352091997-10-16Paper
https://portal.mardi4nfdi.de/entity/Q31289271997-10-05Paper
Efficient low-contention parallel algorithms1997-09-15Paper
https://portal.mardi4nfdi.de/entity/Q31288831997-04-23Paper
A simple randomized sieve algorithm for the closest-pair problem1995-05-28Paper
Designing algorithms by expectations1994-08-03Paper
https://portal.mardi4nfdi.de/entity/Q31404401993-12-15Paper
https://portal.mardi4nfdi.de/entity/Q31389621993-10-20Paper
Randomized range-maxima in nearly-constant parallel time1993-09-16Paper
https://portal.mardi4nfdi.de/entity/Q40387301993-05-18Paper
On parallel hashing and integer sorting1992-06-28Paper

Research outcomes over time

This page was built for person: Y. Matias