direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

All publications

<< previous [1]
next >> [23]

F

Franceschetti, Massimo and Dousse, Olivier and Tse, David N.C. and Thiran, Patrick (2007). Closing the gap in the capacity of wireless networks via percolation theory [27]. IEEE Transactions on Information Theory, 1009–1018.


Frank, Benjamin and Poese, Ingmar and Smaragdakis, Georgios and Feldmann, Anja and Maggs, Bruce and Uhlig, Steve and Aggarwal, Vinay and Schneider, Fabian (2013). Collaboration Opportunities for Content Delivery and Network Infrastructures [28]. ACM SIGCOMM ebook on Recent Advances in Networking


Frank, Benjamin and Poese, Ingmar and Lin, Yin and Smaragdakis, Georgios and Feldmann, Anja and Maggs, Bruce and Rake, Jannis and Uhlig, Steve and Weber, Rick (2013). Pushing CDN-ISP Collaboration to the Limit [29]. ACM SIGCOMM CCR, 34–44.


Frank, Benjamin and Poese, Ingmar and Smaragdakis, Georgios and Uhlig, Steve and Feldmann, Anja (). CaTE (Content-aware Traffic Engineering) [30]. (Talk at the third DENOG meeting (DENOG '11))


Frank, Benjamin (2009). Developing Efficient Ranking Algorithms for the Oracle Service [31]. Technische Universität München


Frank, Benjamin (2014). Dynamic content delivery infrastructure deployment using network cloud resources [32]. Technische Universität Berlin


Frank, Benjamin and Poese, Ingmar and Smaragdakis, Georgios and Uhlig, Steve and Feldmann, Anja (2012). Content-aware Traffic Engineering [33]. Proceeings of ACM SIGMETRICS 2012 (poster session). ACM, 413–414.


Frank, Benjamin and Poese, Ingmar and Smaragdakis, Georgios and Uhlig, Steve and Feldmann, Anja (2012). Content-aware Traffice Engineering [34]. (Technical Report)


Benjamin Frank and Ingmar Poese and Georgios Smaragdakis and Anja Feldmann and Bruce M. Maggs and Steve Uhlig and Vinay Aggarwal and Fabian Schneider (2013). Collaboration Opportunities for Content Delivery and Network Infrastructures [35]. ACM SIGCOMM ebook on Recent Advances in Networking


Friedland, Gerald and Maier, Gregor and Sommer, Robin and Weaver, Nicholas (2011). Sherlock Holmes' Evil Twin: On The Impact of Global Inference for Online Privacy [36]. New Security Paradigms Workshop (NSPW '11). ACM, 105–114.


Fürst, Carlo and Schmid, Stefan and Feldmann, Anja (2013). Virtual Network Embedding with Collocation: Benefits and Limitations of Pre-Clustering [37]. Proceedings of the 2013 IEEE 2nd International Conference on Cloud Networking (CloudNet), 91–98.


Fürst, Carlo (2011). Approximations for VNet Embeddings [38]. Technische Universität Berlin


Fürst, Carlo and Schmid, Stefan and Feldmann, Anja (2012). On the Benefit of Collocation in Virtual Network Embeddings (Short Paper) [39]. 1st IEEE International Conference on Cloud Networking (CLOUDNET)


G

Gafni, Eli and Kuznetsov, Petr (2011). Relating L-Resilience and Wait-Freedom via Hitting Sets [40]. 12th International Conference on Distributed Computing and Networking (ICDCN '11). Springer, 191–202.


Gafni, Eli and Kuznetsov, Petr (2010). Turning Adversaries into Friends: Simplified, Made Constructive, and Extended [41]. Proceedings of 14th International Conference On Principles Of Distributed Systems (OPODIS '10). Springer, 380–394.


Gafni, Eli and Kuznetsov, Petr (2010). On L-Resilient Adversaries, Hitting Sets and Colorless Tasks [42]. 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2010). ACM, 81–82.


Gafni, Eli and Kuznetsov, Petr (2010). On L-Resilient Adversaries, Hitting Sets and Colorless Tasks [43]. (Technical Report)


Gafni, Eli and Kuznetsov, Petr (2007). N-Consensus is the Second Strongest Object for N+1 Processes [44]. 11th International Conference On Principles Of DIstributed Systems (OPODIS 2007). Springer, 260–273.


Gafni, Eli and Kuznetsov, Petr (2011). On Set Consensus Numbers [45]. Distributed Computing. Springer, 149-163.


Gafni, Eli and Kuznetsov, Petr (2009). On Set Consensus Numbers [46]. (Technical Report)


Gafni, Eli and Kuznetsov, Petr (2009). The Weakest Failure Detector for Solving k-Set Agreement [47]. (Forschungsbericht (Research report))


Gafni, Eli and Kuznetsov, Petr (2009). On Set Consensus Numbers [48]. Distributed Computing (Proceedings of the 23rd International Symposium on Distributed Computing (DISC 2009)). Springer, 35–47.


Gafni, Eli and Kuznetsov, Petr (2009). The Weakest Failure Detector for Solving k-Set Agreement [49]. 28th ACM SIGACT/SIGOPS Symposium on Principles of Distributed Computing (PODC 2009). ACM, 83–91.


Gall, Dominik and Jacob, Riko and Richa, Andréa and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo (2010). Time Complexity of Distributed Topological Self-Stabilization: The Case of Graph Linearization [50]. Proceedings of 9th Latin American Theoretical Informatics Symposium (LATIN '10). Springer, 294–305.


Gall, Dominik and Jacob, Riko and Richa, Andréa and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo (2009). Brief Announcement: On the Time Complexity of Distributed Topological Self-Stabilization [51]. Stabilization, Safety, and Security of Distributed Systems – Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). Springer, 781–782.


Gall, Dominik and Jacob, Riko and Richa, Andréa and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo (2008). Modeling Scalability in Distributed Self-Stabilization: The Case of Graph Linearization [52]. (Technical Report)


Dominik Gall and Riko Jacob and Andrea Richa and Christian Scheideler and Stefan Schmid and Hanjo Taeubig (2014). A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization [53]. Theory of Computing Systems (TOCS)


Silvia Gandy (2006). Development and Optimisation of Acquisition algorithms for modernized GPS and Galileo Navigation Signals for a hardware receiver [54]. Technische Universität München


Gersmann, Stefan (2004). Entwicklung eines UPnP SDK [55]. Technische Universität München


Gilbert, Anna C. and Willinger, Walter and Feldmann, Anja (1999). Scaling analysis of conservative cascades, with applications to network traffic [56]. IEEE Transactions on Information Theory, 971–991.


Gilbert, Anna C. and Willinger, Walter and Feldmann, Anja (1998). Visualizing multifractal scaling behavior: a simple scaling heuristic [57]. Conference Record of the Thirty-Second Asilomar Conference on Signals, Systems & Computers, 715–722.


Giotsas, Vasileios and Dietzel, Christoph and Smaragdakis, Georgios and Feldmann, Anja and Berger, Arthur and Aben, Emile (2017). Detecting Peering Infrastructure Outages in the Wild [58]. Proceedings of ACM SIGCOMM 2017


Glukhovskyi, Oleksii (2010). Automated QoE monituoring in PJSIP VoIP client [59]. Technische Universität Berlin


Golovatenko, Roman (2011). On the Compressibility of Forwarding Tables in the Internet [60]. Technische Universität Berlin


Gramoli, Vincent and Kuznetsov, Petr and Ravi, Srivatsan and Shang, Di (2015). A Concurrency-Optimal List-Based Set [61]. CoRR


Grolimund, Dominik and Meisser, Luzius and Schmid, Stefan and Wattenhofer, Roger (2006). Havelaar: A Robust and Efficient Reputation System for Active Peer-to-Peer Systems [62]. 1st Workshop on the Economics of Networked Systems (NetEcon), 69–74.


Grolimund, Dominik and Meisser, Luzius and Schmid, Stefan and Wattenhofer, Roger (2006). Cryptree: A Folder Tree Structure for Cryptographic File Systems [63]. 25th IEEE Symposium on Reliable Distributed Systems (SRDS), 189–198.


Guerraoui, Rachid and Kouznetsov, Petr (2008). Failure Detectors as Type Boosters [64]. Distributed Computing Journal (DC). Springer, 343–358.


Guerraoui, Rachid and Kouznetsov, Petr (2008). The Gap in Circumventing the Impossibility of Consensus [65]. Journal of Computer and System Sciences (JCSS), 823–830.


Guerraoui, Rachid and Kapalka, Michal and Kouznetsov, Petr (2008). The Weakest Failure Detectors to Boost Obstruction-Freedom [66]. Distributed Computing Journal (DC). Springer, 415–433.


Guerraoui, Rachid and Herlihy, Maurice and Kouznetsov, Petr and Lynch, Nancy and Newport, Calvin (2007). On the Weakest Failure Detector Ever [67]. Proceedings of the 26th ACM Symposium on Principles of Distributed Computing (PODC 07), 235–243.


Guerraoui, Rachid and Herlihy, Maurice and Kouznetsov, Petr and Lynch, Nancy and Newport, Calvin (2007). On the Weakest Failure Detector Ever [68]. (MPI-SWS Technical Report)


Guerraoui, Rachid and Kapalka, Michal and Kouznetsov, Petr (2006). The Weakest Failure Detectors to Boost Obstruction-Freedom [69]. Proceedings of the 20th International Conference on Distributed Computing (DISC '06). Springer, 399–412.


Guerraoui, Rachid and Kouznetsov, Petr (2003). On Failure Detectors and Type Boosters [70]. 17th International Conference on Distributed Computing (DISC). Springer, 292-305.


Guerraoui, Rachid and Kouznetsov, Petr (2003). On Failure Detectors and Type Boosters [71]. (Technical report)


Guerraoui, Rachid and Kouznetsov, Petr and Pochon, Bastian (2002). A Note on Set Agreement with Omission Failures [72]. Workshop on Geometric and Topological Methods in Concurrency and Distributed Systems Theory (GETCO 2002). Elsevier, 48–58.


Guerraoui, Rachid and Kouznetsov, Petr (2002). On the weakest failure detector for non-blocking atomic commit [73]. International Conference on Theoretical Computer Science (TCS 2002). Kluwer, 461–473.


Guerraoui, Rachid and Handurukande, Sidath B. and Kermarrec, Anne-Marie and Kouznetsov, Petr (2001). Reducing Noise in Gossip-Based Reliable Broadcast [74]. 20th Symposium on Reliable Distributed Systems (SRDS 2001), 186–189.


Guerraoui, Rachid and Kouznetsov, Petr (2003). Finally the Weakest Failure Detector for Non-Blocking Atomic Commit [75]. (Technical report)


Guerraoui, Rachid and Kouznetsov, Petr (2003). The Weakest Failure Detector for Non-Blocking Atomic Commit [76]. (Technical report)


<< previous [77]
next >> [99]
------ Links: ------

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Copyright TU Berlin 2008