The following pages link to Shlomo Moran (Q287984):
Displayed 41 items.
- Partial convex recolorings of trees and galled networks (Q3189026) (← links)
- The Firing Squad Problem Revisited. (Q3304114) (← links)
- Fair derivations in context-free grammars (Q3319786) (← links)
- On the complexity of designing optimal partial-match retrieval systems (Q3340208) (← links)
- (Q3355219) (← links)
- Elementary Derivations of the Euclidean Hurwitz Algebras Adapted from Gadi Moran’s last paper (Q3379608) (← links)
- A combinatorial characterization of the distributed 1-solvable tasks (Q3485850) (← links)
- Bit complexity of breaking and achieving symmetry in chains and rings (Q3546359) (← links)
- (Q3579481) (← links)
- Some Time-Space Tradeoff Results Concerning Single-Tape and Offline TM’<scp>s</scp> (Q3657434) (← links)
- Sequential Machine Characterizations of Trellis and Cellular Automata and Applications (Q3692872) (← links)
- Some independence results in complexity theory<sup>†</sup> (Q3751002) (← links)
- The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors (Q3769980) (← links)
- Applications of Ramsey's theorem to decision tree complexity (Q3771610) (← links)
- Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays (Q3809272) (← links)
- (Q3912020) (← links)
- The complexity of identifying redundant and essential elements (Q3926037) (← links)
- On the Accepting Density Hierarchy in NP (Q3936190) (← links)
- A generalization of the fast LUP matrix decomposition algorithm and applications (Q3954737) (← links)
- Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs (Q3962460) (← links)
- (Q3974855) (← links)
- (Q4028117) (← links)
- (Q4028879) (← links)
- Gap Theorems for Distributed Computation (Q4032945) (← links)
- (Q4218098) (← links)
- (Q4262693) (← links)
- Resource Bounds for Self-Stabilizing Message-Driven Protocols (Q4337445) (← links)
- A Lower Bound on Wait-Free Counting (Q4349696) (← links)
- One-Page Book Embedding under Vertex-Neighborhood Constraints (Q4713054) (← links)
- Message complexity versus space complexity in fault tolerant broadcast protocols (Q4730761) (← links)
- (Q4942030) (← links)
- Closed schedulers: a novel technique for analyzing asynchronous protocols (Q5136996) (← links)
- Resource bounds for self stabilizing message driven protocols (Q5255827) (← links)
- Concurrent counting (Q5348835) (← links)
- A lower bound on wait-free counting (Q5361384) (← links)
- Wait-freedom vs. bounded wait-freedom in public data structures (extended abstract) (Q5361392) (← links)
- Algorithms and Data Structures (Q5394252) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479370) (← links)
- Average and Randomized Complexity of Distributed Problems (Q5691293) (← links)
- The Wakeup Problem (Q5691299) (← links)
- Diagonalization Games (Q6422614) (← links)