default search action
Rolf Wanka
Person information
- affiliation: University of Erlangen-Nuremberg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2006
- [b2]Rolf Wanka:
Approximationsalgorithmen - eine Einführung. Leitfäden der Informatik, Teubner 2006, ISBN 978-3-519-00444-8, pp. I-XII, 1-206 - 1995
- [b1]Rolf Wanka:
Paralleles Sortieren auf mehrdimensionalen Gittern. University of Paderborn, Germany, Shaker 1995, ISBN 978-3-8265-0423-5, pp. 1-119
Journal Articles
- 2025
- [j12]Bernd Bassimir
, Rolf Wanka
On the computation of robust examination timetables: methods and experimental results. J. Sched. 28(2): 159-181 (2025) - 2022
- [j11]Moritz Mühlenthaler
Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax. Nat. Comput. 21(4): 651-677 (2022) - 2020
- [j10]Bernd Bassimir
Self-adaptive potential-based stopping criteria for Particle Swarm Optimization with forced moves. Swarm Intell. 14(4): 285-311 (2020) - 2019
- [j9]Rolf Wanka
Swarm intelligence. it Inf. Technol. 61(4): 157-158 (2019) - 2016
- [j8]Moritz Mühlenthaler
Fairness in academic course timetabling. Ann. Oper. Res. 239(1): 171-188 (2016) - 2015
- [j7]Manuel Schmitt, Rolf Wanka
Particle swarm optimization almost surely finds local optima. Theor. Comput. Sci. 561: 57-72 (2015) - 2013
- [j6]Manuel Schmitt, Rolf Wanka
Exploiting independent subformulas: A faster approximation scheme for #k-SAT. Inf. Process. Lett. 113(9): 337-344 (2013) - 2004
- [j5]Jan Klein
The Randomized Sample Tree: A Data Structure for Interactive Walkthroughs in Externally Stored Virtual Environments. Presence Teleoperators Virtual Environ. 13(6): 617-637 (2004) - 2000
- [j4]Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oesterdiekhoff, Rolf Wanka:
Periodification scheme: constructing sorting networks with constant period. J. ACM 47(5): 944-967 (2000) - 1997
- [j3]Friedhelm Meyer auf der Heide, Martin Storch, Rolf Wanka:
Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks. Theory Comput. Syst. 30(6): 627-644 (1997) - 1996
- [j2]Friedhelm Meyer auf der Heide, Brigitte Oesterdiekhoff, Rolf Wanka:
Strongly Adaptive Token Distribution. Algorithmica 15(5): 413-427 (1996) - 1992
- [j1]Miroslaw Kutylowski, Rolf Wanka
Periodic Sorting on Two-Dimensional Meshes. Parallel Process. Lett. 2: 213-220 (1992)
Conference and Workshop Papers
- 2024
- [c36]Matthias Kergaßner
Markov Chain-based Optimization Time Analysis of Bivalent Ant Colony Optimization for Sorting and LeadingOnes. GECCO 2024 - 2019
- [c35]Alexander Raß
Runtime Analysis of Discrete Particle Swarm Optimization Applied to Shortest Paths Computation. EvoCOP 2019: 115-130 - 2017
- [c34]Moritz Mühlenthaler
Runtime Analysis of a Discrete Particle Swarm Optimization Algorithm on Sorting and OneMax. FOGA 2017: 13-24 - 2015
- [c33]Lydia Schwab, Manuel Schmitt, Rolf Wanka:
Multimodal medical image registration using particle swarm optimization with influence of the data's initial orientation. CIBCB 2015: 1-8 - [c32]Alexander Raß
Explanation of Stagnation at Points that are not Local Optima in Particle Swarm Optimization by Potential Analysis. GECCO (Companion) 2015: 1463-1464 - 2014
- [c31]Vanessa Lange
Towards a Better Understanding of the Local Attractor in Particle Swarm Optimization: Speed and Solution Quality. ICAIS 2014: 90-99 - [c30]Bernd Bassimir
How Much Forcing Is Necessary to Let the Results of Particle Swarms Converge? ICSIBO 2014: 98-105 - 2013
- [c29]Manuel Schmitt, Rolf Wanka
Particles prefer walking along the axes: experimental insights into the behavior of a particle swarm. GECCO (Companion) 2013: 17-18 - [c28]Manuel Schmitt, Rolf Wanka
Particle swarm optimization almost surely finds local optima. GECCO 2013: 1629-1636 - 2012
- [c27]Christian Riess, Volker Strehl, Rolf Wanka:
The Spectral Relation between the Cube-Connected Cycles and the Shuffle-Exchange Network. ARCS Workshops 2012: 505-516 - 2011
- [c26]Matthias Hoffmann, Moritz Mühlenthaler
Discrete Particle Swarm Optimization for TSP: Theoretical Results and Experimental Evaluations. ICAIS 2011: 416-427 - [c25]Josef Angermeier, Eugen Sibirko, Rolf Wanka
Bitonic Sorting on Dynamically Reconfigurable Architectures. IPDPS Workshops 2011: 314-317 - [c24]Ludmila Omeltschuk, Sabine Helwig, Moritz Mühlenthaler
Heterogeneous constraint handling for particle swarm optimization. SWIS 2011: 37-43 - 2010
- [c23]Moritz Mühlenthaler, Rolf Wanka:
Improving Bitonic Sorting by Wire Elimination. ARCS Workshops 2010: 15-22 - [c22]Thomas Ritscher, Sabine Helwig, Rolf Wanka
Design and experimental evaluation of multiple adaptation layers in self-optimizing particle swarm optimization. IEEE Congress on Evolutionary Computation 2010: 1-8 - [c21]Quirin Meyer, Fabian Schönfeld, Marc Stamminger, Rolf Wanka
3-SAT on CUDA: Towards a massively parallel SAT solver. HPCS 2010: 306-313 - 2008
- [c20]Thilo Streichert, Michael Glaß
Topology-Aware Replica Placement in Fault-Tolerant Embedded Networks. ARCS 2008: 23-37 - [c19]Johannes Jordan
Social interaction in particle swarm optimization, the ranked FIPS, and adaptive multi-swarms. GECCO 2008: 49-56 - [c18]Sabine Helwig, Rolf Wanka
Theoretical Analysis of Initial Particle Swarm Behavior. PPSN 2008: 889-898 - [c17]Michael Glaß
Multi-objective routing and topology optimization in networked embedded systems. ICSAMOS 2008: 74-81 - 2007
- [c16]Christian Riess, Rolf Wanka:
Periodic Load Balancing on the N -Cycle: Analytical and Experimental Evaluation. Euro-Par 2007: 805-814 - [c15]Sabine Helwig, Rolf Wanka
Particle Swarm Optimization in High-Dimensional Bounded Search Spaces. SIS 2007: 198-205 - 2002
- [c14]Jan Klein
The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments. VRST 2002: 137-146 - [c13]Rolf Wanka:
Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal. WG 2002: 413-420 - 2001
- [c12]Friedhelm Meyer auf der Heide, Rolf Wanka:
Parallel Bridging Models and Their Impact on Algorithm Design. International Conference on Computational Science (2) 2001: 628-637 - 2000
- [c11]Marcus Bednara, Oliver Beyer, Jürgen Teich, Rolf Wanka:
Tradeoff Analysis and Architecture Design of a Hybrid Hardware/Software Sorter. ASAP 2000: 299-308 - 1999
- [c10]Ernst W. Mayr, Friedhelm Meyer auf der Heide, Rolf Wanka:
International Workshop on Communication and Data Management in Large Networks. GI Jahrestagung 1999: 334 - 1998
- [c9]Yuval Rabani
Local Divergence of Markov Chains and the Analysis of Iterative Load Balancing Schemes. FOCS 1998: 694-705 - 1997
- [c8]Alf Wachsmann, Rolf Wanka:
Sorting on a Massively Parallel System Using a Library of Basic Primitives: Modeling and Experimental Results. Euro-Par 1997: 399-408 - [c7]Klaus Brockmann, Rolf Wanka:
Efficient Oblivious Parallel Sorting on the MasPar MP-1. HICSS (1) 1997: 200-208 - [c6]Miroslaw Kutylowski, Rolf Wanka:
Playing Tetris on Meshes and Multi-Dimensional SHEARSORT. ISAAC 1997: 32-41 - 1995
- [c5]Friedhelm Meyer auf der Heide, Martin Storch, Rolf Wanka:
Optimal Trade-Offs Between Size and Slowdown for Universal Parallel Networks. SPAA 1995: 119-128 - 1994
- [c4]Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oesterdiekhoff, Rolf Wanka:
Fast and Feasible Periodic Sorting Networks of Constant Depth. FOCS 1994: 369-380 - [c3]Ralf Diekmann, Jörn Gehring, Reinhard Lüling, Burkhard Monien, Markus Nubel, Rolf Wanka:
Sorting large data sets on a massively parallel system. SPDP 1994: 2-9 - 1993
- [c2]Friedhelm Meyer auf der Heide, Brigitte Oesterdiekhoff, Rolf Wanka:
Strongly Adaptive Token Distribution. ICALP 1993: 398-409 - 1989
- [c1]Friedhelm Meyer auf der Heide, Rolf Wanka
Time-Optimal Simulations of Networks by Universal Parallel Computers. STACS 1989: 120-131
Parts in Books or Collections
- 2011
- [p2]Rolf Wanka
Parallel Sorting - The Need for Speed. Algorithms Unplugged 2011: 27-37 - 2008
- [p1]Rolf Wanka:
Paralleles Sortieren - Parallel geht schnell. Taschenbuch der Algorithmen 2008: 31-41
Informal and Other Publications
- 2024
- [i12]Matthias Kergaßner, Oliver Keszöcze, Rolf Wanka:
Markov Chain-based Optimization Time Analysis of Bivalent Ant Colony Optimization for Sorting and LeadingOnes. CoRR abs/2405.03353 (2024) - 2023
- [i11]Bernd Bassimir, Rolf Wanka:
Robustness Approaches for the Examination Timetabling Problem under Data Uncertainty. CoRR abs/2311.17766 (2023) - 2020
- [i10]Bernd Bassimir, Alexander Raß, Rolf Wanka:
The Convergence Indicator: Improved and completely characterized parameter bounds for actual convergence of Particle Swarm Optimization. CoRR abs/2006.03944 (2020) - 2019
- [i9]Moritz Mühlenthaler, Alexander Raß, Manuel Schmitt, Rolf Wanka:
Exact Markov Chain-based Runtime Analysis of a Discrete Particle Swarm Optimization Algorithm on Sorting and OneMax. CoRR abs/1902.01810 (2019) - [i8]Bernd Bassimir, Manuel Schmitt, Rolf Wanka:
Self-adaptive Potential-based Stopping Criteria for Particle Swarm Optimization. CoRR abs/1906.08867 (2019) - 2015
- [i7]Alexander Raß, Manuel Schmitt, Rolf Wanka:
Explanation of Stagnation at Points that are not Local Optima in Particle Swarm Optimization by Potential Analysis. CoRR abs/1504.08241 (2015) - [i6]Moritz Mühlenthaler, Rolf Wanka:
On the Connectedness of Clash-free Timetables. CoRR abs/1507.02805 (2015) - 2014
- [i5]Vanessa Lange, Manuel Schmitt, Rolf Wanka:
Towards a Better Understanding of the Local Attractor in Particle Swarm Optimization: Speed and Solution Quality. CoRR abs/1406.1691 (2014) - 2013
- [i4]Manuel Schmitt, Rolf Wanka:
Exploiting Independent Subformulas: A Faster Approximation Scheme for #k-SAT. CoRR abs/1302.6900 (2013) - [i3]Moritz Mühlenthaler, Rolf Wanka:
Fairness in Academic Course Timetabling. CoRR abs/1303.2860 (2013) - [i2]Manuel Schmitt, Rolf Wanka:
Particles Prefer Walking Along the Axes: Experimental Insights into the Behavior of a Particle Swarm. CoRR abs/1303.6145 (2013) - [i1]Moritz Mühlenthaler, Rolf Wanka:
A Decomposition of the Max-min Fair Curriculum-based Course Timetabling Problem. CoRR abs/1306.5601 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-10-28 23:38 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: