×

Found 313 Documents (Results 1–100)

Finding diameter-reducing shortcuts in trees. (English) Zbl 07789703

Morin, Pat (ed.) et al., Algorithms and data structures. 18th international symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14079, 164-178 (2023).
MSC:  68P05 68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Implementing secure reporting of sexual misconduct – revisiting WhoToo. (English) Zbl 1489.91205

Longa, Patrick (ed.) et al., Progress in cryptology – LATINCRYPT 2021. 7th international conference on cryptology and information security in Latin America, Bogotá, Colombia, October 6–8, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12912, 341-362 (2021).
MSC:  91D99 94A60
PDFBibTeX XMLCite
Full Text: DOI

Two-server distributed ORAM with sublinear computation and constant rounds. (English) Zbl 1517.68046

Garay, Juan A. (ed.), Public-key cryptography – PKC 2021. 24th IACR international conference on practice and theory of public key cryptography, virtual event, May 10–13, 2021. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 12711, 499-527 (2021).
PDFBibTeX XMLCite
Full Text: DOI

A geometric approach to homomorphic secret sharing. (English) Zbl 1479.94324

Garay, Juan A. (ed.), Public-key cryptography – PKC 2021. 24th IACR international conference on practice and theory of public key cryptography, virtual event, May 10–13, 2021. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 12711, 92-119 (2021).
PDFBibTeX XMLCite
Full Text: DOI

Complexity estimates for Fourier-Motzkin elimination. (English) Zbl 07635835

Boulier, François (ed.) et al., Computer algebra in scientific computing. 22nd international workshop, CASC 2020, Linz, Austria, September 14–18, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12291, 282-306 (2020).
MSC:  68W30
PDFBibTeX XMLCite
Full Text: DOI arXiv

Efficiently factoring polynomials modulo \(p^4\). (English) Zbl 1467.11113

Bradford, Russell (ed.), Proceedings of the 44th international symposium on symbolic and algebraic computation, ISSAC ’19, Beijing, China, July 15–18, 2019. New York, NY: Association for Computing Machinery (ACM). 139-146 (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

A framework for in-place graph algorithms. (English) Zbl 1522.68389

Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 13, 16 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Design patterns for efficient solutions to NP-complete problems in membrane computing. (English) Zbl 1519.68095

Graciani, Carmen (ed.) et al., Enjoying natural computing. Essays dedicated to Mario de Jesús Pérez-Jiménez on the occasion of his 70th birthday. Cham: Springer. Lect. Notes Comput. Sci. 11270, 237-255 (2018).
MSC:  68Q07 68Q17
PDFBibTeX XMLCite
Full Text: DOI

Trilogy on computing maximal eigenpair. (English) Zbl 1385.65030

Yue, Wuyi (ed.) et al., Queueing theory and network applications. 12th international conference, QTNA 2017, Qinhuangdao, China, August 21–23, 2017. Proceedings. Cham: Springer (ISBN 978-3-319-68519-9/pbk; 978-3-319-68520-5/ebook). Lecture Notes in Computer Science 10591, 312-329 (2017).
MSC:  65F15 65F50
PDFBibTeX XMLCite
Full Text: DOI arXiv

Quantum-dot cellular automata: a clocked architecture for high-speed, energy-efficient molecular computing. (English) Zbl 1486.68106

Patitz, Matthew J. (ed.) et al., Unconventional computation and natural computation. 16th international conference, UCNC 2017, Fayetteville, AR, USA, June 5–9, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10240, 56-68 (2017).
MSC:  68Q80 68Q06 81P68
PDFBibTeX XMLCite
Full Text: DOI

Better preprocessing for secure multiparty computation. (English) Zbl 1346.68085

Manulis, Mark (ed.) et al., Applied cryptography and network security. 14th international conference, ACNS 2016, Guildford, UK, June 19–22, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-39554-8/pbk; 978-3-319-39555-5/ebook). Lecture Notes in Computer Science 9696, 327-345 (2016).
MSC:  68P25 68M12
PDFBibTeX XMLCite
Full Text: DOI

Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs. (English) Zbl 1379.94041

Dodis, Yevgeniy (ed.) et al., Theory of cryptography. 12th theory of cryptography conference, TCC 2015, Warsaw, Poland, March 23–25, 2015. Proceedings, Part II. Berlin: Springer (ISBN 978-3-662-46496-0/pbk). Lecture Notes in Computer Science 9015, 90-120 (2015).
MSC:  94A60
PDFBibTeX XMLCite
Full Text: DOI

Publicly auditable secure multi-party computation. (English) Zbl 1346.68084

Abdalla, Michel (ed.) et al., Security and cryptography for networks. 9th international conference, SCN 2014, Amalfi, Italy, September 3–5, 2014. Proceedings. Berlin: Springer (ISBN 978-3-319-10878-0/pbk). Lecture Notes in Computer Science 8642, 175-196 (2014).
PDFBibTeX XMLCite
Full Text: DOI Link

An energy complexity model for algorithms. (English) Zbl 1362.68112

Proceedings of the 4th conference on innovations in theoretical computer science, ITCS’13, Berkeley, CA, USA, January 9–12, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1859-4). 283-303 (2013).
MSC:  68Q25 65F30 68P10 68Q05 68Q10 68W40
PDFBibTeX XMLCite
Full Text: DOI

Stone age distributed computing. (English) Zbl 1323.68270

Proceedings of the 2013 ACM symposium on principles of distributed computing, PODC ’13, Montreal, QC, Canada, July 22–24, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2065-8). 137-146 (2013).
MSC:  68Q05 68M14 68Q10 68Q45 68Q80 68W15
PDFBibTeX XMLCite
Full Text: DOI arXiv

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