×

Found 111 Documents (Results 1–100)

Oriented diameter of star graphs. (English) Zbl 1453.68117

Changat, Manoj (ed.) et al., Algorithms and discrete applied mathematics. 6th international conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12016, 307-317 (2020).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Must the communication graph of MPC protocols be an expander? (English) Zbl 1457.94005

Shacham, Hovav (ed.) et al., Advances in cryptology – CRYPTO 2018. 38th annual international cryptology conference, Santa Barbara, CA, USA, August 19–23, 2018. Proceedings. Part III. Cham: Springer. Lect. Notes Comput. Sci. 10993, 243-272 (2018).
PDFBibTeX XMLCite
Full Text: DOI

Randomized rumor spreading revisited. (English) Zbl 1442.68260

Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 138, 14 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

Greedy routing and the algorithmic small-world phenomenon. (English) Zbl 1380.68024

Proceedings of the 2017 ACM symposium on principles of distributed computing, PODC ’17, Washington, DC, USA, July 25–27, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4992-5). 371-380 (2017).
PDFBibTeX XMLCite
Full Text: DOI

The power of networks. Six principles that connect our lives. (English) Zbl 1360.00002

Princeton, NJ: Princeton University Press (ISBN 978-0-691-17071-8/hbk; 978-1-4008-8407-0/ebook). xi, 310 p. (2017).
PDFBibTeX XMLCite

Maximum matchings in dynamic graph streams and the simultaneous communication model. (English) Zbl 1409.68337

Krauthgamer, Robert (ed.), Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10–12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1345-1364 (2016).
PDFBibTeX XMLCite
Full Text: DOI

The coalescing-branching random walk on expanders and the dual epidemic process. (English) Zbl 1376.68105

Proceedings of the 2016 ACM symposium on principles of distributed computing, PODC ’16, Chicago, IL, USA, July 25–28, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3964-3). 461-467 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Brief announcement: Deterministic graph connectivity in the broadcast congested clique. (English) Zbl 1375.68202

Proceedings of the 2016 ACM symposium on principles of distributed computing, PODC ’16, Chicago, IL, USA, July 25–28, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3964-3). 245-247 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Unbeatable set consensus via topological and combinatorial reasoning. (English) Zbl 1373.68081

Proceedings of the 2016 ACM symposium on principles of distributed computing, PODC ’16, Chicago, IL, USA, July 25–28, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3964-3). 107-116 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Setting ports in an anonymous network: how to reduce the level of symmetry? (English) Zbl 1482.68177

Suomela, Jukka (ed.), Structural information and communication complexity. 23rd international colloquium, SIROCCO 2016, Helsinki, Finland, July 19–21, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9988, 35-48 (2016).
MSC:  68R10 05C78 68M12
PDFBibTeX XMLCite
Full Text: DOI

Statistical inference with probabilistic graphical models. (English) Zbl 1397.62197

Krzakala, Florent (ed.) et al., Statistical physics, optimization, inference and message-passing algorithms. Lecture notes of the Les Houches School of Physics (École de Physique des Houches): special issue, Les Houches, France, September 30 – October 11, 2013. Oxford: Oxford University Press (ISBN 978-0-19-874373-6/hbk). 1-27 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

The read/write protocol complex is collapsible. (English) Zbl 1398.68358

Kranakis, Evangelos (ed.) et al., LATIN 2016: theoretical informatics. 12th Latin American symposium, Ensenada, Mexico, April 11–15, 2016. Proceedings. Berlin: Springer (ISBN 978-3-662-49528-5/pbk; 978-3-662-49529-2/ebook). Lecture Notes in Computer Science 9644, 179-191 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

The match-maker: constant-space distributed majority via random walks. (English) Zbl 1428.68048

Pelc, Andrzej (ed.) et al., Stabilization, safety, and security of distributed systems. 17th international symposium, SSS 2015, Edmonton, AB, Canada, August 18–21, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9212, 67-80 (2015).
PDFBibTeX XMLCite
Full Text: DOI

