The following pages link to Michael Elkin (Q265068):
Displayed 50 items.
- Optimizing budget allocation for center and median points (Q265070) (← links)
- Energy fluctuations shape free energy of nonspecific biomolecular interactions (Q411519) (← links)
- Space-efficient path-reporting approximate distance oracles (Q517013) (← links)
- Approximating \(k\)-spanner problems for \(k>2\) (Q557826) (← links)
- A faster distributed protocol for constructing a minimum spanning tree (Q856405) (← links)
- Bounds on the performance of back-to-front airplane boarding policies (Q957361) (← links)
- Low-light trees, and tight lower bounds for Euclidean spanners (Q972609) (← links)
- Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition (Q992509) (← links)
- A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605) (← links)
- On efficient distributed construction of near optimal routing schemes (Q1741966) (← links)
- An improved construction of progression-free sets (Q1758902) (← links)
- Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC (Q2084978) (← links)
- Combinatorial algorithms for distributed graph coloring (Q2251151) (← links)
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models (Q2375302) (← links)
- New length bounds for cycle bases (Q2380021) (← links)
- Terminal embeddings (Q2405893) (← links)
- The hardness of approximating spanner problems (Q2464336) (← links)
- Sublogarithmic approximation for telephone multicast (Q2495404) (← links)
- An approximation algorithm for the directed telephone multicast problem (Q2505499) (← links)
- Near isometric terminal embeddings for doubling metrics (Q2665904) (← links)
- Distributed strong diameter network decomposition (Q2672581) (← links)
- (Q2728855) (← links)
- (Q2754183) (← links)
- (Q2921674) (← links)
- (Q2921725) (← links)
- Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition (Q2934329) (← links)
- Balancing Degree, Diameter, and Weight in Euclidean Spanners (Q2935264) (← links)
- Prioritized Metric Structures and Embedding (Q2941541) (← links)
- Can quantum communication speed up distributed computation? (Q2943619) (← links)
- An improved algorithm for radio broadcast (Q2944544) (← links)
- Combinatorial Algorithms for Distributed Graph Coloring (Q3095316) (← links)
- Optimal Euclidean Spanners (Q3177744) (← links)
- Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners (Q3189002) (← links)
- An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem (Q3434993) (← links)
- Sparse Sourcewise and Pairwise Distance Preservers (Q3440267) (← links)
- A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Q3460717) (← links)
- Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem (Q3579240) (← links)
- Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem (Q3580979) (← links)
- Lower-stretch spanning trees (Q3581444) (← links)
- Lower-Stretch Spanning Trees (Q3624378) (← links)
- (Q4449177) (← links)
- (Q4471276) (← links)
- (Q4471324) (← links)
- (Q4537738) (← links)
- Efficient Algorithms for Constructing Very Sparse Spanners and Emulators (Q4575779) (← links)
- Ramsey Spanning Trees and Their Applications (Q4607997) (← links)
- Efficient Algorithms for Constructing Very Sparse Spanners and Emulators (Q4629974) (← links)
- $(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs (Q4651484) (← links)
- Logarithmic inapproximability of the radio broadcast problem (Q4828562) (← links)
- Fast Constructions of Lightweight Spanners for General Graphs (Q4962607) (← links)