Výsledky vyhľadávania - "Sublinear time algorithms"

Estimating Euclidean Distance to Linearity

Autori: Bogdanov, Andrej Taschin, Lorenzo Andrej Bogdanov and Lorenzo Taschin

Prispievatelia: Bogdanov, Andrej Taschin, Lorenzo Andrej Bogdanov and Lorenzo Taschin

Predmety: statistical estimation, sublinear-time algorithms, regression, property testing, ddc:004, analysis of boolean functions

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2025.20

Random Local Access for Sampling k-SAT Solutions

Autori: Dong, Dingding Mani, Nitya Dingding Dong and Nitya Mani

Prispievatelia: Dong, Dingding Mani, Nitya Dingding Dong and Nitya Mani

Predmety: sublinear time algorithms, random generation, k-SAT, local computation

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 341, 28th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2025.13

Dostupnosť: https://doi.org/10.4230/LIPIcs.SAT.2025.13
https://nbn-resolving.org/urn:nbn:de:0030-drops-237474
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2025.13

Sublinear time approximation schemes for makespan minimization on parallel machines

Autori: Fu, Bin Huo, Yumei Zhao, Hairong

Zdroj: Computer Science Faculty Publications and Presentations

Predmety: Makespan minimization, Parallel machine, Sublinear time algorithms, Uniform sampling, Precedence constraints, Computer Sciences

Popis súboru: application/pdf

Relation: https://scholarworks.utrgv.edu/cs_fac/117; https://rdcu.be/exmJP

Dostupnosť: https://scholarworks.utrgv.edu/cs_fac/117
https://doi.org/10.1007/s00186-025-00898-z
https://rdcu.be/exmJP

Random local access for sampling k-SAT solutions

Autori: Dong, Dingding Mani, Nitya Dingding Dong and Nitya Mani

Prispievatelia: Dong, Dingding Mani, Nitya Dingding Dong and Nitya Mani

Predmety: FOS: Computer and information sciences, Data Structures and Algorithms, Discrete Mathematics (cs.DM), Discrete Mathematics, local computation, random generation, Data Structures and Algorithms (cs.DS), sublinear time algorithms, ddc:004, k-SAT

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2409.03951
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2025.13

Differential privacy and Sublinear time are incompatible sometimes

Autori: Blocki, Jeremiah Fichtenberger, Hendrik Grigorescu, Elena a ďalší

Prispievatelia: Blocki, Jeremiah Fichtenberger, Hendrik Grigorescu, Elena a ďalší

Predmety: one-way marginals, FOS: Computer and information sciences, sublinear algorithms, lower bounds, Computer Science - Cryptography and Security, differential privacy, Computer Science - Data Structures and Algorithms, sublinear-time algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Cryptography and Security (cs.CR)

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2407.07262
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2025.19

Edge sampling and graph parameter estimation via vertex neighborhood accesses

Autori: Tetek, Jakub Thorup, Mikkel Leonardi, Stefano a ďalší

Prispievatelia: Tetek, Jakub Thorup, Mikkel Leonardi, Stefano a ďalší

Zdroj: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. :1116-1129

Predmety: FOS: Computer and information sciences, Edge sampling, Sublinear-time algorithms, Computer Science - Data Structures and Algorithms, Triangle counting, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Edge counting

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2107.03821

Lyndon Arrays in Sublinear Time

Autori: Bannai, Hideo Ellert, Jonas Hideo Bannai and Jonas Ellert

Prispievatelia: Bannai, Hideo Ellert, Jonas Hideo Bannai and Jonas Ellert

Predmety: lookup tables, Lyndon table, word packing, Lyndon forest, tabulation, word RAM algorithms, sublinear time algorithms, ddc:004, periodicity, Lyndon array

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.14

Bias Reduction for Sum Estimation

Autori: Eden, Talya Houen, Jakob Bæk Tejs Narayanan, Shyam a ďalší

Prispievatelia: Eden, Talya Houen, Jakob Bæk Tejs Narayanan, Shyam a ďalší

Predmety: bias reduction, sum estimation, sublinear time algorithms, sample complexity

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 275, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.62

Dostupnosť: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.62
https://nbn-resolving.org/urn:nbn:de:0030-drops-188872
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.62

Sublinear-Time Opinion Estimation in the Friedkin - Johnsen Model

Autori: Neumann, Stefan Dong, Yinhao Peng, Pan

Zdroj: WWW 2024 - Proceedings of the ACM Web Conference. :2563-2571

Predmety: friedkin - johnsen model, opinion formation, social-network analysis, sublinear time algorithms

Popis súboru: print

Prístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-347329

Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs

Autori: Eden, Talya Ron, Dana Rosenbaum, Will a ďalší

Prispievatelia: Eden, Talya Ron, Dana Rosenbaum, Will a ďalší

Predmety: sublinear time algorithms, graph algorithms, cliques, arboricity, uniform sampling

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.56

Dostupnosť: https://doi.org/10.4230/LIPIcs.ICALP.2022.56
https://nbn-resolving.org/urn:nbn:de:0030-drops-163974
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.56

Asymptotically Optimal Bounds for Estimating H-Index in Sublinear Time with Applications to Subgraph Counting

Autori: Assadi, Sepehr Nguyen, Hoai-An Sepehr Assadi and Hoai-An Nguyen

Prispievatelia: Assadi, Sepehr Nguyen, Hoai-An Sepehr Assadi and Hoai-An Nguyen

Predmety: Sublinear time algorithms, h-index, asymptotically optimal bounds, lower bounds, subgraph counting

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 245, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.48

Dostupnosť: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.48
https://nbn-resolving.org/urn:nbn:de:0030-drops-171708
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.48

Bias Reduction for Sum Estimation

Autori: Eden, Talya Houen, Jakob Bæk Tejs Narayanan, Shyam a ďalší

Prispievatelia: Eden, Talya Houen, Jakob Bæk Tejs Narayanan, Shyam a ďalší

Zdroj: Eden, T, Tejs Houen, J B, Narayanan, S, Rosenbaum, W & Tětek, J 2023, Bias Reduction for Sum Estimation . in N Megow & A Smith (eds), Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023 ., 62, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Leibniz International Proceedings in Informatics, LIPIcs, vol. 275, pp. 1-21, 26th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2023 and the 27th International Conference on Randomization and Computation, RANDOM 2023, Atlanta, United States, 11/09/2023 . https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.62

Predmety: FOS: Computer and information sciences, sample complexity, sum estimation, Mathematics - Statistics Theory, sublinear time algorithms, 0102 computer and information sciences, 02 engineering and technology, Statistics Theory (math.ST), Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, bias reduction, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, Data Structures and Algorithms (cs.DS), ddc:004

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2208.01197
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.62
https://curis.ku.dk/ws/files/382559692/Bias_Reduction_for_Sum_Estimation.pdf

An adaptivity hierarchy theorem for property testing

Autori: Canonne, Clément L. Gur, Tom Clément L. Canonne and Tom Gur a ďalší

Prispievatelia: Canonne, Clément L. Gur, Tom Clément L. Canonne and Tom Gur a ďalší

Zdroj: computational complexity. 27:671-716

Predmety: FOS: Computer and information sciences, Computer Science - Machine Learning, Hierarchy Theorems, sublinear-time algorithms, complexity theory, property testing, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Property Testing, QA76, Machine Learning (cs.LG), Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), ddc:004, Coding Theory

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2017/7516/pdf/LIPIcs-CCC-2017-27.pdf
http://arxiv.org/abs/1702.05678
http://wrap.warwick.ac.uk/116109/1/WRAP-adaptivity-hierarchy-therorem-property-testing-Gur-2017.pdf
https://dblp.uni-trier.de/db/journals/cc/cc27.html#CanonneG18
https://link.springer.com/10.1007/s00037-018-0168-4
https://link.springer.com/article/10.1007/s00037-018-0168-4
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.27
https://www.repository.cam.ac.uk/handle/1810/362904
https://doi.org/10.4230/lipics.ccc.2017.27

Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time

Autori: Biswas, Amartya Shankha Eden, Talya Rubinfeld, Ronitt a ďalší

Prispievatelia: Biswas, Amartya Shankha Eden, Talya Rubinfeld, Ronitt a ďalší

Predmety: Sublinear time algorithms, Graph algorithms, Sampling subgraphs, Approximate counting

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 207, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.55

Dostupnosť: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.55
https://nbn-resolving.org/urn:nbn:de:0030-drops-147480
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.55

Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions

Autori: Assadi, Sepehr Wang, Chen Sepehr Assadi and Chen Wang

Prispievatelia: Assadi, Sepehr Wang, Chen Sepehr Assadi and Chen Wang

Predmety: FOS: Computer and information sciences, Computer Science - Machine Learning, Sublinear time Algorithms, Correlation Clustering, Computer Science - Data Structures and Algorithms, Sublinear Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, ddc:004, Semi-streaming Algorithms, 01 natural sciences, Machine Learning (cs.LG)

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2109.14528
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.10

Local Access to Random Walks

Autori: Biswas, Amartya Shankha Pyne, Edward Rubinfeld, Ronitt a ďalší

Prispievatelia: Biswas, Amartya Shankha Pyne, Edward Rubinfeld, Ronitt a ďalší

Predmety: FOS: Computer and information sciences, local computation, Computer Science - Data Structures and Algorithms, random generation, Data Structures and Algorithms (cs.DS), sublinear time algorithms, 0102 computer and information sciences, ddc:004, 01 natural sciences

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2102.07740
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.24

Learning and Testing Variable Partitions

Autori: Bogdanov, Andrej Wang, Baoxiang Andrej Bogdanov and Baoxiang Wang

Prispievatelia: Bogdanov, Andrej Wang, Baoxiang Andrej Bogdanov and Baoxiang Wang

Predmety: partitioning, agnostic learning, property testing, sublinear-time algorithms, hypergraph cut, reinforcement learning

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 151, 11th Innovations in Theoretical Computer Science Conference (ITCS 2020); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.37

Dostupnosť: https://doi.org/10.4230/LIPIcs.ITCS.2020.37
https://nbn-resolving.org/urn:nbn:de:0030-drops-117221
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.37

Local Access to Huge Random Objects Through Partial Sampling

Autori: Biswas, Amartya Shankha Rubinfeld, Ronitt Yodpinyanee, Anak a ďalší

Prispievatelia: Biswas, Amartya Shankha Rubinfeld, Ronitt Yodpinyanee, Anak a ďalší

Predmety: sublinear time algorithms, random generation, local computation

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 151, 11th Innovations in Theoretical Computer Science Conference (ITCS 2020); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.27

Dostupnosť: https://doi.org/10.4230/LIPIcs.ITCS.2020.27
https://nbn-resolving.org/urn:nbn:de:0030-drops-117126
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.27

Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time

Autori: Fichtenberger, Hendrik Gao, Mingze Peng, Pan a ďalší

Prispievatelia: Fichtenberger, Hendrik Gao, Mingze Peng, Pan a ďalší

Predmety: FOS: Computer and information sciences, Sublinear-time algorithms, Graph sampling, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, ddc:004, Graph algorithms, 01 natural sciences

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2005.01861
https://dblp.uni-trier.de/db/journals/corr/corr2005.html#abs-2005-01861
https://eprints.whiterose.ac.uk/160271/
https://drops.dagstuhl.de/opus/volltexte/2020/12452/pdf/LIPIcs-ICALP-2020-45.pdf/
https://doi.org/10.4230/LIPIcs.ICALP.2020.45
https://drops.dagstuhl.de/opus/volltexte/2020/12452/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.45

The Arboricity Captures the Complexity of Sampling Edges

Autori: Eden, Talya Ron, Dana Rosenbaum, Will a ďalší

Prispievatelia: Eden, Talya Ron, Dana Rosenbaum, Will a ďalší

Predmety: sampling, graph algorithms, arboricity, sublinear-time algorithms

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.52

Dostupnosť: https://doi.org/10.4230/LIPIcs.ICALP.2019.52
https://nbn-resolving.org/urn:nbn:de:0030-drops-106287
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.52