Construction and impromptu repair of an MST in a distributed network with \(o(m)\) communication. (English) Zbl 1333.68213

Proceedings of the 2015 ACM symposium on principles of distributed computing, PODC ’15, Donostia-San Sebastián, Spain, July 21–23, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3617-8). 71-80 (2015).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Solving the induced subgraph problem in the randomized multiparty simultaneous messages model. (English) Zbl 1471.68198

Scheideler, Christian (ed.), Structural information and communication complexity. 22nd international colloquium, SIROCCO 2015, Montserrat, Spain, July 14–16, 2015. Post-proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9439, 370-384 (2015).
PDFBibTeX XMLCite
Full Text: DOI

Tight bounds for rumor spreading with vertex expansion. (English) Zbl 1421.68128

Chekuri, Chandra (ed.), Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms, SODA 2014, Portland, OR, USA, January 5–7, 2014. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 801-815 (2014).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Efficient computation of the weighted clustering coefficient. (English) Zbl 1342.05166

Bonato, Anthony (ed.) et al., Algorithms and models for the web graph. 11th international workshop, WAW 2014, Beijing, China, December 17–18, 2014. Proceedings. Cham: Springer (ISBN 978-3-319-13122-1/pbk; 978-3-319-13123-8/ebook). Lecture Notes in Computer Science 8882, 34-46 (2014).
MSC:  05C82 91D30 68M12
PDFBibTeX XMLCite
Full Text: DOI Link

Distributed computing through combinatorial topology. (English) Zbl 1341.68004

Amsterdam: Elsevier/Morgan Kaufmann (ISBN 978-0-12-404578-1/pbk; 978-0-12-404728-0/ebook). xiv, 319 p. (2014).
PDFBibTeX XMLCite
Full Text: Link

Simple, fast and deterministic gossip and rumor spreading. (English) Zbl 1421.68132

Khanna, Sanjeev (ed.), Proceedings of the 24th annual ACM-SIAM symposium on discrete algorithms, SODA 2013, New Orleans, LA, USA, January 6–8, 2013. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 705-716 (2013).
PDFBibTeX XMLCite
Full Text: DOI

How to meet asynchronously at polynomial cost. (English) Zbl 1323.68553

Proceedings of the 2013 ACM symposium on principles of distributed computing, PODC ’13, Montreal, QC, Canada, July 22–24, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2065-8). 92-99 (2013).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Asynchronous rumor spreading on random graphs. (English) Zbl 1372.68035

Cai, Leizhen (ed.) et al., Algorithms and computation. 24th international symposium, ISAAC 2013, Hong Kong, China, December 16–18, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-45029-7/pbk). Lecture Notes in Computer Science 8283, 424-434 (2013).
MSC:  68M12 05C80 68M15
PDFBibTeX XMLCite
Full Text: DOI arXiv

Rumor spreading in random evolving graphs. (English) Zbl 1394.68026

Bodlaender, Hans L. (ed.) et al., Algorithms – ESA 2013. 21st annual European symposium, Sophia Antipolis, France, September 2–4, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40449-8/pbk). Lecture Notes in Computer Science 8125, 325-336 (2013).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Approximating semi-matchings in streaming and in two-party communication. (English) Zbl 1336.68297

Fomin, Fedor V. (ed.) et al., Automata, languages, and programming. 40th international colloquium, ICALP 2013, Riga, Latvia, July 8–12, 2013, Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-39205-4/pbk). Lecture Notes in Computer Science 7965, 637-649 (2013).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Ultra-fast rumor spreading in social networks. (English) Zbl 1421.68003

Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1642-1660 (2012).
PDFBibTeX XMLCite
Full Text: Link

Rumor spreading and vertex expansion. (English) Zbl 1421.68129

Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1623-1641 (2012).
PDFBibTeX XMLCite
Full Text: Link

