×

Found 1,032 Documents (Results 1–100)

Classical and quantum 3 and 4-sieves to solve SVP with low memory. (English) Zbl 07839110

Johansson, Thomas (ed.) et al., Post-quantum cryptography. 14th international workshop, PQCrypto 2023, College Park, MD, USA, August 16–18, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14154, 225-255 (2023).
PDFBibTeX XMLCite
Full Text: DOI

A dyadic simulation approach to efficient range-summability. (English) Zbl 07838439

Aspnes, James (ed.) et al., 1st symposium on algorithmic foundations of dynamic networks, SAND 2022, virtual conference, March 28–30, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 221, Article 17, 18 p. (2022).
MSC:  68Mxx 68R10
PDFBibTeX XMLCite
Full Text: DOI

A dyadic simulation approach to efficient range-summability. (English) Zbl 07836647

Olteanu, Dan (ed.) et al., 25th international conference on database theory, ICDT 2022, Edinburgh, UK, virtual conference, March 29 – April 1, 2022. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 220, Article 17, 18 p. (2022).
MSC:  68P15
PDFBibTeX XMLCite
Full Text: DOI arXiv

Improved distributed fractional coloring algorithms. (English) Zbl 07832759

Bramas, Quentin (ed.) et al., 25th international conference on principles of distributed systems, OPODIS 2021, Strasbourg, France, December 13–15, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 217, Article 18, 23 p. (2022).
MSC:  68M14 68M20
PDFBibTeX XMLCite
Full Text: DOI arXiv

Differential games, locality, and model checking for FO logic of graphs. (English) Zbl 07830378

Manea, Florin (ed.) et al., 30th EACSL annual conference on computer science logic, CSL 2022, Göttingen, Germany, virtual conference, February 14–19, 2022. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 216, Article 22, 18 p. (2022).
MSC:  03B70
PDFBibTeX XMLCite
Full Text: DOI arXiv

Beating classical impossibility of position verification. (English) Zbl 07829332

Braverman, Mark (ed.), 13th innovations in theoretical computer science conference, ITCS 2022, Berkeley, CA, USA, January 31 – February 3, 2022. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 215, Article 100, 11 p. (2022).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

The landscape of distributed complexities on trees and beyond. (English) Zbl 07824245

Milani, Alessia (ed.) et al., Proceedings of the 41st ACM symposium on principles of distributed computing, PODC ’22, Salerno, Italy, July 25–29, 2022. New York, NY: Association for Computing Machinery (ACM). 37-47 (2022).
MSC:  68M14 68W15
PDFBibTeX XMLCite
Full Text: DOI arXiv

Non-parametric learning of embeddings for relational data using Gaifman locality theorem. (English) Zbl 1524.68270

Katzouris, Nikos (ed.) et al., Inductive logic programming. 30th international conference, ILP 2021, virtual event, October 25–27, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13191, 95-110 (2022).
MSC:  68T05
PDFBibTeX XMLCite
Full Text: DOI

BV quantisation in perturbative algebraic QFT: fundamental concepts and perspectives. (English) Zbl 1517.81014

Read, James (ed.) et al., The philosophy and physics of Noether’s theorems. A centenary volume. Cambridge: Cambridge University Press. 100-133 (2022).
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Visible rank and codes with locality. (English) Zbl 07768402

Wootters, Mary (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 24th international conference, APPROX 2021, and 25th international conference, RANDOM 2021, University of Washington, Seattle, Washington, US (virtual conference), August 16–18, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 207, Article 57, 18 p. (2021).
MSC:  68W20 68W25 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

GSF-locality is not sufficient for proximity-oblivious testing. (English) Zbl 07711616

Kabanets, Valentine (ed.), 36th computational complexity conference, CCC 2021, Toronto, Ontario, Canada, virtual conference, July 20–23, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 200, Article 34, 27 p. (2021).
MSC:  68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Locality sensitive hashing with extended differential privacy. (English) Zbl 1498.68102

Bertino, Elisa (ed.) et al., Computer security – ESORICS 2021. 26th European symposium on research in computer security, Darmstadt, Germany, October 4–8, 2021. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 12973, 563-583 (2021).
MSC:  68P27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Grammar index by induced suffix sorting. (English) Zbl 07542414

Lecroq, Thierry (ed.) et al., String processing and information retrieval. 28th international symposium, SPIRE 2021, Lille, France, October 4–6, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12944, 85-99 (2021).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Tensor fields for data extraction from chart images: bar charts and scatter plots. (English) Zbl 07483383

Hotz, Ingrid (ed.) et al., Topological methods in data analysis and visualization VI. Theory, applications, and software. Selected papers based on the presentations at the 8th TopoInVis workshop, Nyköping, Sweden, June 2019. Cham: Springer. Math. Vis., 219-241 (2021).
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

Biographic Reference

all top 3

Software