×

Found 106 Documents (Results 1–100)

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

On the probabilistic degrees of symmetric Boolean functions. (English) Zbl 1527.68089

Chattopadhyay, Arkadev (ed.) et al., 39th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2019, Bombay, India, December 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 150, Article 28, 14 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

Local cliques in ER-perturbed random geometric graphs. (English) Zbl 07650262

Lu, Pinyan (ed.) et al., 30th international symposium on algorithms and computation, ISAAC 2019, Shanghai University of Finance and Economics, Shanghai, China, December 8–11, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 149, Article 29, 22 p. (2019).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

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

The expected number of maximal points of the convolution of two 2-D distributions. (English) Zbl 07650102

Achlioptas, Dimitris (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques, 22nd international conference, APPROX 2019, and 23rd international conference, RANDOM 2019, Massachusetts Institute of Technology, Cambridge, MA, USA, September 20–22, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 145, Article 35, 14 p. (2019).
MSC:  68W20 68W25 90C27
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

Independent sets in vertex-arrival streams. (English) Zbl 1517.68285

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

Probabilistic checking against non-signaling strategies from linearity testing. (English) Zbl 1499.68116

Blum, Avrim (ed.), 10th innovations in theoretical computer science conference, ITCS 2019, January 10–12, 2019, San Diego, CA, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 124, Article 25, 17 p. (2019).
MSC:  68Q10 68Q87 68W20
PDFBibTeX XMLCite
Full Text: DOI

Randomized incremental construction of Delaunay triangulations of nice point sets. (English) Zbl 07525459

Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 22, 13 p. (2019).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Probabilistic parameterized polynomial time. (English) Zbl 1445.68115

Catania, Barbara (ed.) et al., SOFSEM 2019: theory and practice of computer science. 45th international conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 27–30, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11376, 179-191 (2019).
MSC:  68Q27 62H22 68W20
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

Generalized approach for analysing quantum key distribution experiments. (English) Zbl 1456.94098

Hao, Feng (ed.) et al., Progress in cryptology – INDOCRYPT 2019. 20th international conference on cryptology in India, Hyderabad, India, December 15–18, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11898, 472-491 (2019).
PDFBibTeX XMLCite
Full Text: DOI

Efficient quantum algorithms related to autocorrelation spectrum. (English) Zbl 1456.94048

Hao, Feng (ed.) et al., Progress in cryptology – INDOCRYPT 2019. 20th international conference on cryptology in India, Hyderabad, India, December 15–18, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11898, 415-432 (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

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

Oblivious resampling oracles and parallel algorithms for the lopsided Lovász local lemma. (English) Zbl 1431.68128

Chan, Timothy M. (ed.), Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6–9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 841-860 (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 3

Main Field

all top 3

Software