Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel Profit maximization in flex-grid all-optical networks. (English) Zbl 1434.68040 Theory Comput. Syst. 64, No. 2, 311-326 (2020). MSC: 68M10 68R10 68W25 90C35 PDFBibTeX XMLCite \textit{M. Shalom} et al., Theory Comput. Syst. 64, No. 2, 311--326 (2020; Zbl 1434.68040) Full Text: DOI
Gopalakrishnan, Ragavendran; Kanoulas, Dimitrios; Karuturi, Naga Naresh; Rangan, C. Pandu; Rajaraman, Rajmohan; Sundaram, Ravi Cache me if you can: capacitated selfish replication games in networks. (English) Zbl 1434.68049 Theory Comput. Syst. 64, No. 2, 272-310 (2020). MSC: 68M14 68M10 68Q17 91A43 91A80 PDFBibTeX XMLCite \textit{R. Gopalakrishnan} et al., Theory Comput. Syst. 64, No. 2, 272--310 (2020; Zbl 1434.68049) Full Text: DOI arXiv
Chakraborty, Dibyayan; Das, Sandip; Mukherjee, Joydeep; Sahoo, Uma Kant Bounds on the bend number of split and cocomparability graphs. (English) Zbl 1420.05120 Theory Comput. Syst. 63, No. 6, 1336-1357 (2019). MSC: 05C62 68R10 05C10 68Q17 68M10 06A07 PDFBibTeX XMLCite \textit{D. Chakraborty} et al., Theory Comput. Syst. 63, No. 6, 1336--1357 (2019; Zbl 1420.05120) Full Text: DOI arXiv
Even, Guy; Medina, Moti; Patt-Shamir, Boaz On-line path computation and function placement in SDNs. (English) Zbl 1423.68046 Theory Comput. Syst. 63, No. 2, 306-325 (2019). MSC: 68M10 68W27 PDFBibTeX XMLCite \textit{G. Even} et al., Theory Comput. Syst. 63, No. 2, 306--325 (2019; Zbl 1423.68046) Full Text: DOI
Abu-Khzam, Faisal N.; Markarian, Christine; auf der Heide, Friedhelm Meyer; Schubert, Michael Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks. (English) Zbl 1419.05161 Theory Comput. Syst. 62, No. 8, 1673-1689 (2018). MSC: 05C69 05C12 05C20 05C82 68M10 68W25 68W15 PDFBibTeX XMLCite \textit{F. N. Abu-Khzam} et al., Theory Comput. Syst. 62, No. 8, 1673--1689 (2018; Zbl 1419.05161) Full Text: DOI arXiv
Ilcinkas, David; Wade, Ahmed M. Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring. (English) Zbl 1392.68099 Theory Comput. Syst. 62, No. 5, 1144-1160 (2018). MSC: 68M14 05C85 68M10 68R10 PDFBibTeX XMLCite \textit{D. Ilcinkas} and \textit{A. M. Wade}, Theory Comput. Syst. 62, No. 5, 1144--1160 (2018; Zbl 1392.68099) Full Text: DOI
Datta, Ajoy K.; Larmore, Lawrence L. Self-stabilizing leader election in dynamic networks. (English) Zbl 1392.68097 Theory Comput. Syst. 62, No. 5, 977-1047 (2018). MSC: 68M14 68M10 68W15 PDFBibTeX XMLCite \textit{A. K. Datta} and \textit{L. L. Larmore}, Theory Comput. Syst. 62, No. 5, 977--1047 (2018; Zbl 1392.68097) Full Text: DOI
Anantharamu, Lakshmi; Chlebus, Bogdan S.; Rokicki, Mariusz A. Adversarial multiple access channels with individual injection rates. (English) Zbl 1410.68379 Theory Comput. Syst. 61, No. 3, 820-850 (2017). MSC: 68W15 68M10 68M14 68M20 PDFBibTeX XMLCite \textit{L. Anantharamu} et al., Theory Comput. Syst. 61, No. 3, 820--850 (2017; Zbl 1410.68379) Full Text: DOI arXiv
D’Angelo, Gianlorenzo; D’Emidio, Mattia; Frigioni, Daniele; Romano, Daniele Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios. (English) Zbl 1347.68018 Theory Comput. Syst. 57, No. 2, 444-477 (2015). MSC: 68M10 68W15 90C35 PDFBibTeX XMLCite \textit{G. D'Angelo} et al., Theory Comput. Syst. 57, No. 2, 444--477 (2015; Zbl 1347.68018) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Nederlof, Jesper; Pilipczuk, Michał Minimizing Rosenthal potential in multicast games. (English) Zbl 1329.68041 Theory Comput. Syst. 57, No. 1, 81-96 (2015). MSC: 68M10 68M12 91A10 91A43 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Theory Comput. Syst. 57, No. 1, 81--96 (2015; Zbl 1329.68041) Full Text: DOI
Dobrev, Stefan; Narayanan, Lata; Opatrny, Jaroslav Optimal sensor networks for area monitoring using rotating and beam sensors. (English) Zbl 1303.68024 Theory Comput. Syst. 54, No. 4, 622-639 (2014). MSC: 68M10 PDFBibTeX XMLCite \textit{S. Dobrev} et al., Theory Comput. Syst. 54, No. 4, 622--639 (2014; Zbl 1303.68024) Full Text: DOI
Kniesburges, Sebastian; Koutsopoulos, Andreas; Scheideler, Christian Re-Chord: a self-stabilizing chord overlay network. (English) Zbl 1314.68027 Theory Comput. Syst. 55, No. 3, 591-612 (2014). MSC: 68M10 68M12 68W15 PDFBibTeX XMLCite \textit{S. Kniesburges} et al., Theory Comput. Syst. 55, No. 3, 591--612 (2014; Zbl 1314.68027) Full Text: DOI
Pucci, Geppino (ed.); Luchangco, Victor (ed.); Rajaraman, Rajmohan (ed.) Foreword: Parallelism in algorithms and architectures. (English) Zbl 1303.00055 Theory Comput. Syst. 55, No. 3, 449-450 (2014). MSC: 00B25 68-06 68M10 68W10 PDFBibTeX XMLCite \textit{G. Pucci} (ed.) et al., Theory Comput. Syst. 55, No. 3, 449--450 (2014; Zbl 1303.00055) Full Text: DOI
Macko, Martin; Larson, Kate; Steskal, Ľuboš Braess’s paradox for flows over time. (English) Zbl 1305.91050 Theory Comput. Syst. 53, No. 1, 86-106 (2013). Reviewer: Alexander Guterman (Moskva) MSC: 91A43 91A40 05C57 05C83 68M10 PDFBibTeX XMLCite \textit{M. Macko} et al., Theory Comput. Syst. 53, No. 1, 86--106 (2013; Zbl 1305.91050) Full Text: DOI arXiv
Bilò, Vittorio; Caragiannis, Ioannis; Fanelli, Angelo; Monaco, Gianpiero Improved lower bounds on the price of stability of undirected network design games. (English) Zbl 1273.90168 Theory Comput. Syst. 52, No. 4, 668-686 (2013). MSC: 90C27 91A80 05C90 68M10 PDFBibTeX XMLCite \textit{V. Bilò} et al., Theory Comput. Syst. 52, No. 4, 668--686 (2013; Zbl 1273.90168) Full Text: DOI
Athanassopoulos, Stavros; Caragiannis, Ioannis; Kaklamanis, Christos; Papaioannou, Evi Energy-efficient communication in multi-interface wireless networks. (English) Zbl 1260.68018 Theory Comput. Syst. 52, No. 2, 285-296 (2013). MSC: 68M10 90B18 68W25 PDFBibTeX XMLCite \textit{S. Athanassopoulos} et al., Theory Comput. Syst. 52, No. 2, 285--296 (2013; Zbl 1260.68018) Full Text: DOI
Pettarin, Alberto; Pietracaprina, Andrea; Pucci, Geppino On the expansion and diameter of bluetooth-like topologies. (English) Zbl 1261.68010 Theory Comput. Syst. 52, No. 2, 319-339 (2013). MSC: 68M10 68R10 05C80 68M12 PDFBibTeX XMLCite \textit{A. Pettarin} et al., Theory Comput. Syst. 52, No. 2, 319--339 (2013; Zbl 1261.68010) Full Text: DOI
Flocchini, Paola; Kellett, Matthew; Mason, Peter C.; Santoro, Nicola Searching for black holes in subways. (English) Zbl 1253.68032 Theory Comput. Syst. 50, No. 1, 158-184 (2012). MSC: 68M10 90B10 68W15 68R10 68M15 90B06 PDFBibTeX XMLCite \textit{P. Flocchini} et al., Theory Comput. Syst. 50, No. 1, 158--184 (2012; Zbl 1253.68032) Full Text: DOI
Burgin, Mark; Gupta, Bidyut Second-level algorithms, superrecursivity, and recovery problem in distributed systems. (English) Zbl 1253.68057 Theory Comput. Syst. 50, No. 4, 694-705 (2012). MSC: 68M14 68M10 68M15 PDFBibTeX XMLCite \textit{M. Burgin} and \textit{B. Gupta}, Theory Comput. Syst. 50, No. 4, 694--705 (2012; Zbl 1253.68057) Full Text: DOI
Anshelevich, Elliot; Caskurlu, Bugra Price of stability in survivable network design. (English) Zbl 1232.91077 Theory Comput. Syst. 49, No. 1, 98-138 (2011). MSC: 91A80 91A43 90B10 68M10 PDFBibTeX XMLCite \textit{E. Anshelevich} and \textit{B. Caskurlu}, Theory Comput. Syst. 49, No. 1, 98--138 (2011; Zbl 1232.91077) Full Text: DOI
Koch, Ronald; Skutella, Martin Nash equilibria and the price of anarchy for flows over time. (English) Zbl 1278.91027 Theory Comput. Syst. 49, No. 1, 71-97 (2011). MSC: 91A43 91A10 90B22 68M10 PDFBibTeX XMLCite \textit{R. Koch} and \textit{M. Skutella}, Theory Comput. Syst. 49, No. 1, 71--97 (2011; Zbl 1278.91027) Full Text: DOI
Leone, Pierre; Nikoletseas, Sotiris; Rolim, José Stochastic models and adaptive algorithms for energy balance in sensor networks. (English) Zbl 1204.68018 Theory Comput. Syst. 47, No. 2, 433-453 (2010). MSC: 68M10 68Q87 68W05 PDFBibTeX XMLCite \textit{P. Leone} et al., Theory Comput. Syst. 47, No. 2, 433--453 (2010; Zbl 1204.68018) Full Text: DOI Link
Edmonds, Jeff; Datta, Suprakash; Dymond, Patrick TCP is competitive with resource augmentation. (English) Zbl 1206.68055 Theory Comput. Syst. 47, No. 1, 137-161 (2010). MSC: 68M12 68M10 68M20 PDFBibTeX XMLCite \textit{J. Edmonds} et al., Theory Comput. Syst. 47, No. 1, 137--161 (2010; Zbl 1206.68055) Full Text: DOI
Fotakis, Dimitris Congestion games with linearly independent paths: convergence time and price of anarchy. (English) Zbl 1203.91036 Theory Comput. Syst. 47, No. 1, 113-136 (2010). MSC: 91A43 90B18 68M10 91B32 PDFBibTeX XMLCite \textit{D. Fotakis}, Theory Comput. Syst. 47, No. 1, 113--136 (2010; Zbl 1203.91036) Full Text: DOI
Chen, Ho-Lin; Roughgarden, Tim Network design with weighted players. (English) Zbl 1176.91003 Theory Comput. Syst. 45, No. 2, 302-324 (2009). Reviewer: Milan Mareš (Praha) MSC: 91A10 68M10 PDFBibTeX XMLCite \textit{H.-L. Chen} and \textit{T. Roughgarden}, Theory Comput. Syst. 45, No. 2, 302--324 (2009; Zbl 1176.91003) Full Text: DOI
Kwok, Andy; Poon, Chung Keung Two-dimensional packet classification and filter conflict resolution in the internet. (English) Zbl 1176.68021 Theory Comput. Syst. 44, No. 3, 289-303 (2009). MSC: 68M10 68M20 PDFBibTeX XMLCite \textit{A. Kwok} and \textit{C. K. Poon}, Theory Comput. Syst. 44, No. 3, 289--303 (2009; Zbl 1176.68021) Full Text: DOI
Kantabutra, Sanpawat; Chawachat, Jakarin On embedding of a hypercube in a completely overlapping network. (English) Zbl 1343.68023 Theory Comput. Syst. 44, No. 1, 105-116 (2009). MSC: 68M10 68R10 PDFBibTeX XMLCite \textit{S. Kantabutra} and \textit{J. Chawachat}, Theory Comput. Syst. 44, No. 1, 105--116 (2009; Zbl 1343.68023) Full Text: DOI
Epstein, Leah; van Stee, Rob; Tamir, Tami Paging with request sets. (English) Zbl 1192.68823 Theory Comput. Syst. 44, No. 1, 67-81 (2009). MSC: 68W05 68M10 PDFBibTeX XMLCite \textit{L. Epstein} et al., Theory Comput. Syst. 44, No. 1, 67--81 (2009; Zbl 1192.68823) Full Text: DOI
Flammini, Michele; Moscardelli, Luca; Navarra, Alfredo; Pérennes, Stéphane Asymptotically optimal solutions for small world graphs. (English) Zbl 1140.68052 Theory Comput. Syst. 42, No. 4, 632-650 (2008). MSC: 68R10 05C85 68M10 68M14 PDFBibTeX XMLCite \textit{M. Flammini} et al., Theory Comput. Syst. 42, No. 4, 632--650 (2008; Zbl 1140.68052) Full Text: DOI
Herley, Kieran T.; Pietracaprina, Andrea; Pucci, Geppino Store-and-forward multicast routing on the mesh. (English) Zbl 1140.68007 Theory Comput. Syst. 42, No. 4, 519-535 (2008). MSC: 68M14 68M10 PDFBibTeX XMLCite \textit{K. T. Herley} et al., Theory Comput. Syst. 42, No. 4, 519--535 (2008; Zbl 1140.68007) Full Text: DOI
Awerbuch, Baruch; Azar, Yossi; Lotker, Zvi; Patt-Shamir, Boaz; Tuttle, Mark R. Collaborate with strangers to find own preferences. (English) Zbl 1151.91406 Theory Comput. Syst. 42, No. 1, 27-41 (2008). MSC: 91B08 68M10 91A06 68U35 68T05 68T20 68W10 PDFBibTeX XMLCite \textit{B. Awerbuch} et al., Theory Comput. Syst. 42, No. 1, 27--41 (2008; Zbl 1151.91406) Full Text: DOI
Gairing, Martin; Monien, Burkhard; Tiemann, Karsten Selfish routing with incomplete information. (English) Zbl 1151.91331 Theory Comput. Syst. 42, No. 1, 91-130 (2008). MSC: 91A10 68M10 PDFBibTeX XMLCite \textit{M. Gairing} et al., Theory Comput. Syst. 42, No. 1, 91--130 (2008; Zbl 1151.91331) Full Text: DOI
Chatzigiannakis, Ioannis; Kinalis, Athanasios; Nikoletseas, Sotiris Adaptive energy management for incremental deployment of heterogeneous wireless sensors. (English) Zbl 1153.68316 Theory Comput. Syst. 42, No. 1, 42-72 (2008). MSC: 68M10 PDFBibTeX XMLCite \textit{I. Chatzigiannakis} et al., Theory Comput. Syst. 42, No. 1, 42--72 (2008; Zbl 1153.68316) Full Text: DOI
Bhatia, Randeep; Immorlica, Nicole; Kimbrel, Tracy; Mirrokni, Vahab S.; Naor, Joseph (Seffi); Schieber, Baruch Traffic engineering of management flows by link augmentations on confluent trees. (English) Zbl 1153.68315 Theory Comput. Syst. 42, No. 1, 2-26 (2008). MSC: 68M10 PDFBibTeX XMLCite \textit{R. Bhatia} et al., Theory Comput. Syst. 42, No. 1, 2--26 (2008; Zbl 1153.68315) Full Text: DOI
Bagchi, Amitabha; Bhargava, Ankur; Chaudhary, Amitabh; Eppstein, David; Scheideler, Christian The effect of faults on network expansion. (English) Zbl 1113.68014 Theory Comput. Syst. 39, No. 6, 903-928 (2006). MSC: 68M10 68M15 PDFBibTeX XMLCite \textit{A. Bagchi} et al., Theory Comput. Syst. 39, No. 6, 903--928 (2006; Zbl 1113.68014) Full Text: DOI arXiv
Rosén, Adi; Tsirkin, Michael S. On delivery times in packet networks under adversarial traffic. (English) Zbl 1113.68023 Theory Comput. Syst. 39, No. 6, 805-827 (2006). MSC: 68M10 68M20 PDFBibTeX XMLCite \textit{A. Rosén} and \textit{M. S. Tsirkin}, Theory Comput. Syst. 39, No. 6, 805--827 (2006; Zbl 1113.68023) Full Text: DOI
Karger, David R.; Ruhl, Matthias Simple efficient load-balancing algorithms for peer-to-peer systems. (English) Zbl 1115.68018 Theory Comput. Syst. 39, No. 6, 787-804 (2006). MSC: 68M10 68M20 68P05 PDFBibTeX XMLCite \textit{D. R. Karger} and \textit{M. Ruhl}, Theory Comput. Syst. 39, No. 6, 787--804 (2006; Zbl 1115.68018) Full Text: DOI
Caragiannis, Ioannis; Kaklamanis, Christos; Kanellopoulos, Panagiotis Energy-efficient wireless network design. (English) Zbl 1100.68505 Theory Comput. Syst. 39, No. 5, 593-617 (2006). MSC: 68M10 68W25 PDFBibTeX XMLCite \textit{I. Caragiannis} et al., Theory Comput. Syst. 39, No. 5, 593--617 (2006; Zbl 1100.68505) Full Text: DOI
Riege, Tobias; Rothe, Jörg Complexity of the exact domatic number problem and of the exact conveyor flow shop problem. (English) Zbl 1100.68085 Theory Comput. Syst. 39, No. 5, 635-668 (2006). MSC: 68R10 68R15 68M10 PDFBibTeX XMLCite \textit{T. Riege} and \textit{J. Rothe}, Theory Comput. Syst. 39, No. 5, 635--668 (2006; Zbl 1100.68085) Full Text: DOI Link
Bongiovanni, Giancarlo; Penna, Paolo XOR-based schemes for fast parallel IP lookups. (English) Zbl 1086.68515 Theory Comput. Syst. 38, No. 4, 481-501 (2005). MSC: 68M20 68M10 PDFBibTeX XMLCite \textit{G. Bongiovanni} and \textit{P. Penna}, Theory Comput. Syst. 38, No. 4, 481--501 (2005; Zbl 1086.68515) Full Text: DOI
Koukopoulos, Dimitrios; Mavronicolas, Marios; Nikoletseas, Sotiris; Spirakis, Paul The impact of network structure on the stability of greedy protocols. (English) Zbl 1084.68011 Theory Comput. Syst. 38, No. 4, 425-460 (2005). MSC: 68M12 68M10 68M20 PDFBibTeX XMLCite \textit{D. Koukopoulos} et al., Theory Comput. Syst. 38, No. 4, 425--460 (2005; Zbl 1084.68011) Full Text: DOI Link
Kalyanasundaram, Bala; Velauthapillai, Mahe; Waclawsky, John Unlocking the advantages of dynamic service selection and pricing. (English) Zbl 1086.68504 Theory Comput. Syst. 38, No. 4, 393-410 (2005). MSC: 68M10 68W05 PDFBibTeX XMLCite \textit{B. Kalyanasundaram} et al., Theory Comput. Syst. 38, No. 4, 393--410 (2005; Zbl 1086.68504) Full Text: DOI
Jurdziński, Tomasz; Stachowiak, Grzegorz Probabilistic algorithms for the wake-up problem in single-hop radio networks. (English) Zbl 1105.68115 Theory Comput. Syst. 38, No. 3, 347-367 (2005). MSC: 68W20 68M10 PDFBibTeX XMLCite \textit{T. Jurdziński} and \textit{G. Stachowiak}, Theory Comput. Syst. 38, No. 3, 347--367 (2005; Zbl 1105.68115) Full Text: DOI
Hildrum, Kirsten; Kubiatowicz, John D.; Rao, Satish; Zhao, Ben Y. Distributed object location in a dynamic network. (English) Zbl 1093.68004 Theory Comput. Syst. 37, No. 3, 405-440 (2004). MSC: 68M10 PDFBibTeX XMLCite \textit{K. Hildrum} et al., Theory Comput. Syst. 37, No. 3, 405--440 (2004; Zbl 1093.68004) Full Text: DOI Link
Peserico, Enoch The lazy adversary conjecture fails. (English) Zbl 1093.68144 Theory Comput. Syst. 37, No. 3, 397-403 (2004). MSC: 68W20 68M10 PDFBibTeX XMLCite \textit{E. Peserico}, Theory Comput. Syst. 37, No. 3, 397--403 (2004; Zbl 1093.68144) Full Text: DOI
Busch, Costas \(\widetilde{O}\) (congestion + dilation) hot-potato routing on leveled networks. (English) Zbl 1093.68001 Theory Comput. Syst. 37, No. 3, 371-396 (2004). MSC: 68M10 PDFBibTeX XMLCite \textit{C. Busch}, Theory Comput. Syst. 37, No. 3, 371--396 (2004; Zbl 1093.68001) Full Text: DOI
Meyer auf der Heide, Friedhelm; Schindelhauer, Christian; Volbert, Klaus; Grünewald, Matthias Congestion, dilation, and energy in radio networks. (English) Zbl 1093.68005 Theory Comput. Syst. 37, No. 3, 343-370 (2004). MSC: 68M10 PDFBibTeX XMLCite \textit{F. Meyer auf der Heide} et al., Theory Comput. Syst. 37, No. 3, 343--370 (2004; Zbl 1093.68005) Full Text: DOI
Krizanc, Danny; Luccio, Flaminia L.; Raman, Rajeev Compact routing schemes for dynamic ring networks. (English) Zbl 1088.68510 Theory Comput. Syst. 37, No. 5, 585-607 (2004). MSC: 68M10 PDFBibTeX XMLCite \textit{D. Krizanc} et al., Theory Comput. Syst. 37, No. 5, 585--607 (2004; Zbl 1088.68510) Full Text: DOI
Barth, Dominique; Berthomé, Pascal Periodic gossiping in commuted networks. (English) Zbl 1088.68012 Theory Comput. Syst. 37, No. 5, 559-584 (2004). MSC: 68M10 PDFBibTeX XMLCite \textit{D. Barth} and \textit{P. Berthomé}, Theory Comput. Syst. 37, No. 5, 559--584 (2004; Zbl 1088.68012) Full Text: DOI
Korman, Amos; Peleg, David; Rodeh, Yoav Labeling schemes for dynamic tree networks. (English) Zbl 1101.68334 Theory Comput. Syst. 37, No. 1, 49-75 (2004). MSC: 68M10 05C78 68M12 68M14 68R10 68W15 PDFBibTeX XMLCite \textit{A. Korman} et al., Theory Comput. Syst. 37, No. 1, 49--75 (2004; Zbl 1101.68334) Full Text: DOI
Chen, Wei-Mei; Chen, Gen-Huey; Hsu, D. Frank Generalized diameters of the mesh of trees. (English) Zbl 1088.68509 Theory Comput. Syst. 37, No. 4, 547-556 (2004). MSC: 68M10 68R10 PDFBibTeX XMLCite \textit{W.-M. Chen} et al., Theory Comput. Syst. 37, No. 4, 547--556 (2004; Zbl 1088.68509)
Chlebus, Bogdan S.; Goląb, Karol; Kowalski, Dariusz R. Broadcasting spanning forests on a multiple-access channel. (English) Zbl 1101.68322 Theory Comput. Syst. 36, No. 6, 711-733 (2003). MSC: 68M10 68R10 68W20 PDFBibTeX XMLCite \textit{B. S. Chlebus} et al., Theory Comput. Syst. 36, No. 6, 711--733 (2003; Zbl 1101.68322) Full Text: DOI arXiv
Dobrev, Stefan Communication-efficient broadcasting in complete networks with dynamic faults. (English) Zbl 1101.68325 Theory Comput. Syst. 36, No. 6, 695-709 (2003). MSC: 68M10 PDFBibTeX XMLCite \textit{S. Dobrev}, Theory Comput. Syst. 36, No. 6, 695--709 (2003; Zbl 1101.68325) Full Text: DOI
Koutsoupias, Elias; Mavronicolas, Marios; Spirakis, Paul Approximate equilibria and ball fusion. (English) Zbl 1101.68336 Theory Comput. Syst. 36, No. 6, 683-693 (2003). MSC: 68M10 PDFBibTeX XMLCite \textit{E. Koutsoupias} et al., Theory Comput. Syst. 36, No. 6, 683--693 (2003; Zbl 1101.68336) Full Text: DOI Link
Bermond, Jean-Claude; Choplin, Sébastien; Pérennes, Stéphane Hierarchical ring network design. (English) Zbl 1101.68315 Theory Comput. Syst. 36, No. 6, 663-682 (2003). MSC: 68M10 PDFBibTeX XMLCite \textit{J.-C. Bermond} et al., Theory Comput. Syst. 36, No. 6, 663--682 (2003; Zbl 1101.68315) Full Text: DOI
Ito, Hiro; Iwama, Kazuo; Okabe, Yasuo; Yoshihiro, Takuya Avoiding routing loops on the internet. (English) Zbl 1094.68520 Theory Comput. Syst. 36, No. 6, 597-609 (2003). MSC: 68M10 PDFBibTeX XMLCite \textit{H. Ito} et al., Theory Comput. Syst. 36, No. 6, 597--609 (2003; Zbl 1094.68520) Full Text: DOI
Nikoletseas, Sotiris; Prasinos, Grigorios; Spirakis, Paul; Zaroliagis, Christos Attack propagation in networks. (English) Zbl 1101.68346 Theory Comput. Syst. 36, No. 5, 553-574 (2003). MSC: 68M10 PDFBibTeX XMLCite \textit{S. Nikoletseas} et al., Theory Comput. Syst. 36, No. 5, 553--574 (2003; Zbl 1101.68346) Full Text: DOI
Krick, Christof; Räcke, Harald; Westermann, Matthias Approximation algorithms for data management in networks. (English) Zbl 1101.68337 Theory Comput. Syst. 36, No. 5, 497-519 (2003). MSC: 68M10 68W25 PDFBibTeX XMLCite \textit{C. Krick} et al., Theory Comput. Syst. 36, No. 5, 497--519 (2003; Zbl 1101.68337) Full Text: DOI
Elsässer, Robert; Lücking, Thomas; Monien, Burkhard On spectral bounds for the \(k\)-partitioning of graphs. (English) Zbl 1101.68067 Theory Comput. Syst. 36, No. 5, 461-478 (2003). MSC: 68R10 68M10 PDFBibTeX XMLCite \textit{R. Elsässer} et al., Theory Comput. Syst. 36, No. 5, 461--478 (2003; Zbl 1101.68067) Full Text: DOI
Pantziou, Grammati E.; Pentaris, George P.; Spirakis, Paul G. Competitive call control in mobile networks. (English) Zbl 1012.68006 Theory Comput. Syst. 35, No. 6, 625-639 (2002). MSC: 68M10 68W05 PDFBibTeX XMLCite \textit{G. E. Pantziou} et al., Theory Comput. Syst. 35, No. 6, 625--639 (2002; Zbl 1012.68006) Full Text: DOI
Albers, Susanne On generalized connection caching. (English) Zbl 1051.68028 Theory Comput. Syst. 35, No. 3, 251-267 (2002). MSC: 68M10 68W05 PDFBibTeX XMLCite \textit{S. Albers}, Theory Comput. Syst. 35, No. 3, 251--267 (2002; Zbl 1051.68028) Full Text: DOI
Even, Shimon; Kupershtok, Roni Laying out the interconnection network of the transpose bijection. (English) Zbl 1001.68005 Theory Comput. Syst. 35, No. 5, 545-558 (2002). MSC: 68M10 PDFBibTeX XMLCite \textit{S. Even} and \textit{R. Kupershtok}, Theory Comput. Syst. 35, No. 5, 545--558 (2002; Zbl 1001.68005) Full Text: DOI
Krick, C.; Meyer auf der Heide, Friedhelm; Räcke, H.; Vöcking, Berthold; Westermann, Matthias Data management in networks: Experimental evaluation of a provably good strategy. (English) Zbl 0995.68561 Theory Comput. Syst. 35, No. 2, 217-245 (2002). MSC: 68U99 68M10 68M14 68-01 PDFBibTeX XMLCite \textit{C. Krick} et al., Theory Comput. Syst. 35, No. 2, 217--245 (2002; Zbl 0995.68561) Full Text: DOI
Fu, Jung-Sheng; Chen, Gen-Huey Hamiltonicity of the hierarchical cubic network. (English) Zbl 0993.68003 Theory Comput. Syst. 35, No. 1, 59-79 (2002). MSC: 68M10 PDFBibTeX XMLCite \textit{J.-S. Fu} and \textit{G.-H. Chen}, Theory Comput. Syst. 35, No. 1, 59--79 (2002; Zbl 0993.68003) Full Text: DOI
Bornstein, C. F.; Litman, A.; Maggs, B. M.; Sitaraman, R. K.; Yatzkar, T. On the bisection width and expansion of butterfly networks. (English) Zbl 0993.68005 Theory Comput. Syst. 34, No. 6, 491-518 (2001). MSC: 68M10 PDFBibTeX XMLCite \textit{C. F. Bornstein} et al., Theory Comput. Syst. 34, No. 6, 491--518 (2001; Zbl 0993.68005) Full Text: DOI
Al-Ammal, H.; Goldberg, L. A.; MacKenzie, P. An improved stability bound for binary exponential backoff. (English) Zbl 0992.68006 Theory Comput. Syst. 34, No. 3, 229-244 (2001). MSC: 68M10 68M12 PDFBibTeX XMLCite \textit{H. Al-Ammal} et al., Theory Comput. Syst. 34, No. 3, 229--244 (2001; Zbl 0992.68006) Full Text: DOI
Kontogiannis, S. C.; Pantziou, G. E.; Spirakis, P. G.; Yung, M. Robust parallel computations through randomization. (English) Zbl 0969.68010 Theory Comput. Syst. 33, No. 5-6, 427-464 (2000). MSC: 68M10 68Q10 PDFBibTeX XMLCite \textit{S. C. Kontogiannis} et al., Theory Comput. Syst. 33, No. 5--6, 427--464 (2000; Zbl 0969.68010) Full Text: DOI Link
Laing, A. K.; Cypher, R.; Duncan, C. A. On the flattest common supersequence method for deadlock-free routing in arbitrary networks. (English) Zbl 0969.68009 Theory Comput. Syst. 33, No. 5-6, 393-426 (2000). MSC: 68M10 PDFBibTeX XMLCite \textit{A. K. Laing} et al., Theory Comput. Syst. 33, No. 5--6, 393--426 (2000; Zbl 0969.68009) Full Text: DOI
Adler, M.; Scheideler, C. Efficient communication strategies for ad hoc wireless networks. (English) Zbl 0969.68008 Theory Comput. Syst. 33, No. 5-6, 337-391 (2000). MSC: 68M10 PDFBibTeX XMLCite \textit{M. Adler} and \textit{C. Scheideler}, Theory Comput. Syst. 33, No. 5--6, 337--391 (2000; Zbl 0969.68008) Full Text: DOI
Plaxton, C. G.; Suel, T. A superlogarithmic lower bound for shuffle-unshuffle sorting networks. (English) Zbl 0954.68009 Theory Comput. Syst. 33, No. 3, 233-254 (2000). MSC: 68M10 PDFBibTeX XMLCite \textit{C. G. Plaxton} and \textit{T. Suel}, Theory Comput. Syst. 33, No. 3, 233--254 (2000; Zbl 0954.68009) Full Text: DOI
Bilardi, G.; Preparata, F. P. Processor-time tradeoffs under bounded-speed message propagation. II: Lower bounds. (English) Zbl 0951.68003 Theory Comput. Syst. 32, No. 5, 531-559 (1999). MSC: 68M10 PDFBibTeX XMLCite \textit{G. Bilardi} and \textit{F. P. Preparata}, Theory Comput. Syst. 32, No. 5, 531--559 (1999; Zbl 0951.68003) Full Text: DOI
Flammini, M.; Scheideler, C. Simple, efficient routing schemes for all-optical networks. (English) Zbl 0929.68008 Theory Comput. Syst. 32, No. 3, 387-420 (1999). MSC: 68M10 PDFBibTeX XMLCite \textit{M. Flammini} and \textit{C. Scheideler}, Theory Comput. Syst. 32, No. 3, 387--420 (1999; Zbl 0929.68008) Full Text: DOI
Mitzenmacher, M. On the analysis of randomized load balancing schemes. (English) Zbl 0932.68003 Theory Comput. Syst. 32, No. 3, 361-386 (1999). MSC: 68M10 68M07 68W05 PDFBibTeX XMLCite \textit{M. Mitzenmacher}, Theory Comput. Syst. 32, No. 3, 361--386 (1999; Zbl 0932.68003) Full Text: DOI
Scheideler, C.; Vöcking, B. Universal continuous routing strategies. (English) Zbl 0904.68009 Theory Comput. Syst. 31, No. 4, 425-449 (1998). MSC: 68M10 PDFBibTeX XMLCite \textit{C. Scheideler} and \textit{B. Vöcking}, Theory Comput. Syst. 31, No. 4, 425--449 (1998; Zbl 0904.68009) Full Text: DOI
Park, S.; Dill, D. L. Verification of cache coherence protocols by aggregation of distributed transactions. (English) Zbl 0904.68008 Theory Comput. Syst. 31, No. 4, 355-376 (1998). MSC: 68M10 68W15 PDFBibTeX XMLCite \textit{S. Park} and \textit{D. L. Dill}, Theory Comput. Syst. 31, No. 4, 355--376 (1998; Zbl 0904.68008) Full Text: DOI
Even, S.; Rajsbaum, S. The use of a synchronizer yields the maximum computation rate in distributed networks. (English) Zbl 0882.68014 Theory Comput. Syst. 30, No. 5, 447-474 (1997). MSC: 68M10 PDFBibTeX XMLCite \textit{S. Even} and \textit{S. Rajsbaum}, Theory Comput. Syst. 30, No. 5, 447--474 (1997; Zbl 0882.68014) Full Text: DOI