The SCEAS System
| |||||||

## Search the dblp DataBase
Tobias Friedrich:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Benjamin Doerr, Tobias Friedrich
**Deterministic Random Walks on the Two-Dimensional Grid.**[Citation Graph (0, 0)][DBLP] ISAAC, 2006, pp:474-483 [Conf] - Deepak Ajwani, Tobias Friedrich, Ulrich Meyer
**An O(n**[Citation Graph (0, 0)][DBLP]^{2.75}) Algorithm for Online Topological Ordering. SWAT, 2006, pp:53-64 [Conf] - Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild
**Unbiased Matrix Rounding.**[Citation Graph (0, 0)][DBLP] SWAT, 2006, pp:102-112 [Conf] - Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild
**Rounding of Sequences and Matrices, with Applications.**[Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:96-109 [Conf] - Tobias Friedrich, Nils Hebbinghaus, Frank Neumann
**Rigorous analyses of simple diversity mechanisms.**[Citation Graph (0, 0)][DBLP] GECCO, 2007, pp:1219-1225 [Conf] - Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler
**Do additional objectives make a problem harder?**[Citation Graph (0, 0)][DBLP] GECCO, 2007, pp:765-772 [Conf] - Tobias Friedrich, Nils Hebbinghaus, Frank Neumann, Jun He, Carsten Witt
**Approximating covering problems by randomized search heuristics using multi-objective models.**[Citation Graph (0, 0)][DBLP] GECCO, 2007, pp:797-804 [Conf] - Deepak Ajwani, Tobias Friedrich, Ulrich Meyer
**An O(n**[Citation Graph (0, 0)][DBLP]^{2.75}) algorithm for online topological ordering CoRR, 2006, v:0, n:, pp:- [Journal] - Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild
**Unbiased Matrix Rounding**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] **Quasirandom Rumor Spreading: An Experimental Analysis.**[Citation Graph (, )][DBLP]**The Cover Time of Deterministic Random Walks.**[Citation Graph (, )][DBLP]**Approximating the Least Hypervolume Contributor: NP-Hard in General, But Fast in Practice.**[Citation Graph (, )][DBLP]**Theoretical analysis of diversity mechanisms for global exploration.**[Citation Graph (, )][DBLP]**Multiplicative approximations and the hypervolume indicator.**[Citation Graph (, )][DBLP]**Set-based multi-objective optimization, indicators, and deteriorative cycles.**[Citation Graph (, )][DBLP]**The maximum hypervolume set yields near-optimal approximation.**[Citation Graph (, )][DBLP]**Foundations of evolutionary multi-objective optimization.**[Citation Graph (, )][DBLP]**Scaling up indicator-based MOEAs by approximating the least hypervolume contributor: a preliminary study.**[Citation Graph (, )][DBLP]**Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness.**[Citation Graph (, )][DBLP]**Smoothed Analysis of Balancing Networks.**[Citation Graph (, )][DBLP]**Average-Case Analysis of Online Topological Ordering.**[Citation Graph (, )][DBLP]**Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects.**[Citation Graph (, )][DBLP]**Average Update Times for Fully-Dynamic All-Pairs Shortest Paths.**[Citation Graph (, )][DBLP]**Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization.**[Citation Graph (, )][DBLP]**Analyzing Hypervolume Indicator Based Algorithms.**[Citation Graph (, )][DBLP]**Tight Bounds for the Approximation Ratio of the Hypervolume Indicator.**[Citation Graph (, )][DBLP]**Deterministic random walks on regular trees.**[Citation Graph (, )][DBLP]**Quasirandom rumor spreading.**[Citation Graph (, )][DBLP]**Quasirandom Load Balancing.**[Citation Graph (, )][DBLP]**Efficient Broadcast on Random Geometric Graphs.**[Citation Graph (, )][DBLP]**Near-perfect load balancing by randomized rounding.**[Citation Graph (, )][DBLP]**Plateaus can be harder in multi-objective optimization.**[Citation Graph (, )][DBLP]**On improving approximate solutions by evolutionary algorithms.**[Citation Graph (, )][DBLP]**When to use bit-wise neutrality.**[Citation Graph (, )][DBLP]**Subband conversion for feature extraction from compressed audio.**[Citation Graph (, )][DBLP]**Approximating the volume of unions and intersections of high-dimensional geometric objects.**[Citation Graph (, )][DBLP]**Average-Case Analysis of Online Topological Ordering**[Citation Graph (, )][DBLP]**Approximating the volume of unions and intersections of high-dimensional geometric objects**[Citation Graph (, )][DBLP]**Approximating the least hypervolume contributor: NP-hard in general, but fast in practice**[Citation Graph (, )][DBLP]**Smoothed Analysis of Balancing Networks**[Citation Graph (, )][DBLP]**Quasirandom Load Balancing**[Citation Graph (, )][DBLP]**The Cover Time of Deterministic Random Walks**[Citation Graph (, )][DBLP]**Fast simulation of large-scale growth models**[Citation Graph (, )][DBLP]**Deterministic Random Walks on Regular Trees**[Citation Graph (, )][DBLP]**Deterministic Random Walks on the Two-Dimensional Grid.**[Citation Graph (, )][DBLP]**Average-case analysis of incremental topological ordering.**[Citation Graph (, )][DBLP]**Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem.**[Citation Graph (, )][DBLP]**Analysis of Diversity-Preserving Mechanisms for Global Exploration.**[Citation Graph (, )][DBLP]**Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |