The following pages link to Amotz Bar-Noy (Q442254):
Displayed 50 items.
- Ordered coloring of grids and related graphs (Q442258) (← links)
- Online maximum directed cut (Q454250) (← links)
- Consensus algorithms with one-bit messages (Q757011) (← links)
- Decision-driven scheduling (Q779453) (← links)
- Weighted microscopic image reconstruction (Q831836) (← links)
- Online dynamic programming speedups (Q839641) (← links)
- Changing of the guards: strip cover with duty cycling (Q896691) (← links)
- Optimal delay for media-on-demand with pre-loading and pre-buffering (Q930897) (← links)
- Scheduling techniques for media-on-demand (Q1018046) (← links)
- A lower bound for radio broadcast (Q1176103) (← links)
- Fault-tolerant critical section management in asynchronous environments (Q1183601) (← links)
- Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement (Q1187030) (← links)
- The greedy algorithm is optimal for on-line edge coloring (Q1209350) (← links)
- Broadcasting multiple messages in simultaneous send/receive systems (Q1339400) (← links)
- On chromatic sums and distributed resource allocation (Q1383159) (← links)
- Sharing video on demand (Q1399105) (← links)
- Competitive on-Line switching policies (Q1400895) (← links)
- Optimal broadcasting of two files over an asymmetric channel (Q1567393) (← links)
- New algorithms for related machines with temporary jobs. (Q1588054) (← links)
- A matched approximation bound for the sum of a greedy coloring (Q1606980) (← links)
- Improved approximation algorithms for weighted 2-path partitions (Q1706113) (← links)
- Realizability of graph specifications: characterizations and algorithms (Q1713877) (← links)
- Optimal computation of census functions in the postal model (Q1804885) (← links)
- Efficient algorithms for periodic scheduling (Q1886514) (← links)
- Optimal amortized distributed consensus (Q1898481) (← links)
- Paging mobile users in cellular networks: optimality versus complexity and simplicity (Q1935810) (← links)
- Optimal multiple message broadcasting in telephone-like communication systems (Q1962017) (← links)
- ``Green'' barrier coverage with mobile sensors (Q1998844) (← links)
- A fair-cost analysis of the random neighbor sampling method (Q2086576) (← links)
- Relaxed and approximate graph realizations (Q2115836) (← links)
- Vertex-weighted graphs: realizable and unrealizable domains (Q2154111) (← links)
- The generalized microscopic image reconstruction problem (Q2172424) (← links)
- Vertex-weighted realizations of graphs (Q2286737) (← links)
- Graph profile realizations and applications to social networks (Q2327517) (← links)
- Average case network lifetime on an interval with adjustable sensing ranges (Q2345943) (← links)
- Set it and forget it: approximating the set once strip cover problem (Q2408917) (← links)
- Windows scheduling of arbitrary-length jobs on multiple machines (Q2434274) (← links)
- Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging (Q2465999) (← links)
- On vertex-weighted realizations of acyclic and general graphs (Q2672574) (← links)
- On vertex-weighted graph realizations (Q2692719) (← links)
- (Q2768321) (← links)
- Approximating the Throughput of Multiple Machines in Real-Time Scheduling (Q2784456) (← links)
- On-Line Load Balancing in a Hierarchical Server Topology (Q2784469) (← links)
- Nearly optimal perfectly-periodic schedules (Q2787671) (← links)
- Competitive dynamic bandwidth allocation (Q2790099) (← links)
- Approximating the throughput of multiple machines under real-time scheduling (Q2819592) (← links)
- A Competitive Rate Allocation Game (Q2840913) (← links)
- Maximizing Barrier Coverage Lifetime with Mobile Sensors (Q2849300) (← links)
- Changing of the Guards: Strip Cover with Duty Cycling (Q2913209) (← links)
- “Green” Barrier Coverage with Mobile Sensors (Q2947008) (← links)