Zimmermann, Steffen, et al. “How Do Different Sources of the Variance of Online Consumer Ratings Matter?” Workshop on IS Design and Economic Behavior (ISDEB), 2016.
Harks, Tobias, et al. “Routing Games With Progressive Filling.” IEEE/ACM Transactions on Networking, no. 4, IEEE, 2016, pp. 2553–62, doi:10.1109/TNET.2015.2468571.
Drees, Maximilian, et al. “Strategic Online Facility Location.” Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607, doi:10.1007/978-3-319-48749-6_43.
Abshoff, Sebastian, et al. “Towards the Price of Leasing Online.” Journal of Combinatorial Optimization, no. 4, Springer, 2016, pp. 1197--1216, doi:10.1007/s10878-015-9915-5.
Scheideler, Christian, et al. “Towards a Universal Approach for Monotonic Searchability in Self-Stabilizing Overlay Networks.” Proceedings of the 30th International Symposium on Distributed Computing (DISC), 2016, pp. 71--84, doi:10.1007/978-3-662-53426-7_6.
Abu-Khzam, Faisal N., et al. “The Monotone Circuit Value Problem with Bounded Genus Is in NC.” Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON), 2016, pp. 92–102, doi:10.1007/978-3-319-42634-1_8.
Monien, Burkhard, and Marios Mavronicolas. “The Complexity of Equilibria for Risk-Modeling Valuations.” Theoretical Computer Science, vol. 634, Elsevier, 2016, pp. 67–96, doi:10.1016/j.tcs.2016.04.013.
Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.” Concurrency and Computation: Practice and Experience, vol. 28, no. 5, Wiley Online Library, 2016, pp. 1655–77, doi:10.1002/cpe.3716.
Gutt, Dominik, and Philipp Herrmann. “Sharing Means Caring? Hosts’ Price Reactions to Rating Visibility.” Proceedings of the 23rd European Conference on Information Systems (ECIS), Münster, 2015.
Wette, Philip, and Holger Karl. “HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks.” Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015), 2015, pp. 1--7, doi:10.1109/EWSDN.2015.57.
Scheideler, Christian, et al. “Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures.” Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS), 2015, doi:10.4230/LIPIcs.OPODIS.2015.24.
Koutsopoulos, Andreas, et al. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2015, pp. 201–16, doi:10.1007/978-3-319-21741-3_14.
Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed Locally Self-Adjusting Binary Search Trees.” Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM), 2015, pp. 175--186, doi:10.1007/978-3-319-15612-5_16.
Monien, Burkhard, and Marios Mavronicolas. “The Complexity of Pure Equilibria in Mix-Weighted Congestion Games on Parallel Links.” Information Processing Letters, vol. 115, no. 12, Elsevier, 2015, pp. 927–31, doi:10.1016/j.ipl.2015.07.012.
Schwabe, Arne, and Holger Karl. “SynRace: Decentralized Load-Adaptive Multi-Path Routing without Collecting Statistics.” Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015), 2015, pp. 37–42, doi:10.1109/EWSDN.2015.58.
Gutt, Dominik, and Dennis Kundisch. “Rating Aggregation in Multi-Dimensional Rating Systems: How Do Reviewers Form Overall Ratings?” INFORMS Annual Meeting, 2015.
Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.” Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 2015, pp. 343–44, doi:10.1145/2767386.2767454.
Caragiannis, Ioannis, et al. “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure.” Transactions on Economics and Computation, vol. 3, no. 1, 2, ACM, 2015, doi:10.1145/2614687.
Cox, Joe, and Daniel Kaimann. “How Do Reviews from Professional Critics Interact with Other Signals of Product Quality? Evidence from the Video Game Industry.” Journal of Consumer Behaviour, vol. 14, no. 6, Wiley Online Library, 2015, pp. 366–77, doi:10.1002/cb.1553.
Herrmann, Philipp, et al. “How Do Different Sources of the Variance of Consumer Ratings Matter?” Proceedings of the 36th International Conference on Information Systems (ICIS), Fort Worth, 2015.
Drees, Maximilian, et al. “On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games.” Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT), 2015, pp. 178–89, doi:10.1007/978-3-662-48433-3_14.
Cord-Landwehr, Andreas, and Pascal Lenzner. “Network Creation Games: Think Global - Act Local.” Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS), 2015, pp. 248--260, doi:10.1007/978-3-662-48054-0_21.
Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems.” Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON), 2015, pp. 277--288, doi:10.1007/978-3-319-21398-9_22.
Fahr, Rene, and Behnud Mir Djawadi. “‘…and They Are Really Lying’: Clean Evidence on the Pervasiveness of Cheating in Professional Contexts from a Field Experiment.” Journal of Economic Psychology, Elsevier, 2015, pp. 48–59, doi:10.1016/j.joep.2015.03.002.
Monien, Burkhard, et al. “Weighted Boolean Formula Games.” The ´Festschrift´ Algorithms, Probability, Networks, and Games: Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of His 60th Birthday, 2015, pp. 49–86, doi:10.1007/978-3-319-24024-4_6.
Buechel, Berno, and Nils Röhl. “Robust Equilibria in Location Games.” European Journal of Operational Research, vol. 240, no. 2, Elsevier, 2015, pp. 505–17, doi:10.1016/j.ejor.2014.07.019.
Schwabe, Arne, and Holger Karl. “Topology Model to Generate Realistic Latency for Simulations.” 2015 IEEE International Conference on Communications, ICC 2015, London, United Kingdom, June 8-12, 2015, 2015, pp. 6122--6127, doi:10.1109/ICC.2015.7249298.
Monien, Burkhard, and Marios Mavronicolas. “Minimizing Expectation Plus Variance.” Theory of Computing Systems, vol. 57, no. 3, Springer, 2015, pp. 617–54, doi:10.1007/s00224-014-9542-z.
Wette, Philip, et al. “MaxiNet: Distributed Emulation of Software-Defined Networks.” Proceedings of the 2014 IFIP Networking Conference (Networking 2014), 2014, pp. 1–9, doi:10.1109/IFIPNetworking.2014.6857078.
Wette, Philip, and Holger Karl. “Using Application Layer Knowledge in Routing and Wavelength Assignment Algorithms.” Proceedings of the IEEE International Conference on Communications 2014, 2014, pp. 3270–76, doi:10.1109/ICC.2014.6883825.
Brangewitz, Sonja, et al. “Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services.” Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION), 2014, pp. 49–57.
Keller, Matthias, et al. “Template Embedding: Using Application Architecture to Allocate Resources in Distributed Clouds.” Proceedings of 7th International Conference on Utility and Cloud Computing (UCC), 2014, pp. 387--395, doi:10.1109/UCC.2014.49.
Blazovics, Laszlo, et al. “Surrounding Robots -- A Discrete Localized Solution for the Intruder Problem.” Journal of Advanced Computational Intelligence and Intelligent Informatics, no. 3, Fuji Technology Press Ltd., 2014, pp. 315--319, doi:10.20965/jaciii.2014.p0315.
Dräxler, Sevil, et al. “Specifying and Placing Chains of Virtual Network Functions.” Proceedings of the 3rd International Conference on Cloud Networking (CloudNet), 2014, pp. 7–13, doi:10.1109/CloudNet.2014.6968961.
Janiuk, Jens, et al. “Secure Distributed Data Structures for Peer-to-Peer-Based Social Networks.” Proceedings of the International Conference on Collaboration Technologies and Systems (CTS), 2014, pp. 396–405, doi:10.1109/CTS.2014.6867595.
Harks, Tobias, et al. “Routing Games with Progressive Filling.” Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14), 2014, pp. 352–60, doi:10.1109/TNET.2015.2468571.
Keller, Matthias, and Holger Karl. “Response Time-Optimized Distributed Cloud Resource Allocation.” Proceedings of the SIGCOMM Workshop on Distributed Cloud Computing, 2014, pp. 47--52, doi:10.1145/2627566.2627570.
Kniesburges, Sebastian, et al. “Re-Chord: A Self-Stabilizing Chord Overlay Network.” Theory of Computing Systems, no. 3, Springer, 2014, pp. 591–612, doi:10.1007/s00224-012-9431-2.
Abshoff, Sebastian, et al. “Randomized Online Algorithms for Set Cover Leasing Problems.” Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2014, pp. 25–34, doi:10.1007/978-3-319-12691-3_3.
Cord-Landwehr, Andreas, et al. “Quality of Service in Network Creation Games.” Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 423–28, doi:10.1007/978-3-319-13129-0_34.
Künsemöller, Jörn, et al. “Provider Competition in Infrastructure-as-a-Service.” Proceedings of the 2014 IEEE International Conference on Services Computing (SCC), 2014, pp. 203–10, doi:10.1109/SCC.2014.35.
Mir Djawadi, Behnud, et al. “Conceptual Model and Economic Experiments to Explain Nonpersistence and Enable Mechanism Designs Fosterin Behavioral Change.” Value in Health, no. 8, Elsevier, 2014, pp. 814–22, doi:10.1016/j.jval.2014.08.2669.
Brangewitz, Sonja, and Jan-Philip Gamp. “Competitive Outcomes and the Inner Core of NTU Market Games.” Economic Theory, no. 3, Springer, 2014, pp. 529–54, doi:10.1007/s00199-014-0846-7.
Drees, Maximilian, et al. “Budget-Restricted Utility Games with Ordered Strategic Decisions.” Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), edited by Ron Lavi, 2014, pp. 110–21, doi:10.1007/978-3-662-44803-8_10.
Abshoff, Sebastian, et al. “Brief Announcement: A Model for Multilevel Network Games.” Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), edited by Ron Lavi, 2014, p. 294.
Feldotto, Matthias, et al. “Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria.” Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 30–43, doi:10.1007/978-3-319-13129-0_3.
Hansknecht, Christoph, et al. “Approximate Pure Nash Equilibria in Weighted Congestion Games.” Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2014, pp. 242–57, doi:10.4230/LIPIcs.APPROX-RANDOM.2014.242.
Gairing, Martin, et al. “Approximate Pure Nash Equilibria in Social Context Congestion Games.” Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 480–85, doi:10.1007/978-3-319-13129-0_43.
Kniesburges, Sebastian, et al. “Algorithmic Aspects of Resource Management in the Cloud.” Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2014, pp. 1–13, doi:10.1007/978-3-319-09620-9_1.
Feldotto, Matthias, and Alexander Skopalik. “A Simulation Framework for Analyzing Complex Infinitely Repeated Games.” Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014), 2014, pp. 625–30, doi:10.5220/0005110406250630.
Gall, Dominik, et al. “A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization.” Theory of Computing Systems, no. 1, Springer, 2014, pp. 110–35, doi:10.1007/s00224-013-9504-x.
Künsemöller, Jörn, and Holger Karl. “A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service.” Future Generation Computer Systems, Elsevier, 2014, pp. 44--52, doi:10.1016/j.future.2014.03.005.
Schwabe, Arne, and Holger Karl. “Using MAC Addresses as Efficient Routing Labels in Data Centers.” Proceedings of the Third Workshop on Hot Topics in Software Defined Networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014, 2014, pp. 115--120, doi:10.1145/2620728.2620730.
Foreback, Dianne, et al. “On Stabilizing Departures in Overlay Networks.” Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2014, pp. 48--62, doi:10.1007/978-3-319-11764-5_4.
Abshoff, Sebastian, et al. “Multilevel Network Games.” Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 435–40, doi:10.1007/978-3-319-13129-0_36.
Scheideler, Christian, et al. “Minimum Linear Arrangement of Series-Parallel Graphs.” Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA), 2014, pp. 168--180.
Jungmann, Alexander, et al. “Incorporating Reputation Information into Decision-Making Processes in Markets of Composed Services.” International Journal On Advances in Intelligent Systems (IntSys), vol. 7, no. 3&4, IARIA, 2014, pp. 572--594.
Feldotto, Matthias, et al. “HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths.” Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10, doi:10.1109/P2P.2014.6934300.
Wette, Philip, and Holger Karl. “Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow.” Proceedings of the ACM SIGCOMM ’13, 2013, pp. 541–42, doi:10.1145/2486001.2491710.
Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.” Theory of Computing Systems, no. 2, Springer, 2013, pp. 341–63, doi:10.1007/s00224-013-9454-3.
Abshoff, Sebastian, et al. “Token Dissemination in Geometric Dynamic Networks.” Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers, 2013, pp. 22–34, doi:10.1007/978-3-642-45346-5_3.
Frick, Bernd, and Robert Simmons. “The Impact of Individual and Collective Reputation on Wine Prices: Empirical Evidence from the Mosel Valley.” Journal of Business Economics, vol. 83, no. 2, Springer, 2013, pp. 101–19, doi:10.1007/s11573-013-0652-x.
Graffi, Kalman, and Lars Bremer. “Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case.” Proceedings of the International Conference on Communications (ICC’13), 2013, pp. 3444–49, doi:10.1109/ICC.2013.6655082.
Benter, Markus, et al. “Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks.” Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 2013, pp. 2193–201, doi:10.1109/INFCOM.2013.6567022.
Abshoff, Sebastian, et al. “On Two-Party Communication Through Dynamic Networks.” Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS), 2013, pp. 11–22, doi:10.1007/978-3-319-03850-6_2.
Wette, Philip, and Holger Karl. “On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks.” Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN), 2013, pp. 1–6, doi:10.1109/LANMAN.2013.6528271.
Autenrieth, Marcus, and Hannes Frey. “On Greedy Routing in Degree-Bounded Graphs over d-Dimensional Internet Coordinate Embeddings.” Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 126–31, doi:10.1109/NetSys.2013.10.
Avin, Chen, et al. “Locally Self-Adjusting Tree Networks.” Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2013, pp. 395–406, doi:10.1109/IPDPS.2013.40.
Brangewitz, Sonja, and Claus-Jochen Haake. Cooperative Transfer Price Negotiations under Incomplete Information. Vol. 64, CIE Working Paper Series, Paderborn University, 2013.
Wette, Philip, and Holger Karl. “Incorporating Feedback from Application Layer into Routing and Wavelength Assignment Algorithms.” Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 2013, pp. 51–52, doi:10.1109/INFCOMW.2013.6970733.
Graffi, Kalman, and Vitaly Rapp. “Continuous Gossip-Based Aggregation through Dynamic Information Aging.” Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13), 2013, pp. 1–7, doi:10.1109/ICCCN.2013.6614118.
Feldotto, Matthias, and Kalman Graffi. “Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.” Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13), 2013, pp. 99–106, doi:10.1109/HPCSim.2013.6641399.
Graffi, Kalman, et al. “Ca-Re-Chord: A Churn Resistant Self-Stabilizing Chord Overlay Network.” Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 27–34, doi:10.1109/NetSys.2013.11.
Graffi, Kalman, and Timo Klerx. “Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks.” Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13), 2013, pp. 1–5, doi:10.1109/P2P.2013.6688720.
Flocchini, Paola, et al., editors. Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics. Vol. 8243, Springer, 2013, doi:10.1007/978-3-642-45346-5.
Wette, Philip, and Kalman Graffi. “Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables.” Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 35–42, doi:10.1109/NetSys.2013.9.
Keller, Matthias, et al. “A Local Heuristic for Latency-Optimized Distributed Cloud Deployment.” Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud Computing, 2013, pp. 429–34, doi:10.1109/UCC.2013.85.
Markarian, Christine, et al. “A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks.” Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS), 2013, pp. 217–27, doi:10.1007/978-3-642-45346-5_16.
Kniesburges, Sebastian, et al. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO), 2013, pp. 165–76, doi:10.1007/978-3-319-03578-9_14.
Haake, Claus-Jochen, and Jan Thomas Martini. “Negotiating Transfer Prices.” Group Decision and Negotiation, vol. 22, no. 4, Springer Nature, 2012, pp. 657–80, doi:10.1007/s10726-012-9286-6.
Haake, Claus-Jochen, et al. “On the Institutional Design of Burden Sharing When Financing External Border Enforcement in the EU.” International Economics and Economic Policy, vol. 10, no. 4, Springer Nature, 2012, pp. 583–612, doi:10.1007/s10368-012-0226-3.
Clouser, Thomas, et al. “Tiara: A Self-Stabilizing Deterministic Skip List and Skip Graph.” Theoretical Computer Science, Elsevier, 2012, pp. 18–35, doi:10.1016/j.tcs.2011.12.079.
Damerow, Valentina, et al. “Smoothed Analysis of Left-to-Right Maxima with Applications.” Transactions on Algorithms, no. 3, ACM, 2012, p. 30, doi:10.1145/2229163.2229174.
Mavronicolas, Marios, and Burkhard Monien. “Minimizing Expectation Plus Variance.” Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 239–50, doi:10.1007/978-3-642-33996-7_21.
Wette, Philip, and Holger Karl. Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios. Universität Paderborn, 2012.
Brandes, Philipp, and Friedhelm Meyer auf der Heide. “Distributed Computing in Fault-Prone Dynamic Networks.” Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14, doi:10.1145/2414815.2414818.
Schmid, Stefan, et al. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.” Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 439–40, doi:10.1007/978-3-642-33651-5_47.
Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.” Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 435–36, doi:10.1007/978-3-642-33651-5_45.
Cord-Landwehr, Andreas, et al. “Basic Network Creation Games with Communication Interests.” Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 72--83, doi:10.1007/978-3-642-33996-7_7.
Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case.” Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA), 2012, pp. 800–10, doi:10.1137/1.9781611973099.64.
Meyer auf der Heide, Friedhelm, et al. “An Algorithm for Facility Leasing.” Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO), 2012, pp. 61–72, doi:10.1007/978-3-642-31104-8_6.
Kniesburges, Sebastian, et al. “A Self-Stabilization Process for Small-World Networks.” Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1261--1271, doi:10.1109/IPDPS.2012.115.
Dimitrov, Dinko, and Claus-Jochen Haake. “Proportionality and the Power of Unequal Parties.” International Journal of Economic Theory, vol. 7, no. 2, Wiley-Blackwell, 2011, pp. 189–200, doi:10.1111/j.1742-7363.2011.00158.x.
Graffi, Kalman. “PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned.” Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP), 2011, pp. 154–55, doi:10.1109/P2P.2011.6038673.
Abshoff, Sebastan, et al. “Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks.” Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS), 2011, pp. 13–27, doi:10.1007/978-3-642-28209-6_3.
Nesterenko, Mikhail, et al. “Corona: A Stabilizing Deterministic Message-Passing Skip List.” Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 356--370, doi:10.1007/978-3-642-24550-3_27.
Meyer auf der Heide, Friedhelm, and Rajmohan Rajaraman, editors. 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures. 2011, doi:10.1145/1989493.