×

A glimpse at Paul G. Spirakis. (English) Zbl 1331.01014

Zaroliagis, Christos (ed.) et al., Algorithms, probability, networks, and games. Scientific papers and essays dedicated to Paul G. Spirakis on the occasion of his 60th birthday. Cham: Springer (ISBN 978-3-319-24023-7/pbk; 978-3-319-24024-4/ebook). Lecture Notes in Computer Science 9295, 3-24 (2015).
Introduction: Paul Spirakis is an eminent, talented, and influential researcher that contributed significantly to computer science. This article is a modest attempt of a biographical sketch of Paul, which we drafted with extreme love and honor.
For the entire collection see [Zbl 1326.68032].

MSC:

01A70 Biographies, obituaries, personalia, bibliographies

Biographic References:

Spirakis, Paul G.
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Akrida, E., Gasieniec, L., Mertzios, G., Spirakis, P.: Ephemeral networks with random availability of links: diameter and connectivity. In: Proceedings of 26th ACM Symposium on Parallelism in Algorithms and Architectures–SPAA 2014, pp. 267–276 (2014) · doi:10.1145/2612669.2612693
[2] Anbalagan, Y., Norin, S., Savani, R., Vetta, A.: Polylogarithmic supports are required for approximate well-supported Nash equilibria below 2/3. In: Chen, Y., Immorlica, N. (eds.) WINE 2013. LNCS, vol. 8289, pp. 15–23. Springer, Heidelberg (2013) · Zbl 1404.91010 · doi:10.1007/978-3-642-45046-4_2
[3] Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18(4), 235–253 (2006) · Zbl 1266.68042 · doi:10.1007/s00446-005-0138-3
[4] Bilardi, G., Herley, K., Pietracaprina, A., Pucci, G., Spirakis, P.: BSP versus LogP. Algorithmica 24, 405–422 (1999). Preliminary version in SPAA 1996 · Zbl 0943.68067 · doi:10.1007/PL00008270
[5] Cerf, V., Burleigh, S., Hooke, A., Torgerson, L., Durst, B., Scott, K., Fall, K., Weiss, H.: Delay-tolerant networking architecture. Technical report, The IETF Trust (2007)
[6] Chatzigiannakis, I., Dimitriou, T.D., Mavronicolas, M., Nikoletseas, S.E., Spirakis, P.G.: A comparative study of protocols for efficient data propagation in smart dust networks. In: Kosch, H., Böszörményi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol. 2790, pp. 1003–1016. Springer, Heidelberg (2003) · doi:10.1007/978-3-540-45209-6_138
[7] Chatzigiannakis, I., Dimitriou, T., Mavronicolas, M., Nikoletseas, S., Spirakis, P.: A comparative study of protocols for efficient data propagation in smart dust networks. Parallel Process. Lett. 13(4), 615–627 (2003) · doi:10.1142/S0129626403001550
[8] Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A., Spirakis, P.: Passively mobile communicating machines that use restricted space. Theor. Comput. Sci. 412(46), 6469–6483 (2011) · Zbl 1228.68028 · doi:10.1016/j.tcs.2011.07.001
[9] Chatzigiannakis, I., Nikoletseas, S.E., Paspallis, N., Spirakis, P.G., Zaroliagis, C.D.: An experimental study of basic communication protocols in ad-hoc mobile networks. In: Brodal, G.S., Frigioni, D., Marchetti-Spaccamela, A. (eds.) WAE 2001. LNCS, vol. 2141, pp. 159–171. Springer, Heidelberg (2001) · Zbl 1002.68625 · doi:10.1007/3-540-44688-5_13
[10] Chatzigiannakis, I., Nikoletseas, S., Spirakis, P.: Smart dust protocols for local detection and propagation. In: Proceedings of 2nd ACM International Workshop on Principles of Mobile Computing–POMC 2002, pp. 9–16 (2002) · doi:10.1145/584490.584493
[11] Chatzigiannakis, I., Nikoletseas, S., Spirakis, P.: Distributed communication algorithms for ad hoc mobile networks. J. Parallel Distrib. Comput. 63(1), 58–74 (2003) · Zbl 1048.68013 · doi:10.1016/S0743-7315(02)00034-5
[12] Chen, X., Deng, X., Teng, S.-H.: Settling the complexity of computing two-player Nash equilibria. J. ACM 56, 3, Art. No. 14 (2009) · Zbl 1325.68095 · doi:10.1145/1516512.1516516
[13] Christodoulou, G., Koutsoupias, E., Spirakis, P.: On the performance of approximate equilibria in congestion games. Algorithmica 61(1), 116–140 (2011) · Zbl 1219.91009 · doi:10.1007/s00453-010-9449-2
[14] Czyzowicz, J., Gąsieniec, L., Kosowski, A., Kranakis, E., Spirakis, P.G., Uznański, P.: On convergence and threshold properties of discrete Lotka-Volterra population protocols. In: Halldórsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9134, pp. 393–405. Springer, Heidelberg (2015) · Zbl 1447.92336 · doi:10.1007/978-3-662-47672-7_32
[15] Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. SIAM J. Comput. 39(1), 195–259 (2009). Preliminary version in ACM STOC 2006 · Zbl 1185.91019 · doi:10.1137/070699652
[16] Daskalakis, C., Mehta, A., Papadimitriou, C.: A note on approximate Nash equilibria. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 297–306. Springer, Heidelberg (2006) · Zbl 1167.91390 · doi:10.1007/11944874_27
[17] Díaz, J., Goldberg, L.A., Mertzios, G.B., Richerby, D., Serna, M.J., Spirakis, P.: Approximating fixation probabilities in the generalized Moran process. Algorithmica 69(1), 78–91 (2014). Preliminary version in SODA 2012 · Zbl 1303.92095 · doi:10.1007/s00453-012-9722-7
[18] Diaz, J., Koukopoulos, D., Nikoletseas, S., Spirakis, P., Serna, M., Thilikos, D.: Stability and instability of the FIFO protocol. In: Proceedings of 13th ACM Symposium on Parallel Algorithms and Architectures–SPAA 2001, pp. 48–52 (2001)
[19] Díaz, J., Serna, M.J., Spirakis, P.: On the random generation and counting of matchings in dense graphs. Theor. Comput. Sci. 201(1–2), 281–290 (1998) · Zbl 0902.68142 · doi:10.1016/S0304-3975(97)00297-1
[20] Dimitriou, T.D., Krontiris, I., Nikakis, F., Spirakis, P.G.: SPEED: Scalable Protocols for Efficient Event Delivery in sensor networks. In: Mitrou, N.M., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds.) NETWORKING 2004. LNCS, vol. 3042, pp. 1300–1305. Springer, Heidelberg (2004) · doi:10.1007/978-3-540-24693-0_110
[21] Fatourou, P., Spirakis, P.: Efficient scheduling of strict multithreaded computations. Theory Comput. Syst. 33(3), 173232 (2000) · Zbl 0956.68012 · doi:10.1007/s002240010002
[22] Fearnley, J., Goldberg, P.W., Savani, R., Sørensen, T.B.: Approximate well-supported Nash equilibria below two-thirds. In: Serna, M. (ed.) SAGT 2012. LNCS, vol. 7615, pp. 108–119. Springer, Heidelberg (2012) · Zbl 1284.91018 · doi:10.1007/978-3-642-33996-7_10
[23] Fearnley, J., Igwe, T.P., Savani, R.: An empirical study of finding approximate equilibria in bimatrix games. ArXiv/CoRR, abs/1502.04980 (2015)
[24] Fotakis, D., Gkatzelis, V., Kaporis, A., Spirakis, P.: The impact of social ignorance on weighted congestion games. Theory Comput, Syst. 50(3), 559–578 (2012) · Zbl 1262.91008 · doi:10.1007/s00224-011-9355-2
[25] Fotakis, D., Kaporis, A., Spirakis, P.: Efficient methods for selfish network design. Theor. Comput. Sci. 448, 9–20 (2012) · Zbl 1243.68029 · doi:10.1016/j.tcs.2012.04.033
[26] Fotakis, D., Kontogiannis, S., Spirakis, P.: Selfish unsplittable flows. Theor. Comput. Sci. 348, 226–239 (2005) · Zbl 1152.90355 · doi:10.1016/j.tcs.2005.09.024
[27] Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., Spirakis, P.: The structure and complexity of Nash equilibria for a selfish routing game. Theor. Comput. Sci. 410(36), 3305–3326 (2009) · Zbl 1168.91331 · doi:10.1016/j.tcs.2008.01.004
[28] Fotakis, D., Kontogiannis, S., Spirakis, P.: Atomic congestion games among coalitions. ACM Trans. Algorithms 4, 4 (2008) · Zbl 1223.91015 · doi:10.1145/1383369.1383383
[29] Fotakis, D., Nikoletseas, S., Papadopoulou, V., Spirakis, P.: Radiocoloring in planar graphs: complexity and approximations. Theor. Comput. Sci. 340(3), 514–538 (2005) · Zbl 1077.68072 · doi:10.1016/j.tcs.2005.03.013
[30] Fotakis, D.A., Spirakis, P.G.: A Hamiltonian approach to the assignment of non-reusable frequencies. In: Arvind, V., Sarukkai, S. (eds.) FST TCS 1998. LNCS, vol. 1530, pp. 18–30. Springer, Heidelberg (1998) · Zbl 0929.90069 · doi:10.1007/978-3-540-49382-2_3
[31] Harks, T., Klimm, M., Möhring, R.H.: Characterizing the existence of potential functions in weighted congestion games. Theory Comput. Syst. 49(1), 46–70 (2011) · Zbl 1278.91013 · doi:10.1007/s00224-011-9315-x
[32] Hatzis, K., Pentaris, G., Spirakis, P.G., Tampakas, B.: Counting in mobile networks: theory and experimentation. In: Vitter, J.S., Zaroliagis, C.D. (eds.) WAE 1999. LNCS, vol. 1668, pp. 95–109. Springer, Heidelberg (1999) · doi:10.1007/3-540-48318-7_10
[33] Hatzis, K., Pentaris, G., Spirakis, P., Tampakas, V., Tan, R.B.: Fundamental control algorithms in mobile networks. In: Proceedings of ACM SPAA 1999, pp. 251–260 (1999) · doi:10.1145/305619.305649
[34] Jung, J., Kirousis, L.M., Spirakis, P.: Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays. Inf. Comput. 105, 94–104 (1993) · Zbl 0781.68070 · doi:10.1006/inco.1993.1041
[35] Kamath, A., Motwani, R., Palem, K., Spirakis, P.: Tail bounds for occupancy and the satisfiability threshold conjecture. In: Proceedings of 35th IEEE Symposium on Foundations of Computer Science–FOCS 1994, pp. 592–603 (1994) · Zbl 0834.68051 · doi:10.1109/SFCS.1994.365732
[36] Kannan, R., Theobald, T.: Games of fixed rank: a hierarchy of bimatrix games. Econ. Theory 42, 157–173 (2010). Preliminary version in ACM-SIAM SODA 2007 · Zbl 1202.91007 · doi:10.1007/s00199-009-0436-2
[37] Kaporis, A., Spirakis, P.: The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions. Theor. Comput. Sci. 410(8–10), 745–755 (2009) · Zbl 1157.91016 · doi:10.1016/j.tcs.2008.11.002
[38] Kavvadias, D., Pantziou, G., Spirakis, P., Zaroliagis, C.: Hammock-on-Ears decomposition: a technique for the efficient parallel solution of shortest paths and other problems. Theor. Comput. Sci. 168(1), 121–154 (1996). Preliminary version in MFCS 1994 · Zbl 0874.68234 · doi:10.1016/S0304-3975(96)00065-5
[39] Kedem, Z., Palem, K., Spirakis, P.G.: Efficient robust parallel computations. In: Proceedings of 22nd Annual ACM Symposium on Theory of Computing–STOC 1990, pp. 138–148 (1990) · doi:10.1145/100216.100231
[40] Kempe, D., Kleinberg, J., Kumar, A.: Connectivity and inference problems for temporal networks. In: Proceedings of 32nd ACM Symposium on Theory of Computing–STOC 2000, pp. 504–513 (2000) · Zbl 1296.68015 · doi:10.1145/335305.335364
[41] Kirousis, L., Serna, M., Spirakis, P.: The parallel complexity of the connected subgraph problem. SIAM J. Comput. 22(3), 573–586 (1993). Preliminary version in FOCS 1989 · Zbl 0773.68042 · doi:10.1137/0222039
[42] Kirousis, L., Spirakis, P., Tsigas, P.: Reading many variables in one atomic operation solutions with linear or sublinear complexity. IEEE Trans. Parallel Distrib. Comput. 5(7), 688–696 (1994) · Zbl 05107408 · doi:10.1109/71.296315
[43] Kontogiannis, S.C., Panagopoulou, P.N., Spirakis, P.G.: Polynomial algorithms for approximating nash equilibria of bimatrix games. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 286–296. Springer, Heidelberg (2006) · Zbl 1159.91307 · doi:10.1007/11944874_26
[44] Kontogiannis, S., Spirakis, P.: Approximability of symmetric bimatrix games and related experiments. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 1–20. Springer, Heidelberg (2011)
[45] Koukopoulos, D., Mavronicolas, M., Nikoletseas, S., Spirakis, P.: The impact of network structure on the stability of greedy protocols. Theory Comput. Syst. 38(4), 425–460 (2005) · Zbl 1084.68011 · doi:10.1007/s00224-004-1181-3
[46] Koutsoupias, E., Mavronicolas, M., Spirakis, P.: Approximate equilibria and ball fusion. Theory Comput. Syst. 36, 683–693 (2003) · Zbl 1101.68336 · doi:10.1007/s00224-003-1131-5
[47] Kumar, B., Srikant, Y.N.: The best nurturers in computer science research. In: Proceedings of 2005 SIAM International Conference on Data Mining, pp. 566–570; also Technical Report IISc-CSA-TR-2004-10, Computer Science and Automation, Indian Institute of Science, India, October 2004
[48] Mangasarian, O.L., Stone, H.: Two-person nonzero-sum games and quadratic programming. J. Math. Anal. Appl. 9(3), 348–355 (1964) · Zbl 0126.36505 · doi:10.1016/0022-247X(64)90021-6
[49] Mavronicolas, M., Spirakis, P.: The price of selfish routing. Algorithmica 48(1), 91–126 (2007) · Zbl 1137.91007 · doi:10.1007/s00453-006-0056-1
[50] Mertzios, G.B., Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Temporal network optimization subject to connectivity constraints. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 657–668. Springer, Heidelberg (2013) · Zbl 1334.68027 · doi:10.1007/978-3-642-39212-2_57
[51] Mertzios, G.B., Nikoletseas, S., Raptopoulos, C., Spirakis, P.: Natural models for evolution on networks. Theor. Comput. Sci. 477, 76–95 (2013) · Zbl 1261.05117 · doi:10.1016/j.tcs.2012.11.032
[52] Mertzios, G.B., Nikoletseas, S.E., Raptopoulos, C.L., Spirakis, P.G.: Determining majority in networks with local interactions and very small local memory. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 871–882. Springer, Heidelberg (2014) · Zbl 1404.68020 · doi:10.1007/978-3-662-43948-7_72
[53] Michail, O.: An introduction to temporal graphs–an algorithmic perspective. In: Algorithms, Probability, Networks, and Games. LNCS, vol. 9295. Springer, New York (2015) · Zbl 1331.68154 · doi:10.1007/978-3-319-24024-4_18
[54] Michail, O., Chatzigiannakis, I., Spirakis, P.: New Models for Population Protocols. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers, San Rafael (2011) · Zbl 1218.68082
[55] Michail, O., Chatzigiannakis, I., Spirakis, P.: Mediated population protocols. Theor. Comput. Sci. 412(22), 2434–2450 (2011) · Zbl 1218.68082 · doi:10.1016/j.tcs.2011.02.003
[56] Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Naming and counting in anonymous unknown dynamic networks. In: Higashino, T., Katayama, Y., Masuzawa, T., Potop-Butucaru, M., Yamashita, M. (eds.) SSS 2013. LNCS, vol. 8255, pp. 281–295. Springer, Heidelberg (2013) · Zbl 1473.68125 · doi:10.1007/978-3-319-03089-0_20
[57] Michail, O., Chatzigiannakis, I., Spirakis, P.: Causality, influence, and computation in possibly disconnected synchronous dynamic networks. J. Parallel Distrib. Comput. 74(1), 2016–2026 (2014) · Zbl 1327.68046 · doi:10.1016/j.jpdc.2013.07.007
[58] Michail, O., Chatzigiannakis, I., Spirakis, P.: Computing in dynamic networks. In: Dehmer, M., Emmert-Streib, F., Pickl, S. (eds.) Chapter 6 in Computational Network Theory: Theoretical Foundations and Applications, 1st edn, pp. 173–218, Wiley-VCH Verlag GmbH & Co. KGaA (2015) · Zbl 1364.68059
[59] Michail, O., Spirakis, P.: Simple and efficient local codes for distributed stable network construction. In: Proceedings of 33rd ACM Symposium on Principles of Distributed Computing–PODC 2014, pp. 76–85 (2014) · Zbl 1321.68029 · doi:10.1145/2611462.2611466
[60] Michail, O., Spirakis, P.G.: Traveling salesman problems in temporal graphs. In: Csuhaj-Varjú, E., Dietzfelbinger, M., Ésik, Z. (eds.) MFCS 2014, Part II. LNCS, vol. 8635, pp. 553–564. Springer, Heidelberg (2014) · Zbl 1426.90218 · doi:10.1007/978-3-662-44465-8_47
[61] Michail, O., Spirakis, P.: Terminating population protocols via some minimal global knowledge assumptions. J. Parallel Distrib. Comput. 81, 1–10 (2015) · doi:10.1016/j.jpdc.2015.02.005
[62] Michail, O., Spirakis, P.: Distributed computation by connectivity preserving network transformers (2015) (to appear) · Zbl 1370.68023
[63] Moulin, H., Vial, J.P.: Strategically zero-sum games: the class of games whose completely mixed equilibria cannot be improved upon. Int. J. Game Theory 7(3–4), 201–221 (1978) · Zbl 0419.90087 · doi:10.1007/BF01769190
[64] Nash, J.: Noncooperative games. Ann. Math. 54, 289–295 (1951) · Zbl 0045.08202 · doi:10.2307/1969529
[65] Nikoletseas, S., Palem, K.V., Spirakis, P., Yung, M.: Short vertex disjoint paths and multiconnectivity in random graphs: reliable network computing. In: Proceedings of 21st International Colloquium on Automata, Languages and Programming–ICALP 1994, pp. 508–519 (1994) · doi:10.1007/3-540-58201-0_94
[66] Nikoletseas, S., Prasinos, G., Spirakis, P., Zaroliagis, C.: Attack propagation in networks. Theory Comput. Syst. 36, 553–574 (2003). Preliminary version in ACM SPAA 2001 · Zbl 1101.68346 · doi:10.1007/s00224-003-1087-5
[67] Nikoletseas, S.E., Raptopoulos, C., Spirakis, P.G.: The existence and efficient construction of large independent sets in general random intersection graphs. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 1029–1040. Springer, Heidelberg (2004) · Zbl 1103.05083 · doi:10.1007/978-3-540-27836-8_86
[68] Panagopoulou, P., Spirakis, P.: Algorithms for pure Nash equilibria in weighted congestion games. ACM J. Exp. Algorithmics 11, 1–19 (2006) · Zbl 1169.68319
[69] Panagopoulou, P., Spirakis, P.: Random bimatrix games are asymptotically easy to solve (A simple proof). Theor. Comput. Sci. 54(3), 479–490 (2014) · Zbl 1380.91021
[70] Pantziou, G., Pentaris, G., Spirakis, P.: Competitive call control in mobile networks. In: Algorithms and Computation–ISAAC 1997, pp. 404–413 (1997) · Zbl 1012.68006 · doi:10.1007/3-540-63890-3_43
[71] Pantziou, G., Spirakis, P., Zaroliagis, C.: Efficient parallel algorithms for shortest paths in planar digraphs. BIT 32(2), 215–236 (1992). Preliminary vesrion in SWAT 1990 · Zbl 0761.68047 · doi:10.1007/BF01994878
[72] Reif, J., Spirakis, P.: Random matroids. In: Proceedings 12th ACM Symposium on Theory of Computing–STOC 1980, pp. 385–397 (1980) · doi:10.1145/800141.804688
[73] Reif, J., Spirakis, P.: Distributed algorithms for synchronizing interprocess communication within real time. In: Proceedings of 13th ACM Symposium on Theory of Computing–STOC 1981, pp. 133–145 (1981) · doi:10.1145/800076.802467
[74] Reif, J., Spirakis, P.: Real time synchronization of interprocess communications. ACM Trans. Programm. Lang. Syst. 6(2), 215–238 (1984) · Zbl 0536.68021 · doi:10.1145/2993.357244
[75] Reif, J., Spirakis, P.: Unbounded speed variability in distributed systems. SIAM J. Comput. 14(1), 7592 (1985) · Zbl 0552.68025 · doi:10.1137/0214005
[76] Reif, J., Spirakis, P.: Expected parallel time and sequential space complexity of graph and digraph problems. Algorithmica 7, 597–630 (1992) · Zbl 0749.68059 · doi:10.1007/BF01758779
[77] Spirakis, P.: Optimal parallel randomized algorithms for addition sparse addition and identification. Inf. Comput. 76, 1–12 (1988) · Zbl 0645.68059 · doi:10.1016/0890-5401(88)90039-9
[78] Spirakis, P., Zaroliagis, C.: Distributed algorithm engineering. In: Fleischer, R., Moret, B.M.E., Schmidt, E.M. (eds.) Experimental Algorithmics. LNCS, vol. 2547, pp. 197–228. Springer, Heidelberg (2002) · Zbl 1026.68819 · doi:10.1007/3-540-36383-1_10
[79] Tsaknakis, H., Spirakis, P.G.: An optimization approach for approximate Nash equilibria. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 42–56. Springer, Heidelberg (2007) · Zbl 05264297 · doi:10.1007/978-3-540-77105-0_8
[80] Tsaknakis, H., Spirakis, P.G., Kanoulas, D.: Performance evaluation of a descent algorithm for bi-matrix games. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 222–230. Springer, Heidelberg (2008) · Zbl 05496536 · doi:10.1007/978-3-540-92185-1_29
[81] Triantafillou, P., Ntarmos, N., Nikoletseas, S., Spirakis, P.: Nanopeer networks and P2P worlds. In: Proceedings of 3rd International Conference on Peer-to-Peer Computing–P2P 2003, pp. 40–46 (2003) · doi:10.1109/PTP.2003.1231502
[82] Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks. Technical report CS-200006, Duke University (2000)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.