×

Found 545 Documents (Results 1–100)

Brief announcement: Probabilistic dynamic input/output automata. (English) Zbl 07824288

Milani, Alessia (ed.) et al., Proceedings of the 41st ACM symposium on principles of distributed computing, PODC ’22, Salerno, Italy, July 25–29, 2022. New York, NY: Association for Computing Machinery (ACM). 378-380 (2022).
MSC:  68M14 68W15
PDFBibTeX XMLCite
Full Text: DOI

Optimal algorithms for synchronous Byzantine \(k\)-set agreement. (English) Zbl 1522.68731

Devismes, Stéphane (ed.) et al., Stabilization, safety, and security of distributed systems. 24th international symposium, SSS 2022, Clermont-Ferrand, France, November 15–17, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13751, 178-192 (2022).
PDFBibTeX XMLCite
Full Text: DOI

Brief announcement: simple majority consensus in networks with unreliable communication. (English) Zbl 07774310

Gilbert, Seth (ed.), 35th international symposium on distributed computing, DISC 2021, Freiburg, Germany (virtual conference) October 4–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 209, Article 59, 4 p. (2021).
MSC:  68M14 68W15
PDFBibTeX XMLCite
Full Text: DOI

Brief announcement: probabilistic indistinguishability and the quality of validity in Byzantine agreement. (English) Zbl 07774308

Gilbert, Seth (ed.), 35th international symposium on distributed computing, DISC 2021, Freiburg, Germany (virtual conference) October 4–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 209, Article 57, 4 p. (2021).
MSC:  68M14 68W15
PDFBibTeX XMLCite
Full Text: DOI arXiv

Lack of quorum sensing leads to failure of consensus in Temnothorax ant emigration. (English) Zbl 1521.68059

Johnen, Colette (ed.) et al., Stabilization, safety, and security of distributed systems. 23rd international symposium, SSS 2021, virtual event, November 17–20, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13046, 209-228 (2021).
MSC:  68Q07 68Q10 92D50
PDFBibTeX XMLCite
Full Text: DOI

Probably approximately knowing. (English) Zbl 07323212

Cachin, Christian (ed.) et al., Proceedings of the 39th ACM symposium on principles of distributed computing, PODC ’20, virtual event, August 3–7, 2020. New York, NY: Association for Computing Machinery (ACM). 375-384 (2020).
MSC:  68M14 68W15
PDFBibTeX XMLCite
Full Text: DOI arXiv

The power of distributed verifiers in interactive proofs. (English) Zbl 1517.68134

Chawla, Shuchi (ed.), Proceedings of the 31st annual ACM-SIAM symposium on discrete algorithms, SODA 2020, Salt Lake City, UT, USA, January 5–8, 2020. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1096-1115 (2020).
MSC:  68Q10 68R10 68W15
PDFBibTeX XMLCite
Full Text: DOI arXiv

Reaching consensus in ad-hoc diffusion networks. (English) Zbl 1522.68226

Gilbert, Seth (ed.) et al., Algorithms for sensor systems. 14th international symposium on algorithms and experiments for wireless sensor networks, ALGOSENSORS 2018, Helsinki, Finland, August 23–24, 2018. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 11410, 180-192 (2019).
MSC:  68Q10 68Q07 68W15
PDFBibTeX XMLCite
Full Text: DOI

Small cuts and connectivity certificates: a fault tolerant approach. (English) Zbl 1515.68080

Suomela, Jukka (ed.), 33rd international symposium on distributed computing, DISC 2019, Budapest, Hungary, October 14–18, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 146, Article 30, 16 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

The complexity of symmetry breaking in massive graphs. (English) Zbl 1515.68248

Suomela, Jukka (ed.), 33rd international symposium on distributed computing, DISC 2019, Budapest, Hungary, October 14–18, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 146, Article 26, 18 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Scalable Byzantine reliable broadcast. (English) Zbl 1515.68066

