The following pages link to Shlomo Moran (Q287984):
Displaying 50 items.
- Simple and optimal randomized fault-tolerant rumor spreading (Q287985) (← links)
- Tight bounds on the round complexity of distributed 1-solvable tasks (Q673104) (← links)
- A lower bound on the period length of a distributed scheduler (Q689104) (← links)
- (Q760209) (redirect page) (← links)
- On approximation problems related to the independent set and vertex cover problems (Q760210) (← links)
- On the length of optimal TSP circuits in sets of bounded diameter (Q762465) (← links)
- Initial failures in distributed computations (Q915424) (← links)
- Convex recolorings of strings and trees: Definitions, hardness results and algorithms (Q931727) (← links)
- Geometric applications of a matrix-searching algorithm (Q1101223) (← links)
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes (Q1106840) (← links)
- Generalized lower bounds derived from Hastad's main lemma (Q1107987) (← links)
- Extremal problems on permutations under cyclic equivalence (Q1109772) (← links)
- Probabilistic algorithms and straight-line programs for some rank decision problems (Q1155356) (← links)
- Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication (Q1157169) (← links)
- A note on 'Is shortest path problem not harder than matrix multiplication?' (Q1158968) (← links)
- General approximation algorithms for some arithmetical combinatorial problems (Q1158970) (← links)
- On some decision problems for RAM programs (Q1159463) (← links)
- On the complexity of simple arithmetic expressions (Q1162150) (← links)
- Some results on relativized deterministic and nondeterministic time hierarchies (Q1162808) (← links)
- Optimal covering of cacti by vertex-disjoint paths (Q1178689) (← links)
- Rotating-table games and derivatives of words (Q1208719) (← links)
- Space-efficient asynchronous consensus without shared memory initialization (Q1209330) (← links)
- Self-stabilization of dynamic systems assuming only read/write atomicity (Q1310562) (← links)
- The distributed bit complexity of the ring: From the anonymous to the non-anonymous case (Q1314268) (← links)
- Impossibility results in the presence of multiple faulty processes (Q1333256) (← links)
- Simple and efficient network decomposition and synchronization (Q1575640) (← links)
- On the total\(_k\)-diameter of connection networks (Q1583253) (← links)
- Towards optimal distance functions for stochastic substitution models (Q1625881) (← links)
- Comparing evolutionary distances via adaptive distance functions (Q1648942) (← links)
- Concurrent counting (Q1816742) (← links)
- Optimal lower bounds for some distributed algorithms for a complete network of processors (Q1823691) (← links)
- Proving properties of interactive proofs by a generalized counting technique (Q1825663) (← links)
- Exact communication costs for consensus and leader in a tree (Q1827285) (← links)
- On the control power of integer division (Q1838280) (← links)
- Public data structures: counters as a special case. (Q1853535) (← links)
- The complexity of the characterization of networks supporting shortest-path interval routing. (Q1853562) (← links)
- Computing in totally anonymous asynchronous shared memory systems (Q1854512) (← links)
- Competitive caching of query results in search engines (Q1887088) (← links)
- Possibility and impossibility results in a shared memory environment (Q1901689) (← links)
- MinMax algorithms for stabilizing consensus (Q1981802) (← links)
- The firing squad problem revisited (Q2326403) (← links)
- Two-page book embedding of trees under vertex-neighborhood constraints (Q2367407) (← links)
- Optimal implementations of UPGMA and other common clustering algorithms (Q2380024) (← links)
- On the hardness of inferring phylogenies from triplet-dissimilarities (Q2465625) (← links)
- Efficient approximation of convex recolorings (Q2643731) (← links)
- Minimum propositional proof length is NP-hard to linearly approximate (Q2732273) (← links)
- (Q2766866) (← links)
- Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract) (Q2819553) (← links)
- Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges (Q2884008) (← links)
- Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight (Q3032100) (← links)