iBGP and constrained connectivity. (English) Zbl 1372.68032

Gupta, Anupam (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 15th international workshop, APPROX 2012, and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15–17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32511-3/pbk). Lecture Notes in Computer Science 7408, 122-133 (2012).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Low randomness rumor spreading via hashing. (English) Zbl 1245.68020

Dürr, Christoph (ed.) et al., STACS 2012. 29th international symposium on theoretical aspects of computer science, Paris, France, February 29th – March 3rd, 2012. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-35-4). LIPIcs – Leibniz International Proceedings in Informatics 14, 314-325, electronic only (2012).
PDFBibTeX XMLCite
Full Text: DOI

Quick detection of nodes with large degrees. (English) Zbl 1342.05175

Bonato, Anthony (ed.) et al., Algorithms and models for the web graph. 9th international workshop, WAW 2012, Halifax, NS, Canada, June 22–23, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30540-5/pbk). Lecture Notes in Computer Science 7323, 54-65 (2012).
PDFBibTeX XMLCite
Full Text: DOI arXiv

The worst case behavior of randomized gossip. (English) Zbl 1354.68022

Agrawal, Manindra (ed.) et al., Theory and applications of models of computation. 9th annual conference, TAMC 2012, Beijing, China, May 16–21, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29951-3/pbk). Lecture Notes in Computer Science 7287, 330-345 (2012).
PDFBibTeX XMLCite
Full Text: DOI

Networks of random cycles. (English) Zbl 1376.68017

Randall, Dana (ed.), Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23–25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 933-944 (2011).
PDFBibTeX XMLCite
Full Text: Link

Rumor spreading and vertex expansion on regular graphs. (English) Zbl 1376.68116

Randall, Dana (ed.), Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23–25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 462-475 (2011).
PDFBibTeX XMLCite
Full Text: Link

Asymptotically optimal randomized rumor spreading. (English) Zbl 1274.68014

Nešetřil, Jarik (ed.) et al., Extended abstracts of the sixth European conference on combinatorics, graph theory and applications, EuroComb 2011, Budapest, Hungary, August 29 – September 2, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 38, 297-302 (2011).
MSC:  68M12 05C90 68W20
PDFBibTeX XMLCite
Full Text: Link

Parsimonious flooding in geometric random-walks (extended abstract). (English) Zbl 1350.68044

Peleg, David (ed.), Distributed computing. 25th international symposium, DISC 2011, Rome, Italy, September 20–22, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24099-7/pbk). Lecture Notes in Computer Science 6950, 298-310 (2011).
MSC:  68M14 05C81 68M12
PDFBibTeX XMLCite
Full Text: DOI

Geometric graphs with randomly deleted edges – connectivity and routing protocols. (English) Zbl 1343.68186

Murlak, Filip (ed.) et al., Mathematical foundations of computer science 2011. 36th international symposium, MFCS 2011, Warsaw, Poland, August 22–26, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22992-3/pbk). Lecture Notes in Computer Science 6907, 544-555 (2011).
MSC:  68R10 05C80 68M12
PDFBibTeX XMLCite
Full Text: DOI

On the power of cliques in the parameterized verification of ad hoc networks. (English) Zbl 1326.68040

Hofmann, Martin (ed.), Foundations of software science and computational structures. 14th international conference, FOSSACS 2011, held as part of the joint European conferences on theory and practice of software, ETAPS 2011, Saarbrücken, Germany, March 26 – April 3, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19804-5/pbk). Lecture Notes in Computer Science 6604, 441-455 (2011).
PDFBibTeX XMLCite
Full Text: DOI

Forbidden-set distance labels for graphs of bounded doubling dimension. (English) Zbl 1315.68196

Proceedings of the 29th annual ACM SIGACT-SIGOPS symposium on principles of distributed computing, PODC ’10, Zurich, Switzerland, July 25–28, 2010. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-888-9). 192-200 (2010).
PDFBibTeX XMLCite
Full Text: DOI

Rumor spreading on random regular graphs and expanders. (English) Zbl 1305.68136

Serna, Maria (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 13th international workshop, APPROX 2010, and 14th international workshop, RANDOM 2010, Barcelona, Spain, September 1–3, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15368-6/pbk). Lecture Notes in Computer Science 6302, 560-573 (2010).
MSC:  68R10 05C80 68M12
PDFBibTeX XMLCite
Full Text: DOI

Hypergraphs of multiparty secrets. (English) Zbl 1286.68422

Dix, Jürgen (ed.) et al., Computational logic in multi-agent systems. 11th international workshop, CLIMA XI, Lisbon, Portugal, August 16–17, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14976-4/pbk). Lecture Notes in Computer Science 6245. Lecture Notes in Artificial Intelligence, 15-32 (2010).
PDFBibTeX XMLCite
Full Text: DOI

Quasirandom rumor spreading: an experimental analysis. (English) Zbl 1430.68017

Finocchi, Irene (ed.) et al., Proceedings of the 11th workshop on algorithm engineering and experiments (ALENEX 09), New York, NY, USA, Januar 3, 2009. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 145-153 (2009).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Parsimonious flooding in dynamic graphs. (English) Zbl 1291.68292

Proceedings of the 28th annual ACM symposium on principles of distributed computing, PODC ’09, Calgary, AB, Canada, August 10–12, 2009. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-396-9). 260-269 (2009).
PDFBibTeX XMLCite
Full Text: DOI

Quasirandom broadcasting on the complete graph is as fast as randomized broadcasting. (English) Zbl 1273.05204

Nešetřil, Jaroslav (ed.) et al., Extended abstracts of the 5th European conference on combinatorics, graph theory and applications, EuroComb’09, Bordeaux, France, September 7–11, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 34, 553-559 (2009).
PDFBibTeX XMLCite
Full Text: DOI

A time-randomness tradeoff for quasi-random rumour spreading. (English) Zbl 1273.05199

Nešetřil, Jaroslav (ed.) et al., Extended abstracts of the 5th European conference on combinatorics, graph theory and applications, EuroComb’09, Bordeaux, France, September 7–11, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 34, 335-339 (2009).
PDFBibTeX XMLCite
Full Text: DOI

Quasirandom rumor spreading on expanders. (English) Zbl 1273.05200

Nešetřil, Jaroslav (ed.) et al., Extended abstracts of the 5th European conference on combinatorics, graph theory and applications, EuroComb’09, Bordeaux, France, September 7–11, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 34, 243-247 (2009).
PDFBibTeX XMLCite
Full Text: DOI

Improved compact routing schemes for dynamic trees. (English) Zbl 1301.68043

Proceedings of the 27th annual ACM symposium on principles of distributed computing, PODC ’08, Toronto, Canada, August 18–21, 2008. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-59593-989-0). 185-194 (2008).
PDFBibTeX XMLCite
Full Text: DOI

The power of memory in randomized broadcasting. (English) Zbl 1192.94019

Proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, January 20–22, 2008. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-898716-47-4). 218-227 (2008).
PDFBibTeX XMLCite

Quasirandom rumor spreading. (English) Zbl 1192.90024

Proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, January 20–22, 2008. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-898716-47-4). 773-781 (2008).
PDFBibTeX XMLCite
Full Text: arXiv

Unconditionally reliable message transmission in directed networks. (English) Zbl 1192.68078

Proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, January 20–22, 2008. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-898716-47-4). 1048-1055 (2008).
PDFBibTeX XMLCite

Local algorithms for dominating and connected dominating sets of unit disk graphs with location aware nodes. (English) Zbl 1136.68453

Laber, Eduardo Sany (ed.) et al., LATIN 2008: Theoretical informatics. 8th Latin American symposium, Búzios, Brazil, April 7–11, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78772-3/pbk). Lecture Notes in Computer Science 4957, 158-169 (2008).
MSC:  68R10 05C85 68M12
PDFBibTeX XMLCite
Full Text: DOI

