The following pages link to Alon Itai (Q294682):
Displaying 45 items.
- On an algorithm of Zemlyachenko for subtree isomorphism (Q294684) (← links)
- A randomized algorithm for checking equivalence of circular lists (Q599509) (← links)
- Bounds on path connectivity (Q761468) (← links)
- Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection (Q803112) (← links)
- Learnability with respect to fixed distributions (Q809614) (← links)
- Symmetry breaking in distributed networks (Q918187) (← links)
- (Q1073572) (redirect page) (← links)
- A fast and simple randomized parallel algorithm for maximal matching (Q1073573) (← links)
- The multi-tree approach to reliability in distributed networks (Q1109560) (← links)
- Representation of graphs (Q1157966) (← links)
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization (Q1198663) (← links)
- Optimal mapping in direct mapped cache environments (Q1327568) (← links)
- Nonuniform learnability (Q1329161) (← links)
- A set expression based inheritance system (Q1354083) (← links)
- The passport control problem or how to keep a dynamic service system load balanced? (Q1603718) (← links)
- Timing verification by successive approximation (Q1891141) (← links)
- Learning by distances (Q1892878) (← links)
- Acronyms: identification, expansion and disambiguation (Q2188774) (← links)
- Canonical density control (Q2380023) (← links)
- Strongly competitive algorithms for caching with pipelined prefetching (Q2390276) (← links)
- Multiple Communication in Multihop Radio Networks (Q3137713) (← links)
- A golden ratio control policy for a multiple-access channel (Q3330940) (← links)
- Three tree-paths (Q3475297) (← links)
- Covering a Tree by a Forest (Q3655140) (← links)
- Scheduling transmissions in a network (Q3696506) (← links)
- A fast and simple randomized parallel algorithm for the maximal independent set problem (Q3768419) (← links)
- Complexity of Views: Tree and Cyclic Schemas (Q3775009) (← links)
- Unification as a complexity measure for logic programming (Q3782840) (← links)
- (Q3795256) (← links)
- Maximum Flow in Planar Networks (Q3853414) (← links)
- Covering Graphs by Simple Circuits (Q3922184) (← links)
- Optimal Alphabetic Trees (Q4094387) (← links)
- (Q4125770) (← links)
- On the Complexity of Timetable and Multicommodity Flow Problems (Q4132234) (← links)
- Interpolation search—a log log <i>N</i> search (Q4157947) (← links)
- (Q4166786) (← links)
- Finding a Minimum Circuit in a Graph (Q4167596) (← links)
- Two-Commodity Flow (Q4170247) (← links)
- Some Matching Problems for Bipartite Graphs (Q4170253) (← links)
- How to Pack Trees (Q4264490) (← links)
- The complexity of finding maximum disjoint paths with length constraints (Q4741713) (← links)
- Hamilton Paths in Grid Graphs (Q4742820) (← links)
- (Q4796166) (← links)
- Adaptive Source Routing in High-Speed Networks (Q4876692) (← links)
- Average and Randomized Complexity of Distributed Problems (Q5691293) (← links)
