The following pages link to Stephan J. Eidenbenz (Q1741854):
Displaying 26 items.
- (Q208912) (redirect page) (← links)
- (Q238447) (redirect page) (← links)
- Partial digest is hard to solve for erroneous input data (Q817811) (← links)
- Criticality analysis of internet infrastructure (Q969055) (← links)
- Approximation algorithms for terrain guarding. (Q1603553) (← links)
- Incentive compatible and globally efficient position based routing for selfish reverse multicast in wireless sensor networks (Q1662512) (← links)
- Online dominating set (Q1741855) (← links)
- Deterministic preparation of Dicke states (Q2291416) (← links)
- Finding minimum hidden guard sets in polygons --- tight approximability results (Q2489014) (← links)
- (Q3046478) (← links)
- Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data (Q3082959) (← links)
- (Q3181697) (← links)
- ON A NEW CLASS OF LOAD BALANCING NETWORK PROTOCOLS (Q3498228) (← links)
- (Q4511225) (← links)
- (Q4536426) (← links)
- An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee (Q4706223) (← links)
- (Q4796708) (← links)
- Algorithms and Computation (Q5191690) (← links)
- Online Dominating Set (Q5369523) (← links)
- Optimal Placement of Ad Hoc Devices Under a VCG-Style Routing Protocol (Q5391112) (← links)
- Fundamentals of Computation Theory (Q5900789) (← links)
- LATIN 2004: Theoretical Informatics (Q5901658) (← links)
- Inapproximability results for guarding polygons and terrains (Q5946124) (← links)
- Inapproximability of finding maximum hidden sets on polygons and terrains (Q5959557) (← links)
- Generating hidden Markov models from process models through nonnegative tensor factorization (Q6639410) (← links)
- Quantum Volume in Practice: What Users Can Expect from NISQ Devices Dataset (Q6726310) (← links)
