×

Found 111 Documents (Results 1–100)

Phase transitions of best-of-two and best-of-three on stochastic block models. (English) Zbl 1515.68077

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

Deterministic approximation of random walks in small space. (English) Zbl 1528.68314

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

Expanders – how to find them, and what to find in them. (English) Zbl 1476.05104

Lo, Allan (ed.) et al., Surveys in combinatorics 2019. Papers based on the 27th British combinatorial conference, University of Birmingham, Birmingham, UK, July 29 – August 2, 2019. Cambridge: Cambridge University Press. Lond. Math. Soc. Lect. Note Ser. 456, 115-142 (2019).
MSC:  05C48 05C38 05C81
PDFBibTeX XMLCite
Full Text: DOI arXiv

Random walks and forbidden minors. II: A \(\mathrm{poly}(d\varepsilon^{-1})\)-query tester for minor-closed properties of bounded degree graphs. (English) Zbl 1433.68300

Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 559-567 (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Log-concave polynomials. II: High-dimensional walks and an FPRAS for counting bases of a matroid. (English) Zbl 1433.68606

Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 1-12 (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

On coalescence time in graphs: when is coalescing as fast as meeting? Extended abstract. (English) Zbl 1434.05137

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). 956-965 (2019).
MSC:  05C81
PDFBibTeX XMLCite
Full Text: DOI arXiv

Random walks on graphs: new bounds on hitting, meeting, coalescing and returning. (English) Zbl 1433.05287

Mishna, Marni (ed.) et al., Proceedings of the 16th workshop on analytic algorithmics and combinatorics, ANALCO ’19, San Diego, CA, USA, January 6, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 119-126 (2019).
MSC:  05C81 60J27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Adjacent vertices can be hard to find by quantum walks. (English. Russian original) Zbl 1423.68188

Mosc. Univ. Comput. Math. Cybern. 43, No. 1, 32-39 (2019); translation from Vestn. Mosk. Univ., Ser. XV 2019, No. 1, 54-64 (2019).
MSC:  68Q12 05C81
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Database

all top 5

Author

all top 5

Serial

all top 3

Main Field