×

Found 31 Documents (Results 1–31)

The communication complexity of functions with large outputs. (English) Zbl 07786530

Rajsbaum, Sergio (ed.) et al., Structural information and communication complexity. 30th international colloquium, SIROCCO 2023, Alcalá de Henares, Spain, June 6–9, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13892, 427-458 (2023).
MSC:  68Mxx 68Q11 68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Sensitivity lower bounds from linear dependencies. (English) Zbl 07559433

Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 62, 14 p. (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Provably secure key establishment against quantum adversaries. (English) Zbl 1427.81024

Wilde, Mark M. (ed.), 12th conference on the theory of quantum computation, communication and cryptography, TQC 2017, June 14–16, 2017, Paris, France. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 73, Article 3, 17 p. (2018).
MSC:  81P94 94A60
PDFBibTeX XMLCite
Full Text: DOI arXiv

Robust Bell inequalities from communication complexity. (English) Zbl 1370.81042

Broadbent, Anne (ed.), 11th conference on the theory of quantum computation, communication and cryptography, TQC 2016, Berlin, Germany, September 27–29, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-019-4). LIPIcs – Leibniz International Proceedings in Informatics 61, Article 5, 24 p. (2016).
MSC:  81P45 68Q05 68Q17 81P15 81P68
PDFBibTeX XMLCite
Full Text: DOI arXiv

Relative discrepancy does not separate information and communication complexity. (English) Zbl 1440.68090

Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 9134, 506-516 (2015).
MSC:  68Q11
PDFBibTeX XMLCite
Full Text: DOI Link

Classical and quantum partition bound and detector inefficiency. (English) Zbl 1272.68145

Czumaj, Artur (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Warwick, UK, July 9–13, 2012. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-31593-0/pbk). Lecture Notes in Computer Science 7391, 617-628 (2012).
MSC:  68Q17 68Q05 68Q12
PDFBibTeX XMLCite
Full Text: DOI arXiv

Merkle puzzles in a quantum world. (English) Zbl 1287.94057

Rogaway, Phillip (ed.), Advances in cryptology – CRYPTO 2011. 31st annual cryptology conference, Santa Barbara, CA, USA, August 14–18, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22791-2/pbk). Lecture Notes in Computer Science 6841, 391-410 (2011).
MSC:  94A60
PDFBibTeX XMLCite
Full Text: DOI

Non-local box complexity and secure function evaluation. (English) Zbl 1248.68218

Kannan, Ravi (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2009), December 15–17, 2009, Kanpur, India. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-13-2). LIPIcs – Leibniz International Proceedings in Informatics 4, 239-250, electronic only (2009).
MSC:  68Q17 68Q12 68Q30 68Q05 94A60 94A05
PDFBibTeX XMLCite
Full Text: DOI Link

Cryptographic security of individual instances. (English) Zbl 1263.94019

Desmedt, Yvo (ed.), Information theoretic security. Second international conference, ICITS 2007, Madrid, Spain, May 25–29, 2007. Revised selected papers. Berlin: Springer (ISBN 978-3-642-10229-5/pbk). Lecture Notes in Computer Science 4883, 195-210 (2009).
MSC:  94A60 68Q30 94A15
PDFBibTeX XMLCite
Full Text: DOI

The communication complexity of non-signaling distributions. (English) Zbl 1250.68107

Královič, Rastislav (ed.) et al., Mathematical foundations of computer science 2009. 34th international symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24–28, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03815-0/pbk). Lecture Notes in Computer Science 5734, 270-281 (2009).
MSC:  68Q05 68Q12 68Q17 68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Kolmogorov complexity and combinatorial methods in communication complexity. (English) Zbl 1241.68074

Chen, Jianer (ed.) et al., Theory and applications of models of computation. 6th annual conference, TAMC 2009, Changsha, China, May 18–22, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02016-2/pbk). Lecture Notes in Computer Science 5532, 261-270 (2009).
MSC:  68Q30 68Q17 81P45
PDFBibTeX XMLCite
Full Text: DOI

Lower bounds using Kolmogorov complexity. (English) Zbl 1145.68429

Beckmann, Arnold (ed.) et al., Logical approaches to computational barriers. Second conference on computability in Europe, CiE 2006, Swansea, UK, June 30–July 5, 2006. Proceedings. Berlin: Springer (ISBN 3-540-35466-2/pbk). Lecture Notes in Computer Science 3988, 297-306 (2006).
MSC:  68Q17 68Q30
PDFBibTeX XMLCite
Full Text: DOI

Handling spatial uncertainty in binary images: A rough set based approach. (English) Zbl 1013.68583

Alpigini, James J. (ed.) et al., Rough sets and current trends in computing. 3rd international conference, RSCTC 2002, Malvern, PA, USA, October 14-16, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2475, 610-620 (2002).
PDFBibTeX XMLCite
Full Text: Link

Filter Results by …

Database

all top 5

Year of Publication

all top 3

Main Field