The following pages link to Guy Even (Q391266):
Displaying 50 items.
- Competitive and deterministic embeddings of virtual networks (Q391268) (← links)
- Revisiting randomized parallel load balancing algorithms (Q442270) (← links)
- Parallel randomized load balancing: a lower bound for a more general model (Q533886) (← links)
- Lower bounds for sampling algorithms for estimating the average (Q674290) (← links)
- (Q703229) (redirect page) (← links)
- Min-max tree covers of graphs. (Q703232) (← links)
- Hitting sets online and unique-MAX coloring (Q741535) (← links)
- Dynamic dictionaries for multisets and counting filters with constant time operations (Q832853) (← links)
- Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
- Optimal conclusive sets for comparator networks (Q1008736) (← links)
- Hitting sets when the VC-dimension is small (Q1041786) (← links)
- Approximating minimum feedback sets and multicuts in directed graphs (Q1386376) (← links)
- Minimal controllability of conjunctive Boolean networks is NP-complete (Q1642199) (← links)
- A deterministic distributed 2-approximation for weighted vertex cover in \(O(\log N\log\varDelta/\log^2\log\varDelta)\) rounds (Q1713914) (← links)
- A parametric error analysis of Goldschmidt's division algorithm (Q1765225) (← links)
- Best of two local models: centralized local and distributed local algorithms (Q1784947) (← links)
- A \(1.5\)-approximation algorithm for augmenting edge-connectivity of a graph from \(1\) to \(2\) (Q1944093) (← links)
- Strong polynomiality of the Gass-Saaty shadow-vertex pivoting rule for controlled random walks (Q1945076) (← links)
- A nonmonotone analysis with the primal-dual approach: online routing of virtual circuits with unknown durations (Q2345465) (← links)
- Online packet-routing in grids with bounded buffers (Q2408091) (← links)
- A greedy approximation algorithm for the group Steiner problem (Q2581556) (← links)
- Observability of Boolean networks: a graph-theoretic approach (Q2628669) (← links)
- Optimal distributed covering algorithms (Q2689837) (← links)
- Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems (Q2755062) (← links)
- An Approximation Algorithm for Path Computation and Function Placement in SDNs (Q2835038) (← links)
- Online Multi-Commodity Flow with High Demands (Q2848910) (← links)
- A Nonmonotone Analysis with the Primal-Dual Approach: Online Routing of Virtual Circuits with Unknown Durations (Q2868635) (← links)
- Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs (Q2921425) (← links)
- On network design problems: fixed cost flows and the covering steiner problem (Q2944490) (← links)
- Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming (Q2977210) (← links)
- Deterministic Rateless Codes for BSC (Q2989012) (← links)
- On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem (Q3046506) (← links)
- Hitting Sets Online and Vertex Ranking (Q3092243) (← links)
- The Retiming Lemma: A simple proof and applications (Q3122481) (← links)
- Digital Logic Design (Q3145015) (← links)
- A Strongly Polynomial Algorithm for Controlled Queues (Q3169077) (← links)
- Set connectivity problems in undirected graphs and the directed steiner network problem (Q3189000) (← links)
- Improved approximations of crossings in graph drawings (Q3191996) (← links)
- Parallel Randomized Load Balancing: A Lower Bound for a More General Model (Q3401104) (← links)
- Revisiting Randomized Parallel Load Balancing Algorithms (Q3408172) (← links)
- Approximation Algorithms for Capacitated Rectangle Stabbing (Q3434539) (← links)
- Improved Bounds on the Word Error Probability of<tex>$RA(2)$</tex>Codes With Linear-Programming-Based Decoding (Q3546973) (← links)
- (Q3579405) (← links)
- An O(logn)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines (Q3587434) (← links)
- Mirroring: a technique for pipelining semi-systolic and systolic arrays (Q3840900) (← links)
- Overcoming chip-to-chip delays and clock skews (Q4224365) (← links)
- A real-time systolic integer multiplier (Q4397086) (← links)
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks (Q4441902) (← links)
- Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications (Q4490783) (← links)
- An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem (Q4507392) (← links)