Suomela, Jukka (ed.), 33rd international symposium on distributed computing, DISC 2019, Budapest, Hungary, October 14–18, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 146, Article 22, 16 p. (2019).
MSC:  68M14 68M15 68W15
PDFBibTeX XMLCite
Full Text: DOI

Space-optimal naming in population protocols. (English) Zbl 1515.68060

Suomela, Jukka (ed.), 33rd international symposium on distributed computing, DISC 2019, Budapest, Hungary, October 14–18, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 146, Article 9, 16 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

On the computational power of radio channels. (English) Zbl 1515.68138

Suomela, Jukka (ed.), 33rd international symposium on distributed computing, DISC 2019, Budapest, Hungary, October 14–18, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 146, Article 8, 17 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

Deterministic leader election in programmable matter. (English) Zbl 1503.68071

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 140, 14 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Deciding fast termination for probabilistic VASS with nondeterminism. (English) Zbl 1437.68127

Chen, Yu-Fang (ed.) et al., Automated technology for verification and analysis. 17th international symposium, ATVA 2019, Taipei, Taiwan, October 28–31, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11781, 462-478 (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

How to color a French flag. Biologically inspired algorithms for scale-invariant patterning. (English) Zbl 07176666

Censor-Hillel, Keren (ed.) et al., Structural information and communication complexity. 26th international colloquium, SIROCCO 2019, L’Aquila, Italy, July 1–4, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11639, 327-331 (2019).
MSC:  68Q10 68Q07 68W15
PDFBibTeX XMLCite
Full Text: DOI arXiv

On distributed Merlin-Arthur decision protocols. (English) Zbl 07176660

Censor-Hillel, Keren (ed.) et al., Structural information and communication complexity. 26th international colloquium, SIROCCO 2019, L’Aquila, Italy, July 1–4, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11639, 230-245 (2019).
PDFBibTeX XMLCite
Full Text: DOI

On the necessary memory to compute the plurality in multi-agent systems. (English) Zbl 1525.68005

Heggernes, Pinar (ed.), Algorithms and complexity. 11th international conference, CIAC 2019, Rome, Italy, May 27–29, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11485, 323-338 (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Local verification of global proofs. (English) Zbl 1497.68298

Schmid, Ulrich (ed.) et al., 32nd international symposium on distributed computing, DISC 2018, New Orleans, Louisiana, USA, October 15–19, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 121, Article 25, 17 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Redundancy in distributed proofs. (English) Zbl 1497.68297

Schmid, Ulrich (ed.) et al., 32nd international symposium on distributed computing, DISC 2018, New Orleans, Louisiana, USA, October 15–19, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 121, Article 24, 18 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

Detecting cliques in CONGEST networks. (English) Zbl 1497.68373

Schmid, Ulrich (ed.) et al., 32nd international symposium on distributed computing, DISC 2018, New Orleans, Louisiana, USA, October 15–19, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 121, Article 16, 15 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

Distributed recoloring. (English) Zbl 1497.68369

Schmid, Ulrich (ed.) et al., 32nd international symposium on distributed computing, DISC 2018, New Orleans, Louisiana, USA, October 15–19, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 121, Article 12, 17 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Almost global problems in the LOCAL model. (English) Zbl 1497.68560

Schmid, Ulrich (ed.) et al., 32nd international symposium on distributed computing, DISC 2018, New Orleans, Louisiana, USA, October 15–19, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 121, Article 9, 16 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

State machine replication is more expensive than consensus. (English) Zbl 1497.68033

Schmid, Ulrich (ed.) et al., 32nd international symposium on distributed computing, DISC 2018, New Orleans, Louisiana, USA, October 15–19, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 121, Article 7, 18 p. (2018).
MSC:  68M14 68Q10 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Shape formation by programmable particles. (English) Zbl 1478.68017

Aspnes, James (ed.) et al., 21st international conference on principles of distributed systems, OPODIS 2017, Lisboa, Portugal, December 18–20, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 95, Article 31, 16 p. (2018).
MSC:  68M14 68Q10 68W15
PDFBibTeX XMLCite
Full Text: DOI

Constant space and non-constant time in distributed computing. (English) Zbl 1487.68253

Aspnes, James (ed.) et al., 21st international conference on principles of distributed systems, OPODIS 2017, Lisboa, Portugal, December 18–20, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 95, Article 30, 16 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Nearly-tight analysis for 2-choice and 3-majority consensus dynamics. (English) Zbl 1428.68068

Proceedings of the 37th ACM symposium on principles of distributed computing, PODC ’18, Egham, UK, July 23–27, 2018. New York, NY: Association for Computing Machinery (ACM). 305-313 (2018).
MSC:  68M14 68W15
PDFBibTeX XMLCite
Full Text: DOI arXiv

New classes of distributed time complexity. (English) Zbl 1427.68094

Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 1307-1318 (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Distributed symmetry-breaking algorithms for congested cliques. (English) Zbl 1484.68320

Fomin, Fedor V. (ed.) et al., Computer science – theory and applications. 13th international computer science symposium in Russia, CSR 2018, Moscow, Russia, June 6–10, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10846, 41-52 (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Tight bounds on the round complexity of the distributed maximum coverage problem. (English) Zbl 1403.68325

Czumaj, Artur (ed.), Proceedings of the 29th annual ACM-SIAM symposium on discrete algorithms, SODA 2018, New Orleans, LA, USA, January 7–10, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-503-1/ebook). 2412-2431 (2018).
PDFBibTeX XMLCite
Full Text: arXiv Link

Fast space optimal leader election in population protocols. (English) Zbl 1403.68064

Czumaj, Artur (ed.), Proceedings of the 29th annual ACM-SIAM symposium on discrete algorithms, SODA 2018, New Orleans, LA, USA, January 7–10, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-503-1/ebook). 2653-2667 (2018).
MSC:  68Q05 68M12 68M14 68Q10 68Q25
PDFBibTeX XMLCite
Full Text: arXiv Link

Symmetry breaking in the Congest model: time- and message-efficient algorithms for ruling sets. (English) Zbl 1515.68075

Richa, Andréa W. (ed.), 31st international symposium on distributed computing, DISC 2017, Vienna, Austria, October 16–20, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 91, Article 38, 16 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

Derandomizing local distributed algorithms under bandwidth restrictions. (English) Zbl 1515.68362

Richa, Andréa W. (ed.), 31st international symposium on distributed computing, DISC 2017, Vienna, Austria, October 16–20, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 91, Article 11, 16 p. (2017).
MSC:  68W15 68Q10 68W20
PDFBibTeX XMLCite
Full Text: DOI

Quadratic and near-quadratic lower bounds for the CONGEST model. (English) Zbl 1515.68230

Richa, Andréa W. (ed.), 31st international symposium on distributed computing, DISC 2017, Vienna, Austria, October 16–20, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 91, Article 10, 16 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Improved leader election for self-organizing programmable matter. (English) Zbl 1503.68070

Fernández Anta, Antonio (ed.) et al., Algorithms for sensor systems. 13th international symposium on algorithms and experiments for wireless sensor networks, ALGOSENSORS 2017, Vienna, Austria, September 7–8, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10718, 127-140 (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Algorithms to compute probabilistic bisimilarity distances for labelled Markov chains. (English) Zbl 1442.68152

Meyer, Roland (ed.) et al., 28th international conference on concurrency theory. CONCUR 2017, Berlin, Germany, September 5–8, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 85, Article 27, 16 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

Hardness of computing and approximating predicates and functions with leaderless population protocols. (English) Zbl 1442.68014

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 141, 14 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Set-consensus collections are decidable. (English) Zbl 1432.68026

Fatourou, Panagiota (ed.) et al., 20th international conference on principles of distributed systems (OPODIS 2016), Madrid, Spain, December 13–16, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 70, Article 7, 15 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Time-space trade-offs in population protocols. (English) Zbl 1410.68118

Klein, Philip N. (ed.), Proceedings of the 28th annual ACM-SIAM symposium on discrete algorithms, SODA 2017, Barcelona, Spain, January 16–19, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 2560-2579 (2017).
MSC:  68Q05 68Q10 68Q25 68W15
PDFBibTeX XMLCite
Full Text: DOI arXiv

Computational tradeoffs in biological neural networks: self-stabilizing winner-take-all networks. (English) Zbl 1402.68060

Papadimitriou, Christos H. (ed.), 8th innovations in theoretical computer science conference, ITCS 2017, Berkeley, CA, USA, January 9–11, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-029-3). LIPIcs – Leibniz International Proceedings in Informatics 67, Article 15, 44 p. (2017).
MSC:  68Q05 68Q10 68Q17 68W15 92B20
PDFBibTeX XMLCite
Full Text: DOI arXiv

Brief announcement: Optimal address-oblivious epidemic dissemination. (English) Zbl 1380.68022

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). 151-153 (2017).
MSC:  68M10 68M14 68W15
PDFBibTeX XMLCite
Full Text: DOI

On the complexity of local distributed graph problems. (English) Zbl 1370.68127

Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 784-797 (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Further algebraic algorithms in the congested clique model and applications to graph-theoretic problems. (English) Zbl 1393.68185

Gavoille, Cyril (ed.) et al., Distributed computing. 30th international symposium, DISC 2016, Paris, France, September 27–29, 2016. Proceedings. Berlin: Springer (ISBN 978-3-662-53425-0/pbk; 978-3-662-53426-7/ebook). Lecture Notes in Computer Science 9888, 57-70 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Ability to count messages is worth \(\Theta(\Delta)\) rounds in distributed computing. (English) Zbl 1401.68230

Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5–8, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4391-6). 357-366 (2016).
PDFBibTeX XMLCite
Full Text: DOI

Distributed and robust support vector machine. (English) Zbl 1398.68449

Seok-Hee Hong (ed.), 27th international symposium on algorithms and computation, ISAAC 2016, Sydney, Australia, December 12–14, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-026-2). LIPIcs – Leibniz International Proceedings in Informatics 64, Article 54, 13 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI

Soundness in negotiations. (English) Zbl 1392.68298

Desharnais, Josée (ed.) et al., 27th international conference on concurrency theory, CONCUR 2016, Québec City, Canada, August 23–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-017-0). LIPIcs – Leibniz International Proceedings in Informatics 59, Article 12, 13 p. (2016).
MSC:  68Q85 68Q10 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Quantum communication complexity of distributed set joins. (English) Zbl 1398.68122

Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 54, 13 p. (2016).
MSC:  68P15 68Q10 68Q12
PDFBibTeX XMLCite
Full Text: DOI arXiv

The linear voting model. (English) Zbl 1388.68220

Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 144, 12 p. (2016).
MSC:  68R10 68M14 68W20
PDFBibTeX XMLCite
Full Text: DOI

A hierarchy of local decision. (English) Zbl 1388.68062

Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 118, 15 p. (2016).
MSC:  68Q10 68R10 68W15
PDFBibTeX XMLCite
Full Text: DOI arXiv

Proving the Herman-protocol conjecture. (English) Zbl 1388.68060

Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 104, 12 p. (2016).
MSC:  68Q10 68W15 68W20
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the complexity of reader-writer locks (extended abstract). (English) Zbl 1375.68029

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). 315-324 (2016).
PDFBibTeX XMLCite
Full Text: DOI

A Markov chain algorithm for compression in self-organizing particle systems. (English) Zbl 1375.68193

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). 279-288 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Optimal principal component analysis in distributed and streaming models. (English) Zbl 1381.62140

Wichs, Daniel (ed.) et al., Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC ’16, Cambridge, MA, USA, June 19–21, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4132-5). 236-249 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software