Electronic Voting

Συνεισφορές: Duenas-Cid, David, Roenne, Peter, Volkamer, Melanie, Blom, Michelle, Gaudry, Pierrick, Borucki, Isabelle, Loeber, Leontine, Debant, Alexandre

Θεματικοί όροι: Open Access, Computational complexity and cryptography, Robustness, Human computer interaction (HCI), Data management systems, Architectures, Systems security, Government technology policy, Law, social and behavioral sciences, Coding theory and cryptology, Data encryption, Artificial intelligence, Network security, Network hardware

Περιγραφή αρχείου: image/jpeg

Relation: Lecture Notes in Computer Science; Computer Science; Computer Science (R0)

Σύνδεσμος πρόσβασης: https://directory.doabooks.org/handle/20.500.12854/166619
https://library.oapen.org/handle/20.500.12657/106046
https://library.oapen.org/bitstream/20.500.12657/106046/1/9783032050366.pdf

Electronic Voting

Συνεισφορές: Duenas-Cid, David, Roenne, Peter, Volkamer, Melanie, Blom, Michelle, Gaudry, Pierrick, Borucki, Isabelle, Loeber, Leontine, Debant, Alexandre

Θεματικοί όροι: Open Access, Computational complexity and cryptography, Robustness, Human computer interaction (HCI), Data management systems, Architectures, Systems security, Government technology policy, Law, social and behavioral sciences, Coding theory and cryptology, Data encryption, Artificial intelligence, Network security, Network hardware

Περιγραφή αρχείου: application/pdf

Relation: Lecture Notes in Computer Science; Computer Science; Computer Science (R0)

Σύνδεσμος πρόσβασης: https://library.oapen.org/handle/20.500.12657/106046

Formal Methods

Συνεισφορές: Platzer, Andre, Rozier, Kristin Yvonne, Pradella, Matteo, Rossi, Matteo

Θεματικοί όροι: architecture verification and validation, artificial intelligence, design and analysis of algorithms, computational complexity and cryptography, embedded systems, model checking, formal methods, formal logic, machine learning, formal languages and automata theory, models of computation, semantics and reasoning, software engineering, theory and algorithms for application domains, Software Engineering, Mathematical theory of computation, Expert systems / knowledge-based systems, Programming and scripting languages: general, Computer hardware, Natural language and machine translation

Περιγραφή αρχείου: image/png; image/jpeg

Relation: Lecture Notes in Computer Science

Σύνδεσμος πρόσβασης: https://directory.doabooks.org/handle/20.500.12854/144770
https://library.oapen.org/handle/20.500.12657/93255
https://library.oapen.org/bitstream/20.500.12657/93255/1/978-3-031-71177-0.pdf

An Unbounded Fully Homomorphic Encryption Scheme Based on Ideal Lattices and Chinese Remainder Theorem

Συγγραφείς: Zheng, Zhiyong, Liu, Fengxia, Tian, Kun

Θεματικοί όροι: Computer Science - Cryptography and Security, Mathematics - Rings and Algebras, Security and privacy - Cryptography and other attacks, Theory of computation - Computational complexity and cryptography

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2301.12060

Kolmogorov time hierarchy and novelty games ; Hiérarchie temporelle de Kolmogorov et jeux de trouvailles

Συγγραφείς: Léchine, Ulysse, Seiller, Thomas

Συνεισφορές: Laboratoire d'Informatique de Paris-Nord (LIPN), Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord, Université Sorbonne Paris Nord, Centre National de la Recherche Scientifique (CNRS), ANR-22-CE48-0003,DySCo,Systèmes Dynamiques et Calcul: une approche logique(2022)

Πηγή: https://hal.science/hal-04539439 ; 2025.

Θεματικοί όροι: CCS Concepts: Theory of computation → Computational complexity and cryptography, Theory of computation → Computational complexity and cryptography, CCS Concepts, Combinatorial game, Time hierarchy, Mathematics of computing → Discrete mathematics Kolmogorov Complexity, Combinatorics, Parallel computing, time bounded kolmogorov complexity, Complexity theory, Kolmogorov Complexity, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO]Computer Science [cs], [MATH]Mathematics [math], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

Διαθεσιμότητα: https://hal.science/hal-04539439
https://hal.science/hal-04539439v3/document
https://hal.science/hal-04539439v3/file/main.pdf

Formal Methods

Συνεισφορές: Platzer, Andre, Rozier, Kristin Yvonne, Pradella, Matteo, Rossi, Matteo

Θεματικοί όροι: architecture verification and validation, artificial intelligence, design and analysis of algorithms, computational complexity and cryptography, embedded systems, model checking, formal methods, formal logic, machine learning, formal languages and automata theory, models of computation, semantics and reasoning, software engineering, theory and algorithms for application domains, Software Engineering, Mathematical theory of computation, Expert systems / knowledge-based systems, Programming and scripting languages: general, Computer hardware, Natural language and machine translation

Περιγραφή αρχείου: application/pdf

Relation: Lecture Notes in Computer Science

Σύνδεσμος πρόσβασης: https://library.oapen.org/handle/20.500.12657/93255

Limits of Preprocessing

Συγγραφείς: Filmus, Yuval, Ishai, Yuval, Kaplan, Avi, Kindler, Guy

Συνεισφορές: Yuval Filmus and Yuval Ishai and Avi Kaplan and Guy Kindler, Shubhangi Saraf

Πηγή: 35th Computational Complexity Conference

Θεματικοί όροι: Theory of computation → Communication complexity, IPPP, 4. Education, 16. Peace & justice, simultaneous messages, 7. Clean energy, communication complexity, ddc:004, preprocessing, Theory of computation → Computational complexity and cryptography, circuit, Theory of computation → Circuit complexity, PRF

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://dl.acm.org/doi/10.4230/LIPIcs.CCC.2020.17
https://dblp.uni-trier.de/db/conf/coco/coco2020.html#FilmusIKK20
https://doi.org/10.4230/LIPIcs.CCC.2020.17
https://drops.dagstuhl.de/opus/volltexte/2020/12569/pdf/LIPIcs-CCC-2020-17.pdf/
https://drops.dagstuhl.de/opus/volltexte/2020/12569/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.17

LIPIcs, Volume 289, STACS 2024, Complete Volume: 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)

Συγγραφείς: Beyersdorff, Olaf, Kanté, Mamadou Moustapha, Kupferman, Orna, Lokshtanov, Daniel

Συνεισφορές: Kanté, Mamadou

Θεματικοί όροι: Theory of computation → Models of computation, Mathematics of computing → Graph theory, STACS 2024, Theory of computation → Design and analysis of algorithms, Theory of computation → Formal languages and automata theory, Complete Volume, [INFO] Computer Science [cs], Volume 289, Theory of computation → Computational complexity and cryptography, Mathematics of computing → Combinatorics, Theory of computation → Logic, LIPIcs

Σύνδεσμος πρόσβασης: https://hal.science/hal-04859229v1

Advanced tools and methods for treewidth-based problem solving

Συγγραφείς: Hecher, Markus^{j_itit-2023-0004_aff_001}

Πηγή: it - Information Technology. 65(1-2):65-73

Διαθεσιμότητα: https://www.degruyter.com/document/doi/10.1515/itit-2023-0004/html

Kolmogorov time hierarchy and novelty games ; Hiérarchie temporelle de Kolmogorov et jeux de trouvailles

Συγγραφείς: Léchine, Ulysse, Seiller, Thomas

Συνεισφορές: Laboratoire d'Informatique de Paris-Nord (LIPN), Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord, Université Sorbonne Paris Nord, Centre National de la Recherche Scientifique (CNRS), ANR-22-CE48-0003,DySCo,Systèmes Dynamiques et Calcul: une approche logique(2022)

Πηγή: https://hal.science/hal-04539439 ; 2024.

Θεματικοί όροι: Kolmogorov Complexity, Complexity theory, time bounded kolmogorov complexity, Parallel computing, Combinatorics, CCS Concepts: Theory of computation → Computational complexity and cryptography, Mathematics of computing → Discrete mathematics Kolmogorov Complexity, Time hierarchy, Combinatorial game, CCS Concepts, Theory of computation → Computational complexity and cryptography, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO]Computer Science [cs], [MATH]Mathematics [math], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

Διαθεσιμότητα: https://hal.science/hal-04539439
https://hal.science/hal-04539439v2/document
https://hal.science/hal-04539439v2/file/Kolmogorov-v2.pdf

LIPIcs, Volume 254, STACS 2023, Complete Volume

Συγγραφείς: Berenbrink, Petra, Bouyer, Patricia, Dawar, Anuj, Kanté, Mamadou Moustapha

Συνεισφορές: Petra Berenbrink and Patricia Bouyer and Anuj Dawar and Mamadou Moustapha Kanté, Kanté, Mamadou

Θεματικοί όροι: Theory of computation → Models of computation, Mathematics of computing → Graph theory, Theory of computation → Formal languages and automata theory, Theory of computation → Design and analysis of algorithms, [INFO] Computer Science [cs], Mathematics of computing → Combinatorics, Theory of computation → Logic, LIPIcs, Volume 254, STACS 2023, Complete Volume, STACS 2023, Complete Volume, ddc:004, Theory of computation → Computational complexity and cryptography, Volume 254, LIPIcs

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2023
https://hal.science/hal-04859252v1
https://doi.org/10.4230/lipics.stacs.2023

Certificate Games

Συγγραφείς: Chakraborty, Sourav, Gál, Anna, Laplante, Sophie, Mittal, Rajat, Sunny, Anupa

Συνεισφορές: Sourav Chakraborty and Anna Gál and Sophie Laplante and Rajat Mittal and Anupa Sunny, Magniez, Frédéric

Θεματικοί όροι: certificate complexity, zero-communication two-player games, boolean function complexity, block sensitivity, Theory of computation → Quantum query complexity, query complexity, [INFO] Computer Science [cs], ddc:004, sensitivity, Theory of computation → Computational complexity and cryptography, Theory of computation → Circuit complexity

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.32

A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space Tradeoff

Συγγραφείς: Rotem, Lior, Segev, Gil

Συνεισφορές: Lior Rotem and Gil Segev, Dachman-Soled, Dana

Θεματικοί όροι: Discrete logarithm, Security and privacy → Mathematical foundations of cryptography, Security and privacy → Information-theoretic techniques, ddc:004, Theory of computation → Computational complexity and cryptography, Preprocessing

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2022.12

on prover efficient public coin emulation of interactive proofs

Συγγραφείς: Arnon, Gal, Rothblum, Guy N.

Συνεισφορές: Gal Arnon and Guy N. Rothblum, Tessaro, Stefano

Πηγή: 2nd Conference on Information-Theoretic Cryptography (ITC 2021)

Θεματικοί όροι: Theory of computation → Interactive proof systems, Computational complexity, Cryptography, Interactive Proofs, ddc:004, Theory of computation → Computational complexity and cryptography

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/opus/volltexte/2021/14322/pdf/LIPIcs-ITC-2021-3.pdf/
https://drops.dagstuhl.de/opus/volltexte/2021/14322/
https://dblp.uni-trier.de/db/conf/citc/citc2021.html#ArnonR21
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.3

Average-case fine-grained hardness

Συγγραφείς: Ball, Marshall, Rosen, Alon, Sabin, Manuel, Vasudevan, Prashant Nalini

Πηγή: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. :483-496

Θεματικοί όροι: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, THEORY OF COMPUTATION, COMPUTATIONAL COMPLEXITY AND CRYPTOGRAPHY, COMPLEXITY CLASSES, COMPLEXITY THEORY AND LOGIC, CRYPTOGRAPHIC PRIMITIVES, PROBLEMS, REDUCTIONS AND COMPLETENESS

Σύνδεσμος πρόσβασης: http://dl.acm.org/ft_gateway.cfm?id=3055466&type=pdf
https://dl.acm.org/doi/pdf/10.1145/3055399.3055466
https://doi.org/10.1145/3055399.3055466
https://dblp.uni-trier.de/db/conf/stoc/stoc2017.html#BallRSV17
https://dl.acm.org/ft_gateway.cfm?id=3055466&type=pdf
https://dl.acm.org/doi/10.1145/3055399.3055466
https://hdl.handle.net/11565/4073360
https://doi.org/10.1145/3055399.3055466

On the Smoothed Complexity of Combinatorial Local Search

Συγγραφείς: Giannakopoulos, Yiannis, Grosz, Alexander, Melissourgos, Themistoklis

Θεματικοί όροι: info:eu-repo/classification/ddc, Smoothed Analysis, local search, better-response dynamics, PLS-hardness, combinatorial local optimization, congestion games, pure Nash equilibria, Theory of computation → Algorithmic game theory, Mathematics of computing → Combinatorial optimization, Theory of computation → Computational complexity and cryptography

Relation: https://mediatum.ub.tum.de/1748727

Διαθεσιμότητα: https://mediatum.ub.tum.de/1748727
https://doi.org/10.4230/LIPICS.ICALP.2024.72

On the Hardness of Average-case k-SUM

Συγγραφείς: Brakerski, Zvika, Stephens-Davidowitz, Noah, Vaikuntanathan, Vinod

Συνεισφορές: Zvika Brakerski and Noah Stephens-Davidowitz and Vinod Vaikuntanathan, Wootters, Mary, Sanità, Laura

Πηγή: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2021, August 16-18, 2021, University of Washington, Seattle, Washington, {USA} (Virtual Conference)

Θεματικοί όροι: FOS: Computer and information sciences, k-SUM, 0211 other engineering and technologies, average-case hardness, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, fine-grained complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Theory of computation → Computational complexity and cryptography

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2010.08821
https://drops.dagstuhl.de/opus/volltexte/2021/14722/
https://dblp.uni-trier.de/db/journals/corr/corr2010.html#abs-2010-08821
https://drops.dagstuhl.de/opus/volltexte/2021/14722/pdf/LIPIcs-APPROX29.pdf/
https://arxiv.org/pdf/2010.08821
https://arxiv.org/abs/2010.08821
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.29

Sensitivity Lower Bounds from Linear Dependencies

Συγγραφείς: Laplante, Sophie, Naserasr, Reza, Sunny, Anupa

Συνεισφορές: Sophie Laplante and Reza Naserasr and Anupa Sunny, Javier Esparza, Daniel Kráľ

Θεματικοί όροι: Sensitivity, Polynomial Degree, Boolean Functions, ddc:004, Theory of computation → Computational complexity and cryptography

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.62

LIPIcs, Volume 149, ISAAC'19, Complete Volume

Συγγραφείς: Lu, Pinyan, Zhang, Guochuan

Συνεισφορές: Pinyan Lu and Guochuan Zhang

Θεματικοί όροι: Computational complexity and cryptography, Theory and algorithms for application domains, Models of computation, Theory of computation, Randomness, geometry and discrete structures, Design and analysis of algorithms, geometry and discrete structures, ddc:004, Randomness

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019

Formal Methods ; 978-3-031-71177-0.pdf

Συνεισφορές: Platzer, Andre, Rozier, Kristin Yvonne, Pradella, Matteo, Rossi, Matteo

Θεματικοί όροι: architecture verification and validation, artificial intelligence, design and analysis of algorithms, computational complexity and cryptography, embedded systems, model checking, formal methods, formal logic, machine learning, formal languages and automata theory, models of computation, semantics and reasoning, software engineering, theory and algorithms for application domains, thema EDItEUR::U Computing and Information Technology::UM Computer programming / software engineering::UMZ Software Engineering, thema EDItEUR::U Computing and Information Technology::UY Computer science::UYA Mathematical theory of computation, thema EDItEUR::U Computing and Information Technology::UY Computer science::UYQ Artificial intelligence::UYQE Expert systems / knowledge-based systems, thema EDItEUR::U Computing and Information Technology::UM Computer programming / software engineering::UMX Programming and scripting languages: general, thema EDItEUR::U Computing and Information Technology::UK Computer hardware, thema EDItEUR::U Computing and Information Technology::UY Computer science::UYQ Artificial intelligence::UYQL Natural language and machine translation

Περιγραφή αρχείου: application/pdf

Relation: Lecture Notes in Computer Science; ONIX_20240913_9783031711770_29

Διαθεσιμότητα: https://library.oapen.org/handle/20.500.12657/93255
https://hdl.handle.net/20.500.12657/93255
https://link.springer.com/978-3-031-71177-0