Suchergebnisse - Theory of computation → Online algorithms
-
1
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Proceedings of the 24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2021
Schlagwörter: variable vertex capacities, b-matching, Online algorithms, primal-dual analysis, configuration LP, ddc:004, unweighted matching, Theory of computation → Online algorithms, Article, Primal-dual analysis, Configuration LP, vertex-weighted matching, ddc
Dateibeschreibung: application/pdf
Zugangs-URL: https://dblp.uni-trier.de/db/conf/approx/approx2021.html#AlbersS21
https://drops.dagstuhl.de/opus/volltexte/2021/14695/pdf/LIPIcs-APPROX2.pdf/
https://drops.dagstuhl.de/opus/volltexte/2021/14695/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.2
https://mediatum.ub.tum.de/doc/1774126/document.pdf -
2
Autoren: et al.
Weitere Verfasser: et al.
Quelle: ACM Transactions on Algorithms. 20:1-29
Schlagwörter: FOS: Computer and information sciences, online algorithms, online scheduling, 0102 computer and information sciences, 02 engineering and technology, Theory of computation → Online algorithms, 01 natural sciences, QA76, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), ddc:004, F.2.2, longest queue drop, buffer management
Dateibeschreibung: application/pdf
Zugangs-URL: http://arxiv.org/abs/2012.03906
http://wrap.warwick.ac.uk/154061/1/WRAP-breaking-barrier-2-competitiveness-longest-queue-drop-Englert-2021.pdf
https://research.utwente.nl/en/publications/39259b40-5ba5-487a-acd7-6302d453b99d
https://doi.org/10.4230/LIPIcs.ICALP.2021.17
https://drops.dagstuhl.de/opus/volltexte/2021/14086/pdf/LIPIcs-ICALP-2021-17.pdf/
https://drops.dagstuhl.de/opus/volltexte/2021/14086/
https://dblp.uni-trier.de/db/journals/corr/corr2012.html#abs-2012-03906
https://arxiv.org/abs/2012.03906
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.17 -
3
Autoren:
Weitere Verfasser:
Schlagwörter: FOS: Computer and information sciences, Online computation, phrases Online computation Rényi-Ulam games query models beyond worst-case analysis, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), [INFO] Computer Science [cs], ddc:004, beyond worst-case analysis, Theory of computation → Online algorithms, phrases Online computation, query models, Rényi-Ulam games
Dateibeschreibung: application/pdf
-
4
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 289, 20 pages (2024). doi:10.4230/LIPICS.STACS.2024.37
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov41. International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, 2024-03-11-2024-03-14Schlagwörter: Simple Knapsack, Predictions, Online problem, Machine-Learned Advice, ddc:004, Theory of computation → Online algorithms
Dateibeschreibung: application/pdf
-
5
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Leibniz International Proceedings in Informatics (LIPIcs), 274
31st Annual European Symposium on Algorithms (ESA 2023)Schlagwörter: FOS: Computer and information sciences, Competitive analysis, Theory of computation → Design and analysis of algorithms, Online algorithms, TSP, Learning-augmented algorithms, Algorithms with predictions, [INFO] Computer Science [cs], Theory of computation → Online algorithms, Computer Science - Data Structures and Algorithms, Theory of computation → Parameterized complexity and exact algorithms, Data Structures and Algorithms (cs.DS), ddc:004
Dateibeschreibung: application/pdf; application/application/pdf
-
6
-
7
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Applied computing → Online auctions, Online matching, Karp-Vazirani-Vazirani, online matching, Karp-Vazirani-Vazirani, truthfulness, ddc:004, Theory of computation → Online algorithms, truthfulness
Dateibeschreibung: application/pdf
Zugangs-URL: https://dare.uva.nl/personal/pure/en/publications/truthful-matching-with-
online -items-and-offline-agents(e6458cbb-50d0-4ee3-8997-3f0363fb388b).html
https://hdl.handle.net/11245.1/e6458cbb-50d0-4ee3-8997-3f0363fb388b
https://doi.org/10.4230/LIPIcs.ICALP.2023.58
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.58
https://hdl.handle.net/11573/1684994
https://doi.org/10.4230/lipics.icalp.2023.58 -
8
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Abrahamsen, M & Beretta, L 2021, Online packing to minimize area or perimeter . in K Buchin & E C de Verdiere (eds), 37th International Symposium on Computational Geometry, SoCG 2021 ., 6, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, LIPIcs, vol. 189, 37th International Symposium on Computational Geometry, SoCG 2021, Virtual, Buffalo, United States, 07/06/2021 . https://doi.org/10.4230/LIPIcs.SoCG.2021.6
Abrahamsen, M & Beretta, L 2021, Online packing to minimize area or perimeter . in K Buchin & E C de Verdiere (eds), 37th International Symposium on Computational Geometry, SoCG 2021 ., 6, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, LIPIcs, vol. 189, 37th International Symposium on Computational Geometry, SoSchlagwörter: Computational Geometry (cs.CG), FOS: Computer and information sciences, online algorithms, Theory of computation → Computational geometry, Online algorithms, 0102 computer and information sciences, Theory of computation → Online algorithms, 01 natural sciences, Theory of computation → Packing and covering problems, Packing, Computer Science - Computational Geometry, ddc:004, 0101 mathematics
Dateibeschreibung: application/pdf
Zugangs-URL: http://arxiv.org/abs/2101.09024
https://arxiv.org/abs/2101.09024
https://drops.dagstuhl.de/opus/volltexte/2021/13805/
https://dblp.uni-trier.de/db/journals/corr/corr2101.html#abs-2101-09024
https://drops.dagstuhl.de/opus/volltexte/2021/13805/pdf/LIPIcs-SoCG-2021-6.pdf/
https://cse.buffalo.edu/socg21/accepted.html#26
https://doi.org/10.4230/LIPIcs.SoCG.2021.6
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.6
https://curis.ku.dk/ws/files/273638588/Online_Packing_to_Minimize_Area_or_Perimeter.pdf -
9
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611976465
Schlagwörter: FOS: Computer and information sciences, F.1.2, H.2.4, cs.DB, log-structured merge-tree, Information systems → Data management systems, 68P15, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 01 natural sciences, CCS Concepts, Computer Science - Databases, 68W27, 68P15, 68R05, data-structure dynamization, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, competitive analysis, Data Structures and Algorithms (cs.DS), compaction ACM Reference format, Applied computing → Enterprise computing infrastructures, Online algorithms, Databases (cs.DB), Theory of computation → Online algorithms, 68R05, 68W27, cs.DS
Dateibeschreibung: application/pdf
-
10
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024). Leibniz International Proceedings in Informatics (LIPIcs)
Mathematical Foundations of Computer Science (MFCS)
https://hal.science/hal-04818742
Mathematical Foundations of Computer Science (MFCS), Aug 2024, Bratislava, Slovakia. pp.1-16, ⟨10.4230/LIPIcs.MFCS.2024.19⟩Schlagwörter: 2012 ACM Subject Classification Theory of computation → Online algorithms Theory of computation → Graph algorithms analysis Mathematics of computing → Graph algorithms phrases Canadian Traveller Problem, Online algorithms, Competitive analysis, Outerplanar graphs, 2012 ACM Subject Classification Theory of computation → Online algorithms, Theory of computation → Graph algorithms analysis, Mathematics of computing → Graph algorithms phrases Canadian Traveller Problem, Canadian Traveller Problem, Theory of computation → Online algorithms, Mathematics of computing → Graph algorithms, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
Geographisches Schlagwort: Bratislava, Slovakia
-
11
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Algorithmica
45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)Schlagwörter: FOS: Computer and information sciences, Combinatorial optimization, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, probabilistic analysis, Theory of computation → Online algorithms, 01 natural sciences, Article, Computer Science - Data Structures and Algorithms, Online algorithms, streaming algorithms, Analysis of algorithms, Data Structures and Algorithms (cs.DS), Online bin packing, ddc:004, online bin packing, random arrival order
Dateibeschreibung: application/xml; application/pdf
Zugangs-URL: https://link.springer.com/content/pdf/10.1007/s00453-021-00844-5.pdf
https://pubmed.ncbi.nlm.nih.gov/34776569
http://arxiv.org/abs/2012.00511
https://zbmath.org/7390203
https://doi.org/10.1007/s00453-021-00844-5
https://arxiv.org/abs/2012.00511
http://arxiv-export3.library.cornell.edu/abs/2012.00511v1
https://dblp.uni-trier.de/db/journals/corr/corr2012.html#abs-2012-00511
https://drops.dagstuhl.de/opus/volltexte/2020/12730/
https://drops.dagstuhl.de/opus/volltexte/2020/12730/pdf/LIPIcs-MFCS-2020-7.pdf/
https://link.springer.com/article/10.1007/s00453-021-00844-5
https://paperity.org/p/267042870/best-fit-bin-packing-with-random-order-revisited
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica83.html#AlbersKL21a
https://link.springer.com/content/pdf/10.1007/s00453-021-00844-5.pdf
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.7 -
12
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Algorithmica
47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)Schlagwörter: FOS: Computer and information sciences, Scheduling, makespan minimization, 0211 other engineering and technologies, random-order, 0102 computer and information sciences, 02 engineering and technology, Theory of computation → Online algorithms, 01 natural sciences, Article, ddc, online algorithm, 13. Climate action, Computer Science - Data Structures and Algorithms, competitive analysis, Data Structures and Algorithms (cs.DS), ddc:004, lower bound
Dateibeschreibung: application/pdf
Zugangs-URL: https://link.springer.com/content/pdf/10.1007/s00453-021-00841-8.pdf
https://pubmed.ncbi.nlm.nih.gov/34720298
http://arxiv.org/abs/2006.00386
https://dblp.uni-trier.de/db/conf/icalp/icalp2020.html#AlbersJ20
https://doi.org/10.4230/LIPIcs.ICALP.2020.68
https://drops.dagstuhl.de/opus/volltexte/2020/12475/pdf/LIPIcs-ICALP-2020-68.pdf/
https://drops.dagstuhl.de/opus/volltexte/2020/12475/
https://link.springer.com/article/10.1007/s00453-021-00841-8
https://link.springer.com/content/pdf/10.1007/s00453-021-00841-8.pdf
https://dblp.uni-trier.de/db/journals/corr/corr2006.html#abs-2006-00386
https://mediatum.ub.tum.de/1616856
https://link.springer.com/10.1007/s00453-021-00841-8
https://europepmc.org/article/MED/34720298
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.68
https://mediatum.ub.tum.de/doc/1616856/document.pdf -
13
Autoren: et al.
Weitere Verfasser: et al.
Quelle: ITCS 2024 - 15th Innovations in Theoretical Computer Science Conference ; https://hal.science/hal-04691075 ; ITCS 2024 - 15th Innovations in Theoretical Computer Science Conference, Jan 2024, Berkeley, CA, United States. ⟨10.4230/LIPIcs.ITCS.2024.35⟩
Schlagwörter: Collective exploration, Online algorithms, Evolving tree, Competitive analysis, Theory of computation → Online algorithms, Mathematics of computing → Graph algorithms, [INFO]Computer Science [cs]
Geographisches Schlagwort: Berkeley, CA, United States
-
14
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Leibniz International Proceedings in Informatics (LIPIcs), 187
38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)
arXiv
Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik [16:1]-16:18 (2021). doi:10.4230/LIPICS.STACS.2021.16
38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021) / Herausgeber: Markus Bläser, Benjamin Monmege
38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021) / Herausgeber: Markus Bläser, Benjamin Monmege38. International Symposium on Theoretical Aspects of Computer Science, STACS 2021, online, 2021-03-16-2021-03-19Schlagwörter: Online problem, Simple knapsack, Reservation costs, ddc:004, Theory of computation → Online algorithms
Dateibeschreibung: application/pdf; application/application/pdf
Zugangs-URL: https://arxiv.org/abs/2009.14043
https://dblp.uni-trier.de/db/journals/corr/corr2009.html#abs-2009-14043
https://drops.dagstuhl.de/opus/volltexte/2021/13661/
https://drops.dagstuhl.de/opus/volltexte/2021/13661/pdf/LIPIcs-STACS-2021-16.pdf/
https://www.research-collection.ethz.ch/handle/20.500.11850/495034
https://arxiv.org/pdf/2009.14043
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.16
http://hdl.handle.net/20.500.11850/495034
http://hdl.handle.net/20.500.11850/465681
https://publications.rwth-aachen.de/record/816354 -
15
Autoren: et al.
Quelle: Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik [16:1]-16:18 (2021). doi:10.4230/LIPICS.STACS.2021.16 ; 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021) / Herausgeber: Markus Bläser, Benjamin Monmege ; 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021) / Herausgeber: Markus Bläser, Benjamin Monmege 38. International Symposium on Theoretical Aspects of Computer Science, STACS 2021, online, 2021-03-16 - 2021-03-19
Schlagwörter: Online problem, Reservation costs, Simple knapsack, Theory of computation → Online algorithms
Geographisches Schlagwort: DE
Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000635691700016; info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-180-1
-
16
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 289, 18, [1]-17 (2024). doi:10.4230/LIPIcs.STACS.2024.18
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov41. International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, 2024-03-11-2024-03-14Schlagwörter: FOS: Computer and information sciences, Advice Applications, 0211 other engineering and technologies, Multiple Knapsack, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), Theory of computation → Online algorithms, 01 natural sciences, Removable Online Knapsack, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Advice Analysis, Machine Learning and AI, Data Structures and Algorithms (cs.DS), ddc:004
Dateibeschreibung: application/pdf
-
17
Autoren:
Weitere Verfasser:
Schlagwörter: FOS: Computer and information sciences, Competitive analysis, online algorithms, collective exploration, Mathematics of computing → Graph algorithms, Online algorithms, [INFO] Computer Science [cs], Theory of computation → Online algorithms, evolving tree, Computer Science - Data Structures and Algorithms, competitive analysis, Computer Science - Multiagent Systems, Data Structures and Algorithms (cs.DS), ddc:004, Evolving tree, Collective exploration, Multiagent Systems (cs.MA)
Dateibeschreibung: application/pdf
-
18
Autoren:
Weitere Verfasser:
Schlagwörter: consistency and robustness, Search problems, Computer Science - Data Structures and Algorithms, competitive ratio, line and star search, Theory of computation → Theory and algorithms for application domains, [INFO] Computer Science [cs], ddc:004, predictions, Theory of computation → Online algorithms
Dateibeschreibung: application/pdf
-
19
Autoren: et al.
Schlagwörter: Theory of computation – online algorithms
-
20
Autoren: et al.
Weitere Verfasser: et al.
Quelle: EC 2025 - 26th ACM Conference on Economics and Computation ; https://hal.science/hal-05225654 ; EC 2025 - 26th ACM Conference on Economics and Computation, Jul 2025, Stanford, United States. pp.189-205, ⟨10.1145/3736252.3742518⟩
Schlagwörter: Interdependent Valuations, Combinatorial Auctions, Online Algorithms, CCS Concepts: • Theory of computation → Theory and algorithms for application domains, Algorithmic game theory and mechanism design, [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT]
Geographisches Schlagwort: Stanford, United States
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2507.23500; ARXIV: 2507.23500
Full Text Finder 
Nájsť tento článok vo Web of Science