default search action
Berthold Vöcking
Person information
- affiliation: RWTH Aachen University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
- [j44]René Beier, Heiko Röglin
, Clemens Rösner, Berthold Vöcking:
The smoothed number of Pareto-optimal solutions in bicriteria integer optimization. Math. Program. 200(1): 319-355 (2023) - [i12]Matthias Englert, Heiko Röglin
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. CoRR abs/2302.06889 (2023)
2010 – 2019
- 2019
- [j43]Berthold Vöcking:
A universally-truthful approximation scheme for multi-unit auctions. Games Econ. Behav. 113: 4-16 (2019) - 2018
- [j42]Thomas Kesselheim, Klaus Radke, Andreas Tönnis
Primal Beats Dual on Online Packing LPs in the Random-Order Model. SIAM J. Comput. 47(5): 1939-1964 (2018) - 2017
- [j41]Yossi Azar, Martin Hoefer, Idan Maor, Rebecca Reiffenhäuser
Truthful mechanism design via correlated tree rounding. Math. Program. 163(1-2): 445-469 (2017) - 2016
- [j40]Matthias Englert, Heiko Röglin
Smoothed Analysis of the 2-Opt Algorithm for the General TSP. ACM Trans. Algorithms 13(1): 10:1-10:15 (2016) - [j39]Martin Hoefer, Thomas Kesselheim, Berthold Vöcking:
Truthfulness and Stochastic Dominance with Monetary Transfers. ACM Trans. Economics and Comput. 4(2): 11:1-11:18 (2016) - [r4]Artur Czumaj, Berthold Vöcking:
Price of Anarchy for Machines Models. Encyclopedia of Algorithms 2016: 1614-1618 - [r3]Piotr Krysta, Berthold Vöcking:
Utilitarian Mechanism Design for Single-Minded Agents. Encyclopedia of Algorithms 2016: 2312-2318 - 2015
- [c73]Yossi Azar
Truthful Mechanism Design via Correlated Tree Rounding. EC 2015: 415-432 - 2014
- [j38]Matthias Englert, Heiko Röglin
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. Algorithmica 68(1): 190-264 (2014) - [j37]Lukas Belke, Thomas Kesselheim, Arie M. C. A. Koster
Comparative study of approximation algorithms and heuristics for SINR scheduling with power control. Theor. Comput. Sci. 553: 64-73 (2014) - [j36]Martin Hoefer, Thomas Kesselheim, Berthold Vöcking:
Approximation Algorithms for Secondary Spectrum Auctions. ACM Trans. Internet Techn. 14(2-3): 16:1-16:24 (2014) - [c72]Maximilian Odendahl, Andres Goens, Rainer Leupers, Gerd Ascheid, Benjamin Ries, Berthold Vöcking, Tomas Henriksson:
Optimized buffer allocation in multicore platforms. DATE 2014: 1-6 - [c71]Artur Czumaj, Berthold Vöcking:
Thorp Shuffling, Butterflies, and Non-Markovian Couplings. ICALP (1) 2014: 344-355 - [c70]Oliver Göbel, Martin Hoefer, Thomas Kesselheim, Thomas Schleiden, Berthold Vöcking:
Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods. ICALP (2) 2014: 508-519 - [c69]Thomas Kesselheim, Klaus Radke, Andreas Tönnis
Primal beats dual on online packing LPs in the random-order model. STOC 2014: 303-312 - 2013
- [j35]Alexander Fanghänel, Sascha Geulen, Martin Hoefer, Berthold Vöcking:
Online capacity maximization in wireless networks. J. Sched. 16(1): 81-91 (2013) - [j34]Matthias Englert, Heiko Röglin
Economical Caching. ACM Trans. Comput. Theory 5(2): 4:1-4:21 (2013) - [c68]Thomas Kesselheim, Klaus Radke, Andreas Tönnis
An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions. ESA 2013: 589-600 - [c67]Martin Hoefer, Thomas Kesselheim, Berthold Vöcking:
Truthfulness and stochastic dominance with monetary transfers. EC 2013: 567-582 - [e6]Berthold Vöcking:
Algorithmic Game Theory - 6th International Symposium, SAGT 2013, Aachen, Germany, October 21-23, 2013. Proceedings. Lecture Notes in Computer Science 8146, Springer 2013, ISBN 978-3-642-41391-9 [contents] - [e5]Guy E. Blelloch, Berthold Vöcking:
25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '13, Montreal, QC, Canada - July 23 - 25, 2013. ACM 2013, ISBN 978-1-4503-1572-2 [contents] - [i11]Oliver Göbel, Martin Hoefer, Thomas Kesselheim, Thomas Schleiden, Berthold Vöcking:
Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods. CoRR abs/1307.3192 (2013) - [i10]Thomas Kesselheim, Klaus Radke, Andreas Tönnis, Berthold Vöcking:
Primal Beats Dual on Online Packing LPs in the Random-Order Model. CoRR abs/1311.2578 (2013) - [i9]Yishay Mansour, Benny Moldovanu, Noam Nisan, Berthold Vöcking:
Electronic Markets and Auctions (Dagstuhl Seminar 13461). Dagstuhl Reports 3(11): 58-78 (2013) - 2012
- [j33]Andreas Emil Feldmann
Computing approximate Nash equilibria in network congestion games. Networks 59(4): 380-386 (2012) - [c66]Lukas Belke, Thomas Kesselheim, Arie M. C. A. Koster
Comparative Study of Approximation Algorithms and Heuristics for SINR Scheduling with Power Control. ALGOSENSORS 2012: 30-41 - [c65]Berthold Vöcking:
Randomized Mechanisms for Multi-unit Auctions - (Extended Abstract). ICALP (2) 2012: 27-29 - [c64]Piotr Krysta, Berthold Vöcking:
Online Mechanism Design (Randomized Rounding on the Fly). ICALP (2) 2012: 636-647 - [c63]Marcel Ochel, Klaus Radke, Berthold Vöcking:
Online Packing with Gradually Improving Capacity Estimations and Applications to Network Lifetime Maximization. ICALP (2) 2012: 648-659 - [c62]Berthold Vöcking:
A universally-truthful approximation scheme for multi-unit auctions. SODA 2012: 846-855 - 2011
- [j32]Heiner Ackermann, Paul W. Goldberg
Uncoordinated Two-Sided Matching Markets. SIAM J. Comput. 40(1): 92-106 (2011) - [j31]Patrick Briest, Piotr Krysta, Berthold Vöcking:
Approximation Techniques for Utilitarian Mechanism Design. SIAM J. Comput. 40(6): 1587-1622 (2011) - [j30]Alexander Fanghänel, Thomas Kesselheim, Berthold Vöcking:
Improved algorithms for latency minimization in wireless networks. Theor. Comput. Sci. 412(24): 2657-2667 (2011) - [c61]Martin Hoefer, Michal Penn, Maria Polukarov, Alexander Skopalik, Berthold Vöcking:
Considerate Equilibrium. IJCAI 2011: 234-239 - [c60]Martin Hoefer, Thomas Kesselheim, Berthold Vöcking:
Approximation algorithms for secondary spectrum auctions. SPAA 2011: 177-186 - [p3]René Beier, Berthold Vöcking:
The Knapsack Problem. Algorithms Unplugged 2011: 375-381 - [p2]Alexander Fanghänel, Berthold Vöcking:
Scheduling and Power Assignments in the Physical Model. Theoretical Aspects of Distributed Computing in Sensor Networks 2011: 31-57 - [e4]Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger
Algorithms Unplugged. Springer 2011, ISBN 978-3-642-15327-3 [contents] - 2010
- [j29]Martin Hoefer, Berthold Vöcking:
Berechnung von Nash-Gleichgewichten. Inform. Spektrum 33(5): 462-467 (2010) - [j28]Artur Czumaj, Piotr Krysta, Berthold Vöcking:
Selfish Traffic Allocation for Server Farms. SIAM J. Comput. 39(5): 1957-1987 (2010) - [j27]Simon Fischer, Harald Räcke, Berthold Vöcking:
Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods. SIAM J. Comput. 39(8): 3700-3735 (2010) - [c59]Sascha Geulen, Berthold Vöcking, Melanie Winkler:
Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm. COLT 2010: 132-143 - [c58]Thomas Kesselheim, Berthold Vöcking:
Brief announcement: distributed contention resolution in wireless networks. PODC 2010: 124-125 - [c57]Alexander Fanghänel, Sascha Geulen, Martin Hoefer, Berthold Vöcking:
Online capacity maximization in wireless networks. SPAA 2010: 92-99 - [c56]Thomas Kesselheim, Berthold Vöcking:
Distributed Contention Resolution in Wireless Networks. DISC 2010: 163-178 - [e3]Anupam Gupta, Stefano Leonardi, Berthold Vöcking, Roger Wattenhofer:
Flexible Network Design, 24.05. - 28.05.2010. Dagstuhl Seminar Proceedings 10211, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i8]Anupam Gupta, Stefano Leonardi, Berthold Vöcking, Roger Wattenhofer:
10211 Abstracts Collection - Flexible Network Design. Flexible Network Design 2010 - [i7]Martin Hoefer, Thomas Kesselheim, Berthold Vöcking:
Approximation Algorithms for Secondary Spectrum Auctions. CoRR abs/1007.5032 (2010) - [i6]Martin Hoefer, Michal Penn, Maria Polukarov, Alexander Skopalik, Berthold Vöcking:
Considerate Equilibrium. CoRR abs/1012.1547 (2010) - [i5]Alexander Fanghänel, Sascha Geulen, Martin Hoefer, Berthold Vöcking:
Online Capacity Maximization in Wireless Networks. Electron. Colloquium Comput. Complex. TR10 (2010) - [i4]Melanie Winkler, Berthold Vöcking, Sascha Geulen:
Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j26]Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking:
Uncoordinated two-sided matching markets. SIGecom Exch. 8(1) (2009) - [j25]Heiner Ackermann, Heiko Röglin
Pure Nash equilibria in player-specific and weighted congestion games. Theor. Comput. Sci. 410(17): 1552-1563 (2009) - [j24]Simon Fischer, Berthold Vöcking:
Adaptive routing with stale information. Theor. Comput. Sci. 410(36): 3357-3371 (2009) - [c55]Anja Feldmann, Simon Fischer, Nils Kammenhuber, Berthold Vöcking:
Management of Variable Data Streams in Networks. Algorithmics of Large and Complex Networks 2009: 266-291 - [c54]Marcel Ochel, Berthold Vöcking:
Approximability of OFDMA Scheduling. ESA 2009: 385-396 - [c53]Berthold Vöcking:
Congestion games: Equilibria, convergence and complexity. GAMENETS 2009: 667 - [c52]Alexander Fanghänel, Thomas Keßelheim, Berthold Vöcking:
Improved Algorithms for Latency Minimization in Wireless Networks. ICALP (2) 2009: 447-458 - [c51]Alexander Fanghänel, Thomas Kesselheim, Harald Räcke, Berthold Vöcking:
Oblivious interference scheduling. PODC 2009: 220-229 - [c50]Matthias Englert, Berthold Vöcking, Melanie Winkler:
Economical Caching with Stochastic Prices. SAGA 2009: 179-190 - [c49]Matthias Englert, Heiko Röglin, Jacob Spönemann, Berthold Vöcking:
Economical Caching. STACS 2009: 385-396 - 2008
- [j23]Simon Fischer, Lars Olbrich, Berthold Vöcking:
Approximating Wardrop equilibria with finitely many agents. Distributed Comput. 21(2): 129-139 (2008) - [j22]Heiner Ackermann, Paul W. Goldberg
A Unified Approach to Congestion Games and Two-Sided Markets. Internet Math. 5(4): 439-457 (2008) - [j21]Heiner Ackermann, Patrick Briest, Alexander Fanghänel, Berthold Vöcking:
Who Should Pay for Forwarding Packets? Internet Math. 5(4): 459-475 (2008) - [j20]Heiner Ackermann, Heiko Röglin
On the impact of combinatorial structure on congestion games. J. ACM 55(6): 25:1-25:22 (2008) - [c48]Heiner Ackermann, Paul W. Goldberg
Uncoordinated two-sided matching markets. EC 2008: 256-263 - [c47]Andreas Emil Feldmann
Computing Approximate Nash Equilibria in Network Congestion Games. SIROCCO 2008: 209-220 - [c46]Alexander Skopalik, Berthold Vöcking:
Inapproximability of pure nash equilibria. STOC 2008: 355-364 - [p1]René Beier, Berthold Vöcking:
Das Rucksackproblem. Taschenbuch der Algorithmen 2008: 405-411 - [e2]Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner:
Taschenbuch der Algorithmen. eXamen.press, Springer 2008, ISBN 978-3-540-76393-2 [contents] - [r2]Artur Czumaj, Berthold Vöcking:
Price of Anarchy for Machines Models. Encyclopedia of Algorithms 2008 - [r1]Piotr Krysta, Berthold Vöcking:
Utilitarian Mechanism Design for Single-Minded Agents. Encyclopedia of Algorithms 2008 - 2007
- [j19]Heiko Röglin
Smoothed analysis of integer programming. Math. Program. 110(1): 21-56 (2007) - [j18]Artur Czumaj, Berthold Vöcking:
Tight bounds for worst-case equilibria. ACM Trans. Algorithms 3(1): 4:1-4:17 (2007) - [j17]Simon Fischer, Berthold Vöcking:
On the structure and complexity of worst-case equilibria. Theor. Comput. Sci. 378(2): 165-174 (2007) - [j16]Heiner Ackermann, Alantha Newman, Heiko Röglin
Decision-making based on approximate and smoothed Pareto curves. Theor. Comput. Sci. 378(3): 253-270 (2007) - [c45]Simon Fischer, Marina Petrova, Petri Mähönen, Berthold Vöcking:
Distributed Load Balancing Algorithm for Adaptive Channel Allocation for Cognitive Radios. CrownCom 2007: 508-513 - [c44]René Beier, Heiko Röglin
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization. IPCO 2007: 53-67 - [c43]Matthias Englert, Heiko Röglin, Berthold Vöcking:
Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract. SODA 2007: 1295-1304 - [c42]Simon Fischer, Lars Olbrich, Berthold Vöcking:
Approximating Wardrop Equilibria with Finitely Many Agents. DISC 2007: 238-252 - [c41]Heiner Ackermann, Paul W. Goldberg
A Unified Approach to Congestion Games and Two-Sided Markets. WINE 2007: 30-41 - [c40]Heiner Ackermann, Patrick Briest, Alexander Fanghänel, Berthold Vöcking:
Who Should Pay for Forwarding Packets? WINE 2007: 208-219 - [e1]Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking:
Probabilistic Methods in the Design and Analysis of Algorithms, 23.09. - 28.09.2007. Dagstuhl Seminar Proceedings 07391, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - [i3]Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking:
07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of Algorithms. Probabilistic Methods in the Design and Analysis of Algorithms 2007 - 2006
- [j15]René Beier, Berthold Vöcking:
An Experimental Study of Random Knapsack Problems. Algorithmica 45(1): 121-136 (2006) - [j14]Peter Sanders, Aravind Srinivasan, Berthold Vöcking:
Foreword. Theory Comput. Syst. 39(6): 785 (2006) - [j13]René Beier, Berthold Vöcking:
Typical Properties of Winners and Losers in Discrete Optimization. SIAM J. Comput. 35(4): 855-881 (2006) - [j12]Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking:
Balanced Allocations: The Heavily Loaded Case. SIAM J. Comput. 35(6): 1350-1385 (2006) - [j11]René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking:
Computing equilibria for a service provider game with (Im)perfect information. ACM Trans. Algorithms 2(4): 679-706 (2006) - [c39]Berthold Vöcking:
Congestion Games: Optimization in Competition. ACiD 2006: 9-20 - [c38]Heiner Ackermann, Heiko Röglin
On the Impact of Combinatorial Structure on Congestion Games. FOCS 2006: 613-622 - [c37]Simon Fischer, Harald Räcke, Berthold Vöcking:
Fast convergence to Wardrop equilibria by adaptive sampling methods. STOC 2006: 653-662 - [c36]Heiner Ackermann, Heiko Röglin
Pure Nash Equilibria in Player-Specific and Weighted Congestion Games. WINE 2006: 50-61 - [i2]Heiner Ackermann, Heiko Röglin, Berthold Vöcking:
On the Impact of Combinatorial Structure on Congestion Games. Electron. Colloquium Comput. Complex. TR06 (2006) - [i1]Matthias Englert, Heiko Röglin, Berthold Vöcking:
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c35]Heiko Röglin
Smoothed Analysis of Integer Programming. IPCO 2005: 276-290 - [c34]Heiner Ackermann, Alantha Newman, Heiko Röglin
Decision Making Based on Approximate and Smoothed Pareto Curves. ISAAC 2005: 675-684 - [c33]Simon Fischer, Berthold Vöcking:
Adaptive routing with stale information. PODC 2005: 276-283 - [c32]Patrick Briest, Piotr Krysta, Berthold Vöcking:
Approximation techniques for utilitarian mechanism design. STOC 2005: 39-48 - [c31]Simon Fischer, Berthold Vöcking:
On the Structure and Complexity of Worst-Case Equilibria. WINE 2005: 151-160 - 2004
- [j10]René Beier, Berthold Vöcking:
Random knapsack in expected polynomial time. J. Comput. Syst. Sci. 69(3): 306-329 (2004) - [j9]Pilar de la Torre, Michael Mitzenmacher, Rajmohan Rajaraman, Berthold Vöcking:
Foreword. Theory Comput. Syst. 37(3): 321 (2004) - [c30]Simon Fischer, Berthold Vöcking:
On the Evolution of Selfish Routing. ESA 2004: 323-334 - [c29]René Beier, Berthold Vöcking:
An Experimental Study of Random Knapsack Problems. ESA 2004: 616-627 - [c28]René Beier, Berthold Vöcking:
Probabilistic analysis of knapsack core algorithms. SODA 2004: 468-477 - [c27]René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking:
Computing equilibria for congestion games with (im)perfect information. SODA 2004: 746-755 - [c26]René Beier, Berthold Vöcking:
Typical properties of winners and losers in discrete optimization. STOC 2004: 343-352 - 2003
- [j8]Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler
Randomized Pursuit-Evasion In Graphs. Comb. Probab. Comput. 12(3): 225-244 (2003) - [j7]Peter Sanders, Berthold Vöcking:
Tail Bounds And Expectations For Random Arc Allocation And Applications. Comb. Probab. Comput. 12(3): 301-318 (2003) - [j6]Berthold Vöcking:
How asymmetry helps load balancing. J. ACM 50(4): 568-589 (2003) - [c25]Amit Agarwal, Tarun Agarwal, Sumit Chopra
An Experimental Study of k-Splittable Scheduling for DNS-Based Traffic Allocation. Euro-Par 2003: 230-235 - [c24]Piotr Krysta, Peter Sanders, Berthold Vöcking:
Scheduling and Traffic Allocation for Tasks with Bounded Splittability. MFCS 2003: 500-510 - [c23]René Beier, Berthold Vöcking:
Random knapsack in expected polynomial time. STOC 2003: 232-241 - 2002
- [j5]Christof Krick, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, Matthias Westermann:
Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. Theory Comput. Syst. 35(2): 217-245 (2002) - [c22]Michele Flammini, Bruce M. Maggs, Jop F. Sibeyn, Berthold Vöcking:
Routing and Communication in Interconnection Networks. Euro-Par 2002: 735 - [c21]Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking:
Randomized Pursuit-Evasion in Graphs. ICALP 2002: 901-912 - [c20]Artur Czumaj, Berthold Vöcking:
Tight bounds for worst-case equilibria. SODA 2002: 413-420 - [c19]Artur Czumaj, Piotr Krysta, Berthold Vöcking:
Selfish traffic allocation for server farms. STOC 2002: 287-296 - [c18]Peter Sanders, Berthold Vöcking:
Random Arc Allocation and Applications. SWAT 2002: 121-130 - 2001
- [c17]Rajmohan Rajaraman, Andréa W. Richa, Berthold Vöcking, Gayathri Vuppuluri:
A data tracking scheme for general networks. SPAA 2001: 247-254 - [c16]Berthold Vöcking:
Almost optimal permutation routing on hypercubes. STOC 2001: 530-539 - 2000
- [j4]Bruce M. Maggs, Berthold Vöcking:
Improved Routing and Sorting on Multibutterflies. Algorithmica 28(4): 438-437 (2000) - [j3]Christian Scheideler, Berthold Vöcking:
From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. SIAM J. Comput. 30(4): 1126-1155 (2000) - [c15]Richard M. Karp, Christian Schindelhauer
Randomized Rumor Spreading. FOCS 2000: 565-574 - [c14]Friedhelm Meyer auf der Heide, Berthold Vöcking, Matthias Westermann:
Caching in networks (extended abstract). SODA 2000: 430-439 - [c13]Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking:
Balanced allocations: the heavily loaded case. STOC 2000: 745-754
1990 – 1999
- 1999
- [j2]Friedhelm Meyer auf der Heide, Berthold Vöcking:
Shortest-Path Routing in Arbitrary Networks. J. Algorithms 31(1): 105-131 (1999) - [c12]Friedhelm Meyer auf der Heide, Berthold Vöcking, Matthias Westermann:
Provably Good and Practical Strategies for Non-Uniform Data Management in Networks. ESA 1999: 89-100 - [c11]Berthold Vöcking:
How Asymmetry Helps Load Balancing. FOCS 1999: 131-141 - [c10]Santosh S. Vempala, Berthold Vöcking:
Approximating Multicast Congestion. ISAAC 1999: 367-372 - [c9]Christof Krick, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, Matthias Westermann:
Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. SPAA 1999: 165-174 - [c8]Christian Scheideler, Berthold Vöcking:
From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. STOC 1999: 215-224 - 1998
- [b1]Berthold Vöcking:
Static and dynamic data Management in networks. University of Paderborn, Germany, 1998, ISBN 978-3-931466-45-9, pp. 1-104 - [j1]Christian Scheideler, Berthold Vöcking:
Universal Continuous Routing Strategies. Theory Comput. Syst. 31(4): 425-449 (1998) - [c7]Richard Cole, Bruce M. Maggs, Friedhelm Meyer auf der Heide, Michael Mitzenmacher, Andréa W. Richa, Klaus Schröder, Ramesh K. Sitaraman
Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks. STOC 1998: 378-388 - 1997
- [c6]Friedhelm Meyer auf der Heide, Berthold Vöcking:
Static and Dynamic Data Management in Networks. Euro-Par 1997: 46-56 - [c5]Bruce M. Maggs, Friedhelm Meyer auf der Heide, Berthold Vöcking, Matthias Westermann:
Exploiting Locality for Data Management in Systems of Limited Bandwidth. FOCS 1997: 284-293 - [c4]Bruce M. Maggs, Berthold Vöcking:
Improved Routing and Sorting on Multibutterflies. STOC 1997: 517-530 - 1996
- [c3]Christian Scheideler, Berthold Vöcking:
Universal Continuous Routing Strategies. SPAA 1996: 141-151 - [c2]Robert Cypher, Friedhelm Meyer auf der Heide, Christian Scheideler, Berthold Vöcking:
Universal Algorithms for Store-and-Forward and Wormhole Routing. STOC 1996: 356-365 - 1995
- [c1]Friedhelm Meyer auf der Heide, Berthold Vöcking:
A Packet Routing Protocol for Arbitrary Networks. STACS 1995: 291-302
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 2024-12-10 21:45 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: