Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Porat, Ely - Computer Science Department, Bar Ilan University
Swap Matching in Time O(n log m log j\Sigmaj) Amihood Amir \Lambda Richard Cole y Ramesh Hariharan z
DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Faster Algorithms for String Matching with k Mismatches Amihood Amir \Lambday Moshe Lewenstein \Lambda z Ely Porat \Lambda
Ecient pebbling for list traversal synopses Yossi Matias Ely Porat y
E#cient One Dimensional Real Scaled Matching Amihood Amir # Ayelet Butman + Moshe Lewenstein # Ely Porat
Tree Pattern Matching and Subset Matching in Randomized O(n log 3 m) Time
A Randomized Algorithm for Approximate String Matching Mikhail J. Atallah \Lambda
Approximated Pattern Matching with the L 1 ; L 2 and L1 Metrics
Approximation Algorithms Vijay V. Vazirani
Approximate Swapped Matching Amihood Amir \Lambda Moshe Lewenstein y Ely Porat z
The Hebrew University of Jerusalem Lecture 8 Basic Number Theory
The Hebrew University of Jerusalem Lecture 9 Asymmetric Cryptography
Improved algorithms for Polynomial-Time Decay and Time-Decay with additive error
Approximate Matching in the L Metric Ohad Lipsky Ely Porat
RC 21409 (02/17/99) Computer Science/Mathematics
Improved Sketching of Hamming Distance with Error Ohad Lipsky
Effective Computation of Biased Quantiles over Data Streams Graham Cormode
Space-Efficient Online Computation of Quantile Michael Greenwald
Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications
