MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Shlomo Moran" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

34 documents found, showing 1 through 10. Next 10 →

ATOM

On the complexity of designing optimal partial-match retrieval systems
by Shlomo Moran — 1983 — ACM Transactions on Database Systems
…On the Complexity of Designing Optimal Partial-Match Retrieval Systems SHLOMO MORAN The Technion…
Cited by 7 (0 self) – Add To MetaCart

Using Approximate Agreement to Obtain Complete Disagreement: The Output Structure of Input-Free Asynchronous Computations
by Shlomo Moran — 1995 — In ISTCS: 3rd Israeli Symposium on the Theory of Computing and Systems
…-Free Asynchronous Computations Shlomo Moran Computer Science Department Technion Haifa 32000, Israel. Abstract A…
Cited by 1 (0 self) – Add To MetaCart

On The Hardness of Inferring Phylogenies from Triplet-Dissimilarities
by Ilan Gronau, Shlomo Moran — 2007
…On The Hardness of Inferring Phylogenies from Triplet-Dissimilarities Ilan Gronau and Shlomo Moran…
Add To MetaCart

Optimal implementations of UPGMA and other common clustering algorithms
by Ilan Gronau, Shlomo Moran — 2007
…Optimal Implementations of UPGMA and Other Common Clustering Algorithms Ilan Gronau Shlomo Moran…
Cited by 1 (1 self) – Add To MetaCart

Possibility and impossibility results in a shared memory environment
by Gadi Taubenfeld, Shlomo Moran — 1996 — Acta Inf
… Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 Shlomo Moran † Computer Science Department Technion…
Cited by 15 (7 self) – Add To MetaCart

Optimizing Result Prefetching in Web Search Engines with Segmented Indices
by Ronny Lempel, Shlomo Moran — 2001 — In VLDB
… of the 28th VLDB Conference, Hong Kong, China, 2002 Ronny Lempel Shlomo Moran Department of Computer Science…
Cited by 17 (1 self) – Add To MetaCart

Wait-freedom vs. bounded wait-freedom in public data structures
by Hagit Brit, Shlomo Moran — 1996 — Universal Journal of Computer Science
… Department, Technion, Haifa 32000, Israel. Shlomo Moran Computer Science Department, Technion, Haifa 32000…
Cited by 4 (2 self) – Add To MetaCart

Efficient approximation of convex recolorings
by Shlomo Moran, Sagi Snir — 2005 — In Proceedings APPROX 2005: 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, published with Proceedings RANDOM 2005
…Efficient Approximation of Convex Recolorings ∗ Shlomo Moran † Sagi Snir ‡ June 14, 2005 Abstract…
Cited by 5 (0 self) – Add To MetaCart

Convex recolorings of strings and trees: Definitions, hardness results, and algorithms
by Shlomo Moran, Sagi Snir — 2005 — Proceedings WADS 2005: 9th International Workshop on Algorithms and Data Structures
…Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms ∗ Shlomo…
Cited by 6 (2 self) – Add To MetaCart

A lower bound on wait-free counting
by Shlomo Moran, Gadi Taubenfeld — 1993 — Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing
…A Lower Bound on Wait-Free Counting ∗ Shlomo Moran † Gadi Taubenfeld ‡ March 18 1997 Abstract A…
Cited by 14 (3 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB