Amihood Amir

According to our database1, Amihood Amir authored at least 172 papers between 1985 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Can We Recover the Cover?
Algorithmica, 2019

Mind the Gap! - Online Dictionary Matching with One Gap.
Algorithmica, 2019

Finding Periods in Cartesian Tree Matching.
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Cartesian Tree Matching and Indexing.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

Sufficient Conditions for Efficient Indexing Under Different Matchings.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018
Period recovery of strings over the Hamming and edit distances.
Theor. Comput. Sci., 2018

EDoP Distance Between Sets of Incomplete Permutations: Application to Bacteria Classification Based on Gene Order.
Journal of Computational Biology, 2018

Searching for a Modified Pattern in a Changing Text.
Proceedings of the String Processing and Information Retrieval, 2018

Collaborative Filtering Method for Handling Diverse and Repetitive User-Item Interactions.
Proceedings of the 29th on Hypertext and Social Media, 2018

Two-Dimensional Maximal Repetitions.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Quasi-Periodicity Under Mismatch Errors.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

2017
String cadences.
Theor. Comput. Sci., 2017

Two strings at Hamming distance 1 cannot be both quasiperiodic.
Inf. Process. Lett., 2017

Online Recognition of Dictionary with One Gap.
Proceedings of the Prague Stringology Conference 2017, 2017

Longest Common Factor After One Edit Operation.
Proceedings of the String Processing and Information Retrieval, 2017

A User Re-Modeling Approach to Item Recommendation using Complex Usage Data.
Proceedings of the ACM SIGIR International Conference on Theory of Information Retrieval, 2017

Approximate Cover of Strings.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

Can We Recover the Cover?.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016
Similarity Between Compressed Strings.
Encyclopedia of Algorithms, 2016

Two-Dimensional Scaled Pattern Matching.
Encyclopedia of Algorithms, 2016

Multidimensional Compressed Pattern Matching.
Encyclopedia of Algorithms, 2016

The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Period Recovery over the Hamming and Edit Distances.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

2015
Dictionary matching with a few gaps.
Theor. Comput. Sci., 2015

A PTAS for the Square Tiling Problem.
Theor. Comput. Sci., 2015

Range LCP Queries Revisited.
Proceedings of the String Processing and Information Retrieval, 2015

Data Quality Matters in Recommender Systems.
Proceedings of the 9th ACM Conference on Recommender Systems, 2015

On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014
Closest periodic vectors in Lp spaces.
Theor. Comput. Sci., 2014

Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing.
SIAM J. Comput., 2014

Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on Run-Length Encoded Strings.
Proceedings of the String Processing and Information Retrieval, 2014

Multiply Balanced k -Partitioning.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

On Hardness of Jumbled Indexing.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

On Representations of Ternary Order Relations in Numeric Strings.
Proceedings of the 2nd International Conference on Algorithms for Big Data , 2014

Approximate On-line Palindrome Recognition, and Applications.
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

Dictionary Matching with One Gap.
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

On the Efficiency of the Hamming C-Centerstring Problems.
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

Hypertext Searching - A Survey.
Proceedings of the Language, Culture, Computation. Computing - Theory and Technology, 2014

2013
On the hardness of the Consensus String problem.
Inf. Process. Lett., 2013

Pattern Matching with Non Overlapping Reversals - Approximation and On-line Algorithms.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012
Combinatorial Pattern Matching (CPM 2010).
Inf. Comput., 2012

Configurations and Minority in the String Consensus Problem.
Proceedings of the String Processing and Information Retrieval, 2012

Approximate Period Detection and Correction.
Proceedings of the String Processing and Information Retrieval, 2012

Detecting Approximate Periodic Patterns.
Proceedings of the Design and Analysis of Algorithms, 2012

2011
Efficient algorithms for consensus string problems minimizing both distance sum and radius.
Theor. Comput. Sci., 2011

Approximations and Partial Solutions for the Consensus Sequence Problem.
Proceedings of the String Processing and Information Retrieval, 2011

Weighted Shortest Common Supersequence.
Proceedings of the String Processing and Information Retrieval, 2011

Blocked Pattern Matching Problem and Its Applications in Proteomics.
Proceedings of the Research in Computational Molecular Biology, 2011

Closest Periodic Vectors in L p Spaces.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Range LCP.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010
Approximate String Matching with Stuck Address Bits.
Proceedings of the String Processing and Information Retrieval, 2010

A PTAS for the Square Tiling Problem.
Proceedings of the String Processing and Information Retrieval, 2010

Approximate Periodicity.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Cycle Detection and Correction.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

String Rearrangement Metrics: A Survey.
Proceedings of the Algorithms and Applications, 2010

2009
Efficient computations of l1 and l rearrangement distances.
Theor. Comput. Sci., 2009

Parameterized matching on non-linear structures.
Inf. Process. Lett., 2009

Towards a Theory of Patches.
Proceedings of the String Processing and Information Retrieval, 2009

Consensus Optimizing Both Distance Sum and Radius.
Proceedings of the String Processing and Information Retrieval, 2009

Weighted LCS.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

Quasi-distinct Parsing and Optimal Compression Methods.
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

2008
Similarity between Compressed Strings.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Two-Dimensional Scaled Pattern Matching.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Multidimensional Compressed Pattern Matching.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

The Practical Efficiency of Convolutions in Pattern Matching Algorithms.
Fundam. Inform., 2008

Real-time indexing over fixed finite alphabets.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Approximate String Matching with Address Bit Errors.
Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

2007
Improved approximate common interval.
Inf. Process. Lett., 2007

Generalized LCS.
Proceedings of the String Processing and Information Retrieval, 2007

Efficient Computations of l1 and linfinity Rearrangement Distances.
Proceedings of the String Processing and Information Retrieval, 2007

On the Cost of Interchange Rearrangement in Strings.
Proceedings of the Algorithms, 2007

Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

Two-Dimensional Range Minimum Queries.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006
Function Matching.
SIAM J. Comput., 2006

Pattern matching with address errors: rearrangement distances.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Approximate Matching in Weighted Sequences.
Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

Property Matching and Weighted Matching.
Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

Faster Two Dimensional Scaled Matching.
Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

Asynchronous Pattern Matching.
Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

2005
Maximal Association Rules: A Tool for Mining Associations in Text.
J. Intell. Inf. Syst., 2005

Foreword.
Discrete Applied Mathematics, 2005

Asynchronous pattern matching - Metrics.
Proceedings of the Prague Stringology Conference, 2005

Computing Similarity of Run-Length Encoded Strings with Affine Gap Penalty.
Proceedings of the String Processing and Information Retrieval, 2005

Towards Real-Time Suffix Tree Construction.
Proceedings of the String Processing and Information Retrieval, 2005

A Session-GMM Generative Model Using Test Utterance Gaussian Mixture Modeling for Speaker Verification.
Proceedings of the 2005 IEEE International Conference on Acoustics, 2005

Approximate Matching in the L1 Metric.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

Two Glass Balls and a Tower.
Proceedings of the We Will Show Them! Essays in Honour of Dov Gabbay, Volume One, 2005

2004
Faster algorithms for string matching with k mismatches.
J. Algorithms, 2004

The submatrices character count problem: an efficient solution using separable values.
Inf. Comput., 2004

Shape-Embedded-Histograms for Visual Data Mining.
Proceedings of the VisSym 2004, 2004

Theoretical Issues of Searching Aerial Photographs: A Bird's Eye View.
Proceedings of the Prague Stringology Conference 2004, Prague, Czech Republic, August 30, 2004

Efficient One Dimensional Real Scaled Matching.
Proceedings of the String Processing and Information Retrieval, 2004

Speaker Indexing in Audio Archives Using Gaussian Mixture Scoring Simulation.
Proceedings of the Machine Learning for Multimodal Interaction, 2004

Generalized Function Matching.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Text independent speaker recognition using speaker dependent word spotting.
Proceedings of the INTERSPEECH 2004, 2004

Speaker indexing in audio archives using test utterance Gaussian mixture modeling.
Proceedings of the INTERSPEECH 2004, 2004

Swap and Mismatch Edit Distance.
Proceedings of the Algorithms, 2004

Faster Two Dimensional Pattern Matching with Rotations.
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

Efficient Unsupervised Recursive Word Segmentation Using Minimum Description Length.
Proceedings of the COLING 2004, 2004

2003
Efficient text fingerprinting via Parikh mapping.
J. Discrete Algorithms, 2003

Dynamic Text and Static Pattern Matching.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Real Two Dimensional Scaled Matching.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Inplace 2D matching in compressed images.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Analyzing High-Dimensional Data by Subspace Validity.
Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM 2003), 2003

Efficient Multidimensional Quantitative Hypotheses Generation.
Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM 2003), 2003

Function Matching: Algorithms, Applications, and a Lower Bound.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

A rapid method for detection of putative RNAi target genes in genomic data.
Proceedings of the European Conference on Computational Biology (ECCB 2003), 2003

Two-Dimensional Pattern Matching with Rotations.
Proceedings of the Combinatorial Pattern Matching, 14th Annual Symposium, 2003

2002
Online timestamped text indexing.
Inf. Process. Lett., 2002

Separable attributes: a technique for solving the sub matrices character count problem.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
Genetic Threading.
Constraints, 2001

Analyzing Quantitative Databases: Image is Everything.
Proceedings of the VLDB 2001, 2001

Approximate subset matching with Don't Cares.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Overlap matching.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000
The Power of Migration in Multiprocessor Scheduling of Real-Time Systems.
SIAM J. Comput., 2000

Text Indexing and Dictionary Matching with One Error.
J. Algorithms, 2000

Alphabet-Independent and Scaled Dictionary Matching.
J. Algorithms, 2000

Some Connections between Bounded Query Classes and Non-Uniform Complexity
Electronic Colloquium on Computational Complexity (ECCC), 2000

Inplace run-length 2d compressed search.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Faster algorithms for string matching with k mismatches.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Real scaled matching.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Approximate Swapped Matching.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

1999
A simple algorithm for detecting circular permutations in proteins.
Bioinformatics, 1999

Indexing and Dictionary Matching with One Error.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

1998
Two-Dimensional Periodicity in Rectangular Arrays.
SIAM J. Comput., 1998

Optimal Parallel Two Dimensional Text Searching on a CREW PRAM.
Inf. Comput., 1998

The Power of Migration in Multi-Processor Scheduling of Real-Time Systems.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Genetic Algorithms for Protein Threading.
Proceedings of the 6th International Conference on Intelligent Systems for Molecular Biology (ISMB-98), Montréal, Québec, Canada, June 28, 1998

Efficient Special Cases of Pattern Matching with Swaps.
Proceedings of the Combinatorial Pattern Matching, 9th Annual Symposium, 1998

1997
Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms.
SIAM J. Comput., 1997

Inverse Pattern Matching.
J. Algorithms, 1997

An Improved Deterministic Algorithm for Generating Different Many-Element Random Samples.
Inf. Process. Lett., 1997

Pattern Matching In Hypertext.
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

A New and Versatile Method for Association Generation.
Proceedings of the Principles of Data Mining and Knowledge Discovery, 1997

Maximal Association Rules: A New Tool for Mining for Keyword Co-Occurrences in Document Collections.
Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (KDD-97), 1997

Pattern Matching with Swaps.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

Efficient Algorithms for Discovering Frequent Sets in Incremental Databases.
Proceedings of the Workshop on Research Issues on Data Mining and Knowledge Discovery, 1997

An Improved Deterministic Algorithms for Generalized Random Sampling.
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

Two dimensional matching.
Proceedings of the Pattern Matching Algorithms, 1997

1996
Alphabet Independent and Dictionary Scaled Matching.
Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

1995
Improved Dynamic Dictionary Matching
Inf. Comput., June, 1995

Efficient 2-Dimensional Approximate Matching of Half-Rectangular Figures
Inf. Comput., April, 1995

Contributions of theoretical computer science.
SIGACT News, 1995

1994
An Alphabet Independent Approach to Two-Dimensional Pattern Matching.
SIAM J. Comput., 1994

Dynamic Dictionary Matching.
J. Comput. Syst. Sci., 1994

Alphabet Dependence in Parameterized Matching.
Inf. Process. Lett., 1994

Let Sleeping Files Lie: Pattern Matching in Z-compressed Files.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Optimal Two-Dimensional Compressed Matching.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

Maximum Agreement Subtree in a Set of Evolutionary Trees-Metrics and Efficient Algorithms
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993
The Syntax of Parallelism.
Fundam. Inform., 1993

Optimal Parallel Two Dimensional Pattern Matching.
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

Improved Dynamic Dictionary Matching.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

1992
Two-Dimensional Dictionary Matching.
Inf. Process. Lett., 1992

Alphabet Independent Two Dimensional Matching
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Two-Dimensional Periodicity and Its Applications.
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

Efficient Two-Dimensional Compressed Matching.
Proceedings of the IEEE Data Compression Conference, 1992

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

1991
Fast Parallel and Serial Multidimensional Aproximate Array Matching.
Theor. Comput. Sci., 1991

An efficient algorithm for generalized random sampling.
Pattern Recognition Letters, 1991

Efficient matching of nonrectangular shapes.
Ann. Math. Artif. Intell., 1991

Efficient 2-dimensional Approximate Matching of Non-Rectangular Figures.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

Adaptive Dictionary Matching
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990
Optimal view caching.
Inf. Syst., 1990

Efficient Pattern Matching with Scaling.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

Some Connections Between Bounded Query Classes and Non-Uniform Complexity.
Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990

1988
Polynomial Terse Sets
Inf. Comput., April, 1988

1987
Preservation of Expressive Completeness in Temporal Models
Inf. Comput., January, 1987

Expressive Completeness Failure in Branching Time Structures.
J. Comput. Syst. Sci., 1987

Polynomial terse sets.
Proceedings of the Second Annual Conference on Structure in Complexity Theory, 1987

1985
Separation in Nonlinear Time Models
Information and Control, September, 1985


  Loading...