×

Found 180 Documents (Results 1–100)

On testing and robust characterizations of convexity. (English) Zbl 07758320

Byrka, Jarosław (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 23rd international conference, APPROX 2020, and 24th international conference, RANDOM 2020, August 17–19, 2020, Virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 176, Article 18, 15 p. (2020).
MSC:  68W20 68W25 90C27
Full Text: DOI

An almost tight RMR lower bound for abortable test-and-set. (English) Zbl 1497.68043

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 21, 19 p. (2018).

An improved dictatorship test with perfect completeness. (English) Zbl 1491.68083

Lokam, Satya (ed.) et al., 37th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2017, IIT Kanpur, India, December 12–14, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 93, Article 15, 23 p. (2018).
MSC:  68Q25 06E30 68W20

Reconstruction of full rank algebraic branching programs. (English) Zbl 1440.68081

O’Donnell, Ryan (ed.), 32nd computational complexity conference, CCC 2017, July 6–9, 2017, Riga, Latvia. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 79, Article 21, 61 p. (2017).
Full Text: DOI

Cube vs. cube low degree test. (English) Zbl 1402.68190

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 40, 31 p. (2017).

Two-sample rank-sum test for order restricted randomized designs. (English) Zbl 1366.62094

Liu, Regina Y. (ed.) et al., Robust rank-based and nonparametric methods. Western Michigan University, Kalamazoo, MI, USA, April 9–10, 2015. Selected, revised, and extended contributions. Cham: Springer (ISBN 978-3-319-39063-5/hbk; 978-3-319-39065-9/ebook). Springer Proceedings in Mathematics & Statistics 168, 141-161 (2016).
MSC:  62G10 62D05 62P10
Full Text: DOI

A query efficient non-adaptive long code test with perfect completeness. (English) Zbl 1305.68105

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, 738-751 (2010).
MSC:  68Q25 68W20 68W25

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