Notice: Unexpected clearActionName after getActionName already called in /var/www/html/w/includes/context/RequestContext.php on line 333
Shlomo Moran - MaRDI portal

Shlomo Moran

From MaRDI portal
(Redirected from Person:760209)
Person:287984

Available identifiers

zbMath Open moran.shlomoDBLPm/ShlomoMoranWikidataQ92813 ScholiaQ92813MaRDI QIDQ287984

List of research outcomes





PublicationDate of PublicationType
Diagonalization Games2024-12-12Paper
A lower bound for linear interval routing2024-07-11Paper
On the robustness of \(h^r_m\) (preliminary version)2024-07-11Paper
Diagonalization Games2023-01-05Paper
Elementary Derivations of the Euclidean Hurwitz Algebras Adapted from Gadi Moran’s last paper2021-09-27Paper
MinMax algorithms for stabilizing consensus2021-09-06Paper
Closed schedulers: a novel technique for analyzing asynchronous protocols2020-11-30Paper
The Firing Squad Problem Revisited.2020-08-05Paper
The firing squad problem revisited2019-10-07Paper
Towards optimal distance functions for stochastic substitution models2018-11-26Paper
Comparing evolutionary distances via adaptive distance functions2018-07-05Paper
A lower bound on wait-free counting2017-09-29Paper
Wait-freedom vs. bounded wait-freedom in public data structures (extended abstract)2017-09-29Paper
Concurrent counting2017-08-21Paper
Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract)2016-09-29Paper
Simple and optimal randomized fault-tolerant rumor spreading2016-05-23Paper
Resource bounds for self stabilizing message driven protocols2015-06-19Paper
Partial convex recolorings of trees and galled networks2014-09-09Paper
Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges2012-05-14Paper
https://portal.mardi4nfdi.de/entity/Q35794812010-08-06Paper
Optimal implementations of UPGMA and other common clustering algorithms2010-03-24Paper
Bit complexity of breaking and achieving symmetry in chains and rings2008-12-21Paper
Convex recolorings of strings and trees: Definitions, hardness results and algorithms2008-06-26Paper
On the hardness of inferring phylogenies from triplet-dissimilarities2008-01-07Paper
Efficient approximation of convex recolorings2007-08-27Paper
Algorithms and Data Structures2006-10-25Paper
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques2006-07-07Paper
Competitive caching of query results in search engines2004-11-23Paper
Exact communication costs for consensus and leader in a tree2004-08-06Paper
Public data structures: counters as a special case.2003-01-21Paper
The complexity of the characterization of networks supporting shortest-path interval routing.2003-01-21Paper
Computing in totally anonymous asynchronous shared memory systems2003-01-14Paper
https://portal.mardi4nfdi.de/entity/Q27668662002-01-28Paper
Minimum propositional proof length is NP-hard to linearly approximate2002-01-21Paper
On the total\(_k\)-diameter of connection networks2000-10-26Paper
Simple and efficient network decomposition and synchronization2000-08-21Paper
Impossibility results in the presence of multiple faulty processes2000-08-02Paper
https://portal.mardi4nfdi.de/entity/Q49420302000-03-19Paper
https://portal.mardi4nfdi.de/entity/Q42626931999-09-22Paper
https://portal.mardi4nfdi.de/entity/Q42180981999-03-02Paper
A Lower Bound on Wait-Free Counting1998-05-25Paper
Resource Bounds for Self-Stabilizing Message-Driven Protocols1997-08-03Paper
Average and Randomized Complexity of Distributed Problems1997-06-09Paper
The Wakeup Problem1997-06-09Paper
Concurrent counting1997-03-31Paper
Tight bounds on the round complexity of distributed 1-solvable tasks1997-02-28Paper
Self-stabilization of dynamic systems assuming only read/write atomicity1995-11-22Paper
Possibility and impossibility results in a shared memory environment1995-11-19Paper
A lower bound on the period length of a distributed scheduler1994-05-15Paper
The distributed bit complexity of the ring: From the anonymous to the non-anonymous case1994-02-22Paper
Two-page book embedding of trees under vertex-neighborhood constraints1993-08-10Paper
Gap Theorems for Distributed Computation1993-05-17Paper
Rotating-table games and derivatives of words1993-05-16Paper
Space-efficient asynchronous consensus without shared memory initialization1993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q40281171993-03-28Paper
https://portal.mardi4nfdi.de/entity/Q40288791993-03-28Paper
Optimal covering of cacti by vertex-disjoint paths1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39748551992-06-26Paper
One-Page Book Embedding under Vertex-Neighborhood Constraints1992-06-25Paper
Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight1990-01-01Paper
A combinatorial characterization of the distributed 1-solvable tasks1990-01-01Paper
Initial failures in distributed computations1989-01-01Paper
Optimal lower bounds for some distributed algorithms for a complete network of processors1989-01-01Paper
Proving properties of interactive proofs by a generalized counting technique1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33552191989-01-01Paper
Message complexity versus space complexity in fault tolerant broadcast protocols1989-01-01Paper
Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes1988-01-01Paper
Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays1988-01-01Paper
Geometric applications of a matrix-searching algorithm1987-01-01Paper
Generalized lower bounds derived from Hastad's main lemma1987-01-01Paper
Extremal problems on permutations under cyclic equivalence1987-01-01Paper
The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors1987-01-01Paper
Sequential Machine Characterizations of Trellis and Cellular Automata and Applications1985-01-01Paper
Some independence results in complexity theory1985-01-01Paper
Applications of Ramsey's theorem to decision tree complexity1985-01-01Paper
On approximation problems related to the independent set and vertex cover problems1984-01-01Paper
On the length of optimal TSP circuits in sets of bounded diameter1984-01-01Paper
On the control power of integer division1983-01-01Paper
On the complexity of designing optimal partial-match retrieval systems1983-01-01Paper
Some Time-Space Tradeoff Results Concerning Single-Tape and Offline TM’<scp>s</scp>1983-01-01Paper
Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs1983-01-01Paper
On some decision problems for RAM programs1982-01-01Paper
On the complexity of simple arithmetic expressions1982-01-01Paper
Fair derivations in context-free grammars1982-01-01Paper
On the Accepting Density Hierarchy in NP1982-01-01Paper
A generalization of the fast LUP matrix decomposition algorithm and applications1982-01-01Paper
Probabilistic algorithms and straight-line programs for some rank decision problems1981-01-01Paper
Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication1981-01-01Paper
A note on 'Is shortest path problem not harder than matrix multiplication?'1981-01-01Paper
General approximation algorithms for some arithmetical combinatorial problems1981-01-01Paper
Some results on relativized deterministic and nondeterministic time hierarchies1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39120201981-01-01Paper
The complexity of identifying redundant and essential elements1981-01-01Paper

Research outcomes over time

This page was built for person: Shlomo Moran