Communication in dynamic radio networks. (English) Zbl 1283.68052

Proceedings of the 26th annual ACM symposium on principles of distributed computing, PODC ’07, Portland, OR, USA, August 12–15, 2007. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-59593-616-5). 205-214 (2007).
PDFBibTeX XMLCite
Full Text: DOI

On the complexity of greedy routing in ring-based peer-to-peer networks. (English) Zbl 1283.68070

Proceedings of the 26th annual ACM symposium on principles of distributed computing, PODC ’07, Portland, OR, USA, August 12–15, 2007. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-59593-616-5). 99-108 (2007).
PDFBibTeX XMLCite
Full Text: DOI

Towards fast decentralized construction of locality-aware overlay networks. (English) Zbl 1283.68071

Proceedings of the 26th annual ACM symposium on principles of distributed computing, PODC ’07, Portland, OR, USA, August 12–15, 2007. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-59593-616-5). 89-98 (2007).
PDFBibTeX XMLCite
Full Text: DOI

On secure multi-party computation in black-box groups. (English) Zbl 1215.94042

Menezes, Alfred (ed.), Advances in cryptology – CRYPTO 2007. 27th annual international cryptology conference, Santa Barbara, CA, USA, August 19–23, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74142-8/pbk). Lecture Notes in Computer Science 4622, 591-612 (2007).
PDFBibTeX XMLCite
Full Text: DOI

Fast low degree connectivity of ad-hoc networks via percolation. (English) Zbl 1151.68327

Arge, Lars (ed.) et al., Algorithms – ESA 2007. 15th annual European symposium, Eilat, Israel, October 8–10, 2007, Proceedings. Berlin: Springer (ISBN 978-3-540-75519-7/pbk). Lecture Notes in Computer Science 4698, 206-217 (2007).
MSC:  68M12 05C80 68R10
PDFBibTeX XMLCite
Full Text: DOI

Optimal-stretch name-independent compact routing in doubling metrics. (English) Zbl 1314.68046

Proceedings of the 25th annual ACM symposium on principles of distributed computing, PODC ’06, Denver, CO, USA, July 23–26, 2006. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-59593-384-0). 198-207 (2006).
PDFBibTeX XMLCite
Full Text: DOI

Reliable broadcast in unknown fixed-identity networks. (English) Zbl 1314.68050

Proceedings of the 24th annual ACM symposium on principles of distributed computing, PODC ’05, Las Vegas, NV, USA, July 17–20, 2005. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-994-2). 342-351 (2005).
PDFBibTeX XMLCite
Full Text: DOI

Competitive weighted throughput analysis of greedy protocols on DAGs. (English) Zbl 1314.68042

Proceedings of the 24th annual ACM symposium on principles of distributed computing, PODC ’05, Las Vegas, NV, USA, July 17–20, 2005. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-994-2). 227-236 (2005).
PDFBibTeX XMLCite
Full Text: DOI

Routing complexity of faulty networks. (English) Zbl 1314.68150

Proceedings of the 24th annual ACM symposium on principles of distributed computing, PODC ’05, Las Vegas, NV, USA, July 17–20, 2005. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-994-2). 209-217 (2005).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Oblivious routing in directed graphs with random demands. (English) Zbl 1192.90229

STOC’05: Proceedings of the 37th annual ACM symposium on theory of computing, Baltimore, MD, USA, May 22–24, 2005. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-960-8). 193-201 (2005).
PDFBibTeX XMLCite
Full Text: DOI

Agent-based information handling in large networks. (English) Zbl 1096.68009

Fiala, Jiří(ed.) et al., Mathematical foundations of computer Science 2004. 29th international symposium, MFCS 2004, Prague, Czech Republic, August 22–27, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22823-3/pbk). Lecture Notes in Computer Science 3153, 586-598 (2004).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Software