The following pages link to Rudolf Fleischer (Q671402):
Displaying 34 items.
- Matching nuts and bolts faster (Q671403) (← links)
- An algorithmic analysis of the Honey-Bee game (Q714789) (← links)
- Approximating the minimum weight weak vertex cover (Q860818) (← links)
- Communication complexity of multi-processor systems (Q1118403) (← links)
- Simultaneous inner and outer approximation of shapes (Q1201744) (← links)
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figures (Q1201745) (← links)
- A lower bound for the worst case of bottom-up-heapsort (Q1207959) (← links)
- On-line scheduling revisited (Q1592757) (← links)
- Limited bookmark randomized online algorithms for the paging problem (Q1607066) (← links)
- Fun-Sort -- or the chaos of unordered binary search (Q1765229) (← links)
- Decision trees: Old and new results. (Q1854291) (← links)
- Optimal robot localization in trees (Q1854481) (← links)
- Tight bounds on maximal and maximum matchings (Q1877645) (← links)
- Solitaire clobber (Q1884994) (← links)
- Traveling salesmen in the presence of competition (Q1884998) (← links)
- New results for online page replication (Q1887086) (← links)
- Balanced scheduling toward loss-free packet queuing and delay fairness (Q1889602) (← links)
- A communication-randomness tradeoff for two-processor systems (Q1891144) (← links)
- Computing minimum diameter color-spanning sets is hard (Q1944200) (← links)
- A strong and easily computable separation bound for arithmetic expressions involving radicals (Q1977120) (← links)
- Algorithms for core stability, core largeness, exactness, and extendability of flow games (Q2266830) (← links)
- Die another day (Q2272192) (← links)
- Order-preserving matching (Q2437748) (← links)
- Online maintenance of \(k\)-medians and \(k\)-covers on a line (Q2505498) (← links)
- (Q2753734) (← links)
- (Q2753936) (← links)
- (Q2764034) (← links)
- A Survey of the Game “Lights Out!” (Q2848975) (← links)
- (Q2887528) (← links)
- Densest k-Subgraph Approximation on Intersection Graphs (Q3075452) (← links)
- Edge Clique Partition of K 4-Free and Planar Graphs (Q3098071) (← links)
- (Q5077652) (← links)
- Counting Circles Without Computing Them (Q5282815) (← links)
- Matching nuts and bolts faster (Q6487988) (← links)