×

Found 485 Documents (Results 1–100)

Unifying framework for accelerated randomized methods in convex optimization. (English) Zbl 07822579

Belomestny, Denis (ed.) et al., Foundations of modern statistics. Festschrift in honor of Vladimir Spokoiny. Selected contributions based on the presentations at the international conference, Berlin, Germany, November 6–8, 2019 and Moscow, Russia, November 30, 2019. Cham: Springer. Springer Proc. Math. Stat. 425, 511-561 (2023).
MSC:  62-XX
PDFBibTeX XMLCite
Full Text: DOI arXiv

Implementing Grover oracle for lightweight block ciphers under depth constraints. (English) Zbl 1529.81055

Nguyen, Khoa (ed.) et al., Information security and privacy. 27th Australasian conference, ACISP 2022, Wollongong, NSW, Australia, November 28–30, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13494, 85-105 (2022).
PDFBibTeX XMLCite
Full Text: DOI

Diameter versus certificate complexity of Boolean functions. (English) Zbl 07724204

Bonchi, Filippo (ed.) et al., 46th international symposium on mathematical foundations of computer science, MFCS 2021, August 23–27, 2021, Tallinn, Estonia. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 202, Article 31, 22 p. (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

New attacks on LowMC instances with a single plaintext/ciphertext pair. (English) Zbl 1514.94036

Tibouchi, Mehdi (ed.) et al., Advances in cryptology – ASIACRYPT 2021. 27th international conference on the theory and application of cryptology and information security, Singapore, December 6–10, 2021. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 13090, 303-331 (2021).
MSC:  94A60 68P25 68Q17
PDFBibTeX XMLCite
Full Text: DOI Link

On the linear complexity of feedforward clock-controlled sequence. (English) Zbl 1492.94177

Yu, Yu (ed.) et al., Information security and cryptology. 17th international conference, Inscrypt 2021, virtual event, August 12–14, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13007, 331-348 (2021).
MSC:  94A60 94A55
PDFBibTeX XMLCite
Full Text: DOI arXiv

Gourds: a sliding-block puzzle with turning. (English) Zbl 07765391

Cao, Yixin (ed.) et al., 31st international symposium on algorithms and computation, ISAAC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 181, Article 33, 16 p. (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Resource-bounded Kolmogorov complexity provides an obstacle to soficness of multidimensional shifts. (English) Zbl 1503.68081

Niedermeier, Rolf (ed.) et al., 36th international symposium on theoretical aspects of computer science, STACS 2019, March 13–16, 2019, Berlin, Germany. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 126, Article 23, 17 p. (2019).
MSC:  68Q30 37B51
PDFBibTeX XMLCite
Full Text: DOI arXiv

Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics. (English) Zbl 1433.68147

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). 193-204 (2019).
MSC:  68Q12 81P68
PDFBibTeX XMLCite
Full Text: DOI arXiv

All classical adversary methods are equivalent for total functions. (English) Zbl 1487.68117

Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 8, 14 p. (2018).
MSC:  68Q17 68Q11 68Q30
PDFBibTeX XMLCite
Full Text: DOI arXiv

Generalized polynomial decomposition for S-boxes with application to side-channel countermeasures. (English) Zbl 1450.94033

Fischer, Wieland (ed.) et al., Cryptographic hardware and embedded systems – CHES 2017. 19th international conference, Taipei, Taiwan, September 25–28, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10529, 154-171 (2017).
MSC:  94A60
PDFBibTeX XMLCite
Full Text: DOI

Restrained domination in some subclasses of chordal graphs. (English) Zbl 1383.05243

Sinha, Deepa (ed.) et al., International conference on current trends in graph theory and computation, CTGTC-2016, New Delhi, India, September 17–19, 2016. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 63, 203-210 (2017).
PDFBibTeX XMLCite
Full Text: DOI

A linear-time algorithm for the identifying code problem on block graphs. (English) Zbl 1441.05151

Bassino, Frédérique (ed.) et al., LAGOS 2017. Selected papers of the 9th Latin-American algorithms, graphs, and optimization symposium, Marseille, France, September 11–15, 2017. Amsterdam: Elsevier. Electron. Notes Discrete Math. 62, 249-254 (2017).
PDFBibTeX XMLCite
Full Text: DOI HAL

The universal block Lanczos-Padé method for linear systems over large prime fields. (English. Russian original) Zbl 1404.65038

J. Math. Sci., New York 221, No. 3, 461-478 (2017); translation from Fundam. Prikl. Mat. 19, No. 6, 225-249 (2014).
PDFBibTeX XMLCite
Full Text: DOI

On sets and graphs. Perspectives on logic and combinatorics. (English) Zbl 1382.05002

Cham: Springer (ISBN 978-3-319-54980-4/hbk; 978-3-319-54981-1/ebook). xix, 275 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

Note on impossible differential attacks. (English) Zbl 1387.94079

Peyrin, Thomas (ed.), Fast software encryption. 23rd international conference, FSE 2016, Bochum, Germany, March 20–23, 2016. Revised selected papers. Berlin: Springer (ISBN 978-3-662-52992-8/pbk; 978-3-662-52993-5/ebook). Lecture Notes in Computer Science 9783, 416-427 (2016).
MSC:  94A60
PDFBibTeX XMLCite
Full Text: DOI

On the sensitivity conjecture for disjunctive normal forms. (English) Zbl 1391.68057

Lal, Akash (ed.) et al., 36th IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2016), Chennai, India, December 13–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-027-9). LIPIcs – Leibniz International Proceedings in Informatics 65, Article 15, 15 p. (2016).
MSC:  68Q25 68Q05 94C10
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the sensitivity conjecture. (English) Zbl 1388.68136

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 38, 13 p. (2016).
MSC:  68Q25 06E30
PDFBibTeX XMLCite
Full Text: DOI

Block-wise non-malleable codes. (English) Zbl 1377.94041

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 31, 14 p. (2016).
MSC:  94A60
PDFBibTeX XMLCite
Full Text: DOI

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