Efficient Algorithms Group

Publications

Articles in

Journals
Conferences
Theses
Others

Filter by Author

2017

Ruben Becker, Andreas Karrenbauer, Sebastian Krinninger, and Christoph Lenzen:
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
Proceedings of the 31st International Symposium on Distributed Computing (DISC'17), 2017.
Karl Bringmann and Sebastian Krinninger
Brief Announcement: A Note on Hardness of Diameter Approximation
Proceedings of the 31st International Symposium on Distributed Computing (DISC'17), 2017.
Petra Berenbrink, Andrea Clementi, Robert Elsässer, Peter Kling, Frederik Mallmann-Trenn, and Emanuele Natale
Ignore or Comply? On Breaking Symmetry in Consensus
Proceedings of the 36st ACM Symposium on Principles of Distributed Computing (PODC'17), 2017.
Andreas Bilke, Colin Cooper, Robert Elsässer, and Tomasz Radzik
Brief Announcement: Population protocols for leader election and exact majority with O(log^2 n) states and O(log^2 n) convergence time
Proceedings of the 36st ACM Symposium on Principles of Distributed Computing (PODC'17), 2017.
Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Frederik Mallmann-Trenn, and Horst Trinker
Brief Announcement: Rapid Asynchronous Plurality Consensus
Proceedings of the 36st ACM Symposium on Principles of Distributed Computing (PODC'17), 2017.
Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, and Nikos Parotsidis
Decremental Data Structures for Connectivity and Dominators in Directed Graphs
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP'17), 2017.
Karl Bringmann, Thomas Dueholm Hansen, and Sebastian Krinninger
Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP'17), 2017
Ittai Abraham, Shiri Chechik, and Sebastian Krinninger
Fully dynamic all-pairs shortest paths with worst-case update-time revisited
Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'17), 2017.

2016

Ittai Abraham, David Durfee, Ioannis Koutis, Sebastian Krinninger, and Richard Peng
On Fully Dynamic Graph Sparsifiers
Proceedings of the 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS'16), 2016.
Petra Berenbrink, Robert Elsässer, and Tom Friedetzky
Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
Distributed Computing 29(5): 317-339 (2016)
Dominik Kaaser, Frederik Mallmann-Trenn and Emanuele Natale
On the Voting Time of the Deterministic Majority Process
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS), 2016.
Greg Bodwin and Sebastian Krinninger
Fully Dynamic Spanners with Worst-Case Update Time
Proceedings of the 24th Annual European Symposium on Algorithms (ESA'16), 2016.
Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai
A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing (STOC'16), 2016.
Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization
SIAM Journal on Computing 45(3):947-1006, 2016
Robert Elsässer and Horst Trinker
On the Isomorphism of Graphs Having Some Eigenvalues of Moderate Multiplicity
Linear Algebra and Its Applications 488: 377-395 (2016).
Dominik S. Kaaser
Efficient Randomized Algorithms for Information Dissemination, Distributed Voting, and Plurality Consensus
PhD thesis, University of Salzburg, 2016.

2015

Colin Cooper, Robert Elsässer, Tomasz Radzik, Nicolás Rivera and Takeharu Shiraga
Fast Consensus for Voting on General Expander Graphs
Proceedings of the 29th International Symposium on Distributed Computing (DISC 2015), 2015.
Dominik Kaaser, Frederik Mallmann-Trenn and Emanuele Natale
Brief Announcement: On the Voting Time of the Deterministic Majority Process
Proceedings of the 29th International Symposium on Distributed Computing (DISC 2015), 2015.
Monika Henzinger, Sebastian Krinninger, and Veronika Loitzenbauer
Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time
Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP'15), 2015
Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai
Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs
Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP'15), 2015
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, and Thatchaphol Saranurak
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
Proceedings of the 47th Annual ACM Symposium on Theory of Computing (STOC'15), 2015
Petra Berenbrink, Robert Elsässer, Thomas Sauerwald
Communication Complexity of Quasirandom Rumor Spreading
Algorithmica 72(2): 467-492 (2015)
Hoda Akbari, Petra Berenbrink, Robert Elsässer, Dominik Kaaser
Discrete Load Balancing in Heterogeneous Networks with a Focus on Second-Order Diffusion
Proceedings of the 35th IEEE International Conference on Distributed Computing Systems (ICDCS 2015), 2015.
Robert Elsässer, Dominik Kaaser
On the Influence of Graph Density on Randomized Gossiping
Proceedings of the 29th IEEE International Parallel & Distributed Processing Symposium (IPDPS 2015), 2015.
Petra Berenbrink, André Brinkmann, Robert Elsässer, Lars Nagel, Tom Friedetzky
Randomized Renaming in Shared Memory Systems
Proceedings of the 29th IEEE International Parallel & Distributed Processing Symposium (IPDPS 2015), 2015.
Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser, and Peter Palfrader
Weighted Straight Skeletons in the Plane
Computational Geometry: Theory and Applications, 48(2):120–133, February 2015
Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser, and Peter Palfrader
A Simple Algorithm for Computing Positively Weighted Straight Skeletons of Monotone Polygons
Information Processing Letters, 115(2):243–247, February 2015

2014

Petra Berenbrink, Robert Elsässer, Thomas Sauerwald
Randomised Broadcasting: Memory vs. Randomness
Theoretical Computer Science 520, 27-42, 2014.
Martin Held, Dominik Kaaser
C2 Approximation of Planar Curvilinear Profiles by Cubic B-Splines
Computer-Aided Design and Applications, Vol. 11 Nr. 2, 206-219, 2014
Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai
Polynomial-Time Algorithms for Energy Games with Special Weight Structures
Algorithmica 70(3):457-492, 2014
Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer, and Michael A. Raskin
Approximating the minimum cycle mean
Theoretical Computer Science 547:104-116, 2014
Sebastian Krinninger
Validity in a logic that combines supervaluation and fuzzy logic based theories of vagueness
Fuzzy Sets and Systems 247:1-17, 2014
Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai
Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time
Proceedings of the 55th IEEE Symposium on Foundations of Computer Science (FOCS'14), 2014
Colin Cooper, Robert Elsässer, Tomasz Radzik
The Power of Two Choices in Distributed Voting
Proc. of the 41st International Colloquium on Automata, Languages, and Programming (ICALP'14), 435-446, 2014.
Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai
Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs
Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC'14), 2014
Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser, and Peter Palfrader
Straight Skeletons of Monotone Polygons
In Proceedings of the 30th European Workshop on Computational Geometry (EuroCG 2014), Ein-Gedi, Israel, March 2014
Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai
A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths
Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'14), 2014

2013

Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik
Coalescing Random Walks and Voting on Connected Graphs
SIAM Journal on Discrete Mathematics, 27(4), 1748-1758.
Peter Hintenaus, Horst Trinker
Multifrequency lock-in detection with nonsinusoidal references
IEEE Trans. Instrum. Meas., 62, 2013, 785-793.
Artur Czumaj, Robert Elsässer, Leszek Gasieniec, Thomas Sauerwald, Xin Wang
Fast Message Dissemination in Random Geometric Graphs
Distributed Computing, 26, 2013, 1-24.
Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS'13), 2013
Chen Avin, Robert Elsässer
Faster Rumor Spreading: Breaking the log n Barrier
Proc. of the 27th International Symposium on Distributed Computing (DISC'13), 209-223, 2013.
Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, and Veronika Loitzenbauer
Approximating the minimum cycle mean
4th International Symposium on Games, Automata, Logics and Formal Verification (GandALF'13), 2013
Robert Elsässer, Michael Meier, Adrian Ogierman
Agent Based Simulations of Epidemics on a Large Scale
Proc. of the 3rd International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH'13), 2013.
Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser, Peter Palfrader
Weighted Straight Skeletons In the Plane
Proceedings of the 25th Canadian Conference on Computational Geometry (CCCG '13), pages 13 – 18, Waterloo, Canada, August 2013
Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai
Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks
40th International Colloquium on Automata, Languages and Programming (ICALP'13), 2013
Martin Held, Dominik Kaaser
Curvature-Continuous Approximation of Planar Curvilinear Profiles
Proceedings of the Computer Aided Design Conference, pages 88–89, Bergamo, Italy, June 17 – 20, 2013

2012

Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai
Polynomial-Time Algorithms for Energy Games with Special Weight Structures
20th Annual European Symposium on Algorithms (ESA'12), 2012
Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik
Coalescing Random Walks and Voting on Graphs
Proc. of the 31st ACM Symposium on Principles of Distributed Computing (PODC'12), 2012, 47-56.
Robert Elsässer, Adrian Ogierman
The Impact of the Power Law Exponent on the Behavior of a Dynamic Epidemic Type Process
Proc. of the 24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'12), 2012, 131-139.
Wolfram Summerer, Marcin Pawliczek, Horst Trinker, Peter Hintenaus, Wolfgang Märzinger, Thomas Reischer, Martin Nowak, Wolfgang Kantner, Martin Emsenhuber, Jürgen Kasberger
Reliable online-prediction of characteristic process parameters by FTNIR-spectroscopic analysis.
Proc. of the 14th Int. Meeting on Chemical Sensors, IMCS 2012, 237-240.

2011

Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Lars Nagel, Thomas Sauerwald
Faster Coupon Collecting via Replication with Applications in Gossiping
Proc. of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS'11), 2011, 72-83.
Robert Elsässer, Tobias Tscheuschner
Settling the Complexity of Local Max-Cut (Almost) Completely
Proc. of the 38th International Colloquium on Automata, Languages and Programming (ICALP'11), 2011, 171-182.
Robert Elsässer, Thomas Sauerwald
Tight Bounds for the Cover Time of Multiple Random Walks
Theoretical Computer Science, 412, 2011, 2623-2641 (special issue for invited ICALP'09 papers).
Horst Trinker
The triple distribution of codes and ordered codes
Discrete Math., 311, 2011, 2283-2294.
Horst Trinker
Cubic and higher degree bounds for codes and (t, m, s)-nets.
Des. Codes Cryptogr., 60, 2011, 101-121.

2010

Petra Berenbrink, Robert Elsässer, Thomas Sauerwald
Communication Complexity of Quasirandom Rumor Spreading
Proc. of the 18th Annual European Symposium on Algorithms (ESA'10), 2010, 134-145.
Robert Elsässer, Thomas Sauerwald
Discrete Load Balancing is (Almost) as Easy as Continuous Load Balancing
Proc. of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC'10), 2010, 346-354.
Petra Berenbrink, Jurek Czyzowicz, Robert Elsässer, Leszek Gasieniec
Efficient Information Exchange in the Random Phone-Call Model
Proc. of the 37th International Colloquium on Automata, Languages and Programming (ICALP'10), 2010, 127-138.
Petra Berenbrink, Colin Cooper, Robert Elsässer, Tomasz Radzik, Thomas Sauerwald
Speeding Up Random Walks with Neighbourhood Exploration
Proc. of the 21st Annual ACM/SIAM Symposium on Discrete Algorithms (SODA'10), 2010, 1422-1435.
Milan Bradonjic, Robert Elsässer, Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer
Efficient Broadcast on Random Geometric Graphs
Proc. of the 21st Annual ACM/SIAM Symposium on Discrete Algorithms (SODA'10), 2010, 1412-1421.
Robert Elsässer, Adrian Ogierman
Efficient Broadcasting in Random Power Law Networks
Proc. of the 36th International Workshop on Graph Theoretic Concepts in Computer Science (WG'10), 2010, 279-291.
Petra Berenbrink, Robert Elsässer, Thomas Sauerwald
Randomised Broadcasting: Memory vs. Randomness
Proc. of the 9th Latin American Theoretical Informatics Symposium (LATIN'10), 2010, 306-319.
Robert Elsässer, Andre Neubert
Toward Proper Random Graph Models for Real World Networks
Proc. of the 9th International Conference on Networks (ICN'10), 2010, 306-315.
Horst Trinker
New explicit bounds for ordered codes and (t, m, s)-nets
Discrete Math., 310, 2010, 970-975.
Peter Färberböck, Jutta Hämmerle-Uhl, Dominik Kaaser, Elias Pschernig, Andreas Uhl
Transforming Rectangular and Polar Iris Images to Enable Cancelable Biometrics
Proceedings of the International Conference on Image Analysis and Recognition (ICIAR'10), pages 276–386, Povoa de Varzim, Portugal, Springer LNCS, 6112, June 21 – 23, 2010
Christian Gruber, Thiemo Gruber, Sebastian Krinninger, and Bernhard Sick
Online Signature Verification With Support Vector Machines Based on LCSS Kernel Functions
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 40(4):1088-1100, 2010

2009

Robert Elsässer, Thomas Sauerwald
Tight Bounds for the Cover Time of Multiple Random Walks
Proc. of the 36th International Colloquium on Automata, Languages and Programming (ICALP'09), 2010, 415-426.
Robert Elsässer, Thomas Sauerwald
Cover Time and Broadcast Time
Proc. of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS'09), 2008, 373-384.
Robert Elsässer, Thomas Sauerwald
On the Runtime and Robustness of Randomized Broadcasting
Theoretical Computer Science, 410, 2009, 3414-3427.
Robert Elsässer, Ulf Lorenz, Thomas Sauerwald
On Randomized Broadcasting in Star Graphs
Discrete Applied Mathematics, 157, 2009, 126-139.
Horst Trinker
A simple derivation of the MacWilliams identity for linear ordered codes and orthogonal arrays
Des. Codes Cryptogr., 50, 2009, 229-234.

2008

Robert Elsässer, Leszek Gąsieniec, Thomas Sauerwald
On Radio Broadcasting in Random Geometric Graphs
Proc. of the 22nd International Symposium on Distributed Computing (DISC'08), 2008, 212-226.
Petra Berenbrink, Robert Elsässer, Tom Friedetzky
Efficient Randomised Broadcasting in Random Regular Networks with Applications in Peer-to-Peer Systems
Proc. of the 27th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC'08), 2008, 155-164.
Robert Elsässer, Thomas Sauerwald
The Power of Memory in Randomized Broadcasting
Proc. of the 19th Annual ACM/SIAM Symposium on Discrete Algorithms (SODA'08), 2008, 218-227.

2007

Robert Elsässer, Thomas Sauerwald
Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
Proc. of the 24st International Symposium on Theoretical Aspects of Computer Science (STACS'07), 2007, 163-174.
Robert Elsässer, Ulf Lorenz, Thomas Sauerwald
Agent-Based Randomized Broadcasting in Large Networks
Discrete Applied Mathematics, 155, 2007, 150-160 (special issue for invited MFCS'04 papers).
Wolfgang Ch. Schmid, Horst Trinker
On linear programming bounds for nets.
Proc. Appl. Math. and Mech. 7, 2007, 1022603-1022604.

2006

Robert Elsässer, Thomas Sauerwald
On the Runtime and Robustness of Randomized Broadcasting
Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC'06), 2006, 349-358.
Robert Elsässer
On Randomized Broadcasting in Power Law Networks
Proc. of the 20th International Symposium on Distributed Computing (DISC'06), 2006, 370-384.
Robert Elsässer
Toward the Eigenvalue Power Law
Proc. of the 31st International Symposium on Mathematical Foundations of Computer Science (MFCS'06), 2006, 351-362.
Robert Elsässer
On the Communication Complexity of Randomized Broadcasting in Random-Like Graphs
Proc. of the 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'06), 2006, 148-157.
Robert Elsässer, Leszek Gąsieniec
Radio Communication in Random Graphs
Journal of Computer and System Sciences, 72, 2006, 490-506.
Distributing Unit Size Workload Packages in Heterogeneous Networks
Journal of Graph Algorithms and Applications, 10, 2006, 51-68 (special issue for invited ESA'04 papers)

2005

Robert Elsässer, Leszek Gąsieniec
Radio Communication in Random Graphs
Proc. of the 17th ACM Symposium on Parallel Algorithms and Architectures (SPAA'05), 2005, 309-315.
Robert Elsässer, Thomas Sauerwald
On Randomized Broadcasting in Star Graphs
31th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'05), 2005, 307-318.
Robert Elsässer, Martin Gairing, Thomas Lüssercking, Marios Mavronicolas, Burkhard Monien
A Simple Graph-Theoretic Model for Selfish Restricted Scheduling
Proc. of the 1st Workshop on Internet and Network Economics (WINE'05), 2005, 195-209.

2004

Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks
Proc. of the 12th European Symposium on Algorithms (ESA'04), 2004, 640-651.
Robert Elsässer, Ulf Lorenz, Thomas Sauerwald
Agent-Based Information Handling in Large Networks
Proc. of the 7th International Symposium on Mathematical Foundations of Computer Science (MFCS'04), 2004, 586-598.
Load Balancing in Dynamic Networks
Proc. of the 7th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'04), 2004, 193-200.
Robert Elsässer, Andreas Frommer, Burkhard Monien, Robert Preis
Optimal Diffusion Schemes and Load Balancing on Product Graphs
Parallel Processing Letters, 14, 2004, 61-73.
Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, J.-P. Tillich
New spectral lower bounds on the bisection width of graphs
Theoretical Computer Science, 320, 2004, 155-174.

2003

Robert Elsässer, Rastislav Kralovic, Burkhard Monien
Sparse Topologies with Small Spectrum Size
Theoretical Computer Science, 307, 2003, 549-565.
Robert Elsässer, Burkhard Monien
Diffusion Load Balancing in Static and Dynamic Networks
Proc. International Workshop on Ambient Intelligence Computing, 2003, 49-62.
Robert Elsässer, Burkhard Monien
Load Balancing of Unit Size Tokens and Expansion Properties of Graphs
Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA'03), 2003, 266-273.
Sergei L. Bezrukov, Robert Elsässer
Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs
Theoretical Computer Science, 307, 2003, 473-492.
Robert Elsässer, Thomas Lücking, Burkhard Monien
On Spectral Bounds for the k-Partitioning of Graphs
Theory of Computing Systems, 36, 2003, 461-478, (special issue for invited SPAA'01 papers).

2002

Robert Elsässer, Burkhard Monien, Robert Preis
Diffusion Schemes for Load Balancing on Heterogeneous Networks
Theory of Computing Systems, 35, 2002, 305-320, (special issue for invited SPAA'00 papers).
Robert Elsässer
Spectral Methods for Efficient Load Balancing Strategies
German Informatics Society - Outstanding Dissertation.
Robert Elsässer, Burkhard Monien, Günter Rote, Stefan Schamberger
Toward Optimal Diffusion Matrices
Proc. of the 16th International Parallel and Distributed Processing Symposium (IPDPS'02), 2002.

2001

Sergei L. Bezrukov, Robert Elsässer
Edge Isoperimetric Problems for Cartesian Powers of Regular Graphs
27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'01), 2001.
Robert Elsässer, Thomas Lücking, Burkhard Monien
New Spectral Bounds on k-Partitioning of Graphs
Proc. of the Thirtheenth ACM Symposium on Parallel Algorithms and Architectures (SPAA'01), 2001, 255-262.
Robert Elsässer, Rastislav Kralovic, Burkhard Monien
Scalable Sparse Topologies with Small Spectrum
18th Annual Symposium on Theoretical Aspects of Computer Science,Proceedings (STACS'01), 2001, 218-229.

2000

Sergei L. Bezrukov, Robert Elsässer
The Spider Poset is Macaulay
Journal of Combinatorial Theory A, 90, 2000, 1-26.
Sergei L. Bezrukov, Sajal Das, Robert Elsässer
An Edge Isoperimetric Problem for Powers of the Petersen Graph
Annals of Combinatorics, 4, 2000, 153-169.
Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, J.-P. Tillich
New spectral lower bounds on the bisection width of graphs
26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'00), Ulrik Brandes, Dorothea Wagner (eds.), Springer, LNCS 1928, Jun 2000, 23-34.
Robert Elsässer, Burkhard Monien, Robert Preis
Diffusive Load Balancing Schemes on Heterogeneous Networks
12th ACM Symposium on Parallel Algorithms and Architectures (SPAA'00), 2000, 30-38.

1999

Sergei L. Bezrukov, Sajal Das, Robert Elsässer
Optimal Cuts for Powers of the Petersen Graph
25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'99), LNCS 1665, 1999, 228-239.
On k-partitioning of Hamming Graphs
Discrete Applied Mathematics, 95, 1999, 127-140.
On Bounds for the k-Partitioning of Graphs
Conference on Computing and Combinatorics (COCOON'99), 1999, 154-163.
Robert Elsässer, Andreas Frommer, Burkhard Monien, Robert Preis
Optimal and Alternating-Direction Loadbalancing Schemes
Euro-Par'99, Parallel Processing, 1999, 280-290.
© 2012 – 2017 Efficient Algorithms Group
Version