Alon Itai

David Arnon

Ami Wiesel

IEEE Signal Process. Lett., 2024

2021

On the Optimization Landscape of Maximum Mean Discrepancy.

[BibT_eX]

[DOI]

Amir Globerson

Ami Wiesel

CoRR, 2021

2020

Acronyms: identification, expansion and disambiguation.

[BibT_eX]

[DOI]

Kayla Jacobs

Ann. Math. Artif. Intell., 2020

2016

Randomized Broadcasting in Radio Networks.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

2015

Parsing Hebrew CHILDES transcripts.

[BibT_eX]

[DOI]

Lang. Resour. Evaluation, 2015

2014

A Hebrew verb-complement dictionary.

[BibT_eX]

[DOI]

Hanna Fadida

Lang. Resour. Evaluation, 2014

How to construct a multi-lingual domain ontology.

[BibT_eX]

[DOI]

Nitsan Chrizman

Proceedings of the Ninth International Conference on Language Resources and Evaluation, 2014

2009

Covering a Tree by a Forest.

[BibT_eX]

[DOI]

Fanica Gavril

Proceedings of the Graph Theory, 2009

2008

Randomized Broadcasting in Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Language resources for Hebrew.

[BibT_eX]

[DOI]

Lang. Resour. Evaluation, 2008

Using Movie Subtitles for Creating a Large-Scale Bilingual Corpora.

[BibT_eX]

[DOI]

Einav Itamar

Proceedings of the International Conference on Language Resources and Evaluation, 2008

2007

Canonical density control.

[BibT_eX]

[DOI]

Irit Katriel

Inf. Process. Lett., 2007

Detecting Data Structures from Traces.

[BibT_eX]

[DOI]

Michael Slavkin

Proceedings of the Workshop on Approaches and Applications of Inductive Programming, 2007

2006

A Computational Lexicon of Contemporary Hebrew.

[BibT_eX]

[DOI]

Shlomo Yona

Proceedings of the Fifth International Conference on Language Resources and Evaluation, 2006

Software Fingerprinting.

[BibT_eX]

[DOI]

Alexander Gorovoy

Proceedings of the ITRE 2006, 2006

2004

Strongly competitive algorithms for caching with pipelined prefetching.

[BibT_eX]

[DOI]

Alexander Gaysinsky

Hadas Shachnai

Inf. Process. Lett., 2004

2002

The passport control problem or how to keep a dynamic service system load balanced?

[BibT_eX]

[DOI]

Hadas Shachnai

Theor. Comput. Sci., 2002

2001

Generating permutations and combinations in lexicographical order.

[BibT_eX]

J. Braz. Comput. Soc., 2001

Geometry Helps in Bottleneck Matching and Related Problems.

[BibT_eX]

[DOI]

Alon Efrat

Matthew J. Katz

Algorithmica, 2001

1999

How to Pack Trees.

[BibT_eX]

[DOI]

J. Algorithms, 1999

On an Algorithm of Zemlyachenko for Subtree Isomorphism.

[BibT_eX]

[DOI]

Yefim Dinitz

Inf. Process. Lett., 1999

1998

The Complexity of Type Analysis of Object Oriented Programs.

[BibT_eX]

[DOI]

Proceedings of the ECOOP'98, 1998

1996

Average and Randomized Complexity of Distributed Problems.

[BibT_eX]

[DOI]

Nechama Allenberg-Navony

Shlomo Moran

SIAM J. Comput., 1996

Adaptive Source Routing in High-Speed Networks.

[BibT_eX]

[DOI]

Hadas Shachnai

J. Algorithms, 1996

Improvements on Bottleneck Matching and Related Problems Using Geometry.

[BibT_eX]

[DOI]

Alon Efrat

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995

Timing Verification by Successive Approximation

[BibT_eX]

[DOI]

Inf. Comput., April, 1995

Learning by Distances

[BibT_eX]

[DOI]

Shai Ben-David

Eyal Kushilevitz

Inf. Comput., March, 1995

Learning Morpho-Lexical Probabilities from an Untagged Corpus with an Application to Hebrew.

[BibT_eX]

Moshe Levinger

Uzzi Ornan

Comput. Linguistics, 1995

Packing Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1995

1994

Optimal mapping in direct mapped cache environments.

[BibT_eX]

[DOI]

Shmuel Gal

Yona Hollander

Math. Program., 1994

Nonuniform Learnability.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1994

Word Sense Disambiguation Using a Second Language Monolingual Corpus.

[BibT_eX]

Comput. Linguistics, 1994

Learning Morphology - Practice Makes Good.

[BibT_eX]

[DOI]

Proceedings of the Grammatical Inference and Applications, Second International Colloquium, 1994

1993

Multiple Communication in Multihop Radio Networks.

[BibT_eX]

[DOI]

Amos Israeli

SIAM J. Comput., 1993

A Simple Algorithm for Maintaining the Center of a Planar Point-set.

[BibT_eX]

Alon Efrat

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992

On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization.

[BibT_eX]

[DOI]

Oded Goldreich

J. Comput. Syst. Sci., 1992

Dominating Distributions and Learnability.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

1991

Learnability with Respect to Fixed Distributions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

Efficient Emulation of Single-Hop Radio Network with Collision Detection on Multi-Hop Radio Network with no Collision Detection.

[BibT_eX]

[DOI]

Oded Goldreich

Distributed Comput., 1991

A set expression based inheritance system.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 1991

The Communication Complexity of the Two List Problem.

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 5th International Workshop, 1991

Two Languages Are More Informative Than One.

[BibT_eX]

[DOI]

Ulrike Schwall

Proceedings of the 29th Annual Meeting of the Association for Computational Linguistics, 1991

1990

Symmetry breaking in distributed networks

[BibT_eX]

[DOI]

Inf. Comput., September, 1990

Optimal Distributed t-Resilient Election in Complete Networks.

[BibT_eX]

[DOI]

IEEE Trans. Software Eng., 1990

Automatic Processing of Large Corpora for the Resolution of Anaphora References.

[BibT_eX]

[DOI]

Proceedings of the 13th International Conference on Computational Linguistics, 1990

1989

Three tree-paths.

[BibT_eX]

[DOI]

Avram Zehavi

J. Graph Theory, 1989

1988

The Multi-Tree Approach to Reliability in Distributed Networks

[BibT_eX]

[DOI]

Inf. Comput., October, 1988

The Number of Buffers Required for Sequential Processing of a Disk File.

[BibT_eX]

[DOI]

Yoav Raz

Commun. ACM, 1988

Learnability by Fixed Distributions.

[BibT_eX]

[DOI]

Proceedings of the First Annual Workshop on Computational Learning Theory, 1988

1987

Complexity of Views: Tree and Cyclic Schemas.

[BibT_eX]

[DOI]

Oded Shmueli

SIAM J. Comput., 1987

Unification as a Complexity Measure for Logic Programming.

[BibT_eX]

[DOI]

Johann A. Makowsky

J. Log. Program., 1987

On the Time-Complexity of Broadcast in Radio Networks: An Exponential Gap Between Determinism and Randomization.

[BibT_eX]

[DOI]

Oded Goldreich

Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, 1987

1986

A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem.

[BibT_eX]

[DOI]

Noga Alon

László Babai

J. Algorithms, 1986

A Fast and Simple Randomized Parallel Algorithm for Maximal Matching.

[BibT_eX]

[DOI]

Amos Israeli

Inf. Process. Lett., 1986

1985

Scheduling Transmissions in a Network.

[BibT_eX]

[DOI]

J. Algorithms, 1985

Parallel Arithmetic with Concurrent Writes.

[BibT_eX]

[DOI]

Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, 1985

1984

Bounds on path connectivity.

[BibT_eX]

[DOI]

Avram Zehavi

Discret. Math., 1984

Maintenance of Views.

[BibT_eX]

[DOI]

Oded Shmueli

Proceedings of the SIGMOD'84, 1984

1983

A Golden Ratio Control Policy for a Communication Channel.

[BibT_eX]

Zvi Rosberg

Proceedings of the Computer Performance and Reliability, 1983

1982

Hamilton Paths in Grid Graphs.

[BibT_eX]

[DOI]

Christos H. Papadimitriou

Jayme Luiz Szwarcfiter

SIAM J. Comput., 1982

The complexity of finding maximum disjoint paths with length constraints.

[BibT_eX]

[DOI]

Yehoshua Perl

Yossi Shiloach

Networks, 1982

Representation of Graphs.

[BibT_eX]

[DOI]

Acta Informatica, 1982

1981

Covering Graphs by Simple Circuits.

[BibT_eX]

[DOI]

Christos H. Papadimitriou

Richard J. Lipton

SIAM J. Comput., 1981

A Sparse Table Implementation of Priority Queues.

[BibT_eX]

[DOI]

Alan G. Konheim

Proceedings of the Automata, 1981

Symmetry Breaking in Distributive Networks

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1979

Maximum Flow in Planar Networks.

[BibT_eX]

[DOI]

Yossi Shiloach

SIAM J. Comput., 1979

A Randomized Algorithm for Checking Equivalence of Circular Lists.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1979

1978

Finding a Minimum Circuit in a Graph.

[BibT_eX]

[DOI]

SIAM J. Comput., 1978

Some Matching Problems for Bipartite Graphs.

[BibT_eX]

[DOI]

Steven L. Tanimoto

J. ACM, 1978

Two-Commodity Flow.

[BibT_eX]

[DOI]

J. ACM, 1978

Interpolation Search - A Log Log N Search.

[BibT_eX]

[DOI]

Yehoshua Perl

Haim Avni

Commun. ACM, 1978

Covering a Graph by Circuits.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1978

1977

Finding a Minimum Circuit in a Graph

[BibT_eX]

[DOI]

Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977

Some Matching Problems.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1977

1976

Optimal Alphabetic Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 1976

On the Complexity of Timetable and Multicommodity Flow Problems.

[BibT_eX]

[DOI]

Shimon Even

Adi Shamir

SIAM J. Comput., 1976

1975

On the Complexity of Timetable and Multi-Commodity Flow Problems

[BibT_eX]

[DOI]

Shimon Even