Suchergebnisse - "Theory of computation → Theory and algorithms for application domains"

Dynamic Debt Swapping in Financial Networks

Autoren: Froese, Henri Hoefer, Martin Wilhelmi, Lisa et al.

Weitere Verfasser: Froese, Henri Hoefer, Martin Wilhelmi, Lisa et al.

Quelle: Saarbrücken/Wadern, : Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Leibniz international proceedings in informatics 330, 2:[1]-2:16 (2025). doi:10.4230/LIPICS.SAND.2025.2
4th Symposium on Algorithmic Foundations of Dynamic Networks : SAND 2025, June 9–11, 2025, Liverpool, GB / Edited by Kitty Meeks, Christian Scheideler
4th Symposium on Algorithmic Foundations of Dynamic Networks : SAND 2025, June 9–11, 2025, Liverpool, GB / Edited by Kitty Meeks, Christian Scheideler4. Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2025, Liverpool, UK, 2025-06-09-2025-06-11

Schlagwörter: Financial Networks, Debt Swap, Local Search, ddc:004, Networks → Network algorithms, Theory of computation → Theory and algorithms for application domains

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.2
https://publications.rwth-aachen.de/record/1018317

Online Combinatorial Allocation with Interdependent Values

Autoren: Feldman, Michal Mauras, Simon Mohan, Divyarthi et al.

Weitere Verfasser: Feldman, Michal Mauras, Simon Mohan, Divyarthi 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

Verfügbarkeit: https://hal.science/hal-05225654
https://hal.science/hal-05225654v1/document
https://hal.science/hal-05225654v1/file/3736252.3742518.pdf
https://doi.org/10.1145/3736252.3742518

What killed the cat? Towards a logical formalization of curiosity (and suspense, and surprise) in narratives

Autoren: Dupin de Saint-Cyr, Florence Bosser, Anne-Gwenn Callac, Benjamin et al.

Weitere Verfasser: Dupin de Saint-Cyr, Florence Bosser, Anne-Gwenn Callac, Benjamin et al.

Quelle: LIPIcs ; 31st International Symposium on Temporal Representation and Reasoning (TIME 2024) ; https://hal.science/hal-04731383 ; 31st International Symposium on Temporal Representation and Reasoning (TIME 2024), Oct 2024, Montpellier, France. pp.10:1-10:16, ⟨10.4230/LIPIcs.TIME.2024.10⟩

Schlagwörter: Theory of computation → Theory and algorithms for application domains, Cognition, Narration, Knowledge Representation, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]

Geographisches Schlagwort: Montpellier, France

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2410.08597; ARXIV: 2410.08597

Verfügbarkeit: https://hal.science/hal-04731383
https://hal.science/hal-04731383v1/document
https://hal.science/hal-04731383v1/file/draftTime2024.pdf
https://doi.org/10.4230/LIPIcs.TIME.2024.10

A Sweep-plane Algorithm for Calculating the Isolation of Mountains

Autoren: Funke, Daniel Hüning, Nicolai Sanders, Peter et al.

Weitere Verfasser: Funke, Daniel Hüning, Nicolai Sanders, Peter et al.

Schlagwörter: Computational Geometry (cs.CG), FOS: Computer and information sciences, sweepline algorithms, 4. Education, Theory of computation → Theory and algorithms for application domains, 15. Life on land, Geo-information systems, 13. Climate action, Computer Science - Data Structures and Algorithms, computational geometry, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), 14. Life underwater, ddc:004

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2305.08470
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.51

Competitive Search in the Line and the Star with Predictions

Autoren: Angelopoulos, Spyros Spyros Angelopoulos

Weitere Verfasser: Angelopoulos, Spyros Spyros Angelopoulos

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

Zugangs-URL: http://arxiv.org/abs/2312.17539
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.12
https://hal.science/hal-04248709v1
https://doi.org/10.4230/lipics.mfcs.2023.12
https://hal.science/hal-04248709v1/document

Playing Guess Who with Your Kids

Autoren: Paz, Ami Peterfreund, Liat Systèmes Parallèles - LISN (ParSys) et al.

Weitere Verfasser: Paz, Ami Peterfreund, Liat Systèmes Parallèles - LISN (ParSys) et al.

Quelle: FUN'22 - 11th International Conference on Fun with Algorithms ; https://hal.science/hal-04288778 ; FUN'22 - 11th International Conference on Fun with Algorithms, May 2022, Favignana, Italy. ⟨10.4230/LIPIcs.FUN.2022.23⟩

Schlagwörter: Guess Who?, Binary Search, Error Correcting Codes, Erasure Codes, Theory of computation → Representations of games and their complexity, Theory of computation → Sorting and searching, Theory of computation → Theory and algorithms for application domains, [INFO]Computer Science [cs], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]

Geographisches Schlagwort: Favignana, Italy

Verfügbarkeit: https://hal.science/hal-04288778
https://hal.science/hal-04288778v1/document
https://hal.science/hal-04288778v1/file/LIPIcs.FUN.2022.23.pdf
https://doi.org/10.4230/LIPIcs.FUN.2022.23

Leximax Approximations and Representative Cohort Selection

Autoren: Henzinger, Monika Peale, Charlotte Reingold, Omer et al.

Weitere Verfasser: Henzinger, Monika Peale, Charlotte Reingold, Omer et al.

Schlagwörter: FOS: Computer and information sciences, cohort selection, 4. Education, leximin, fairness, 0102 computer and information sciences, 02 engineering and technology, Theory of computation → Theory and algorithms for application domains, 01 natural sciences, 3. Good health, 102031 Theoretische Informatik, maxmin, Computer Science - Computers and Society, 102031 Theoretical computer science, Computer Science - Data Structures and Algorithms, Computers and Society (cs.CY), 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), ddc:004, 10. No inequality

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2205.01157
https://ucrisportal.univie.ac.at/de/publications/571d7784-a94f-441f-86d2-e27afec0a0d7
https://doi.org/10.4230/LIPIcs.FORC.2022.2
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2022.2

On Fairness and Stability in Two-Sided Matchings

Autoren: Karni, Gili Rothblum, Guy N. Yona, Gal et al.

Weitere Verfasser: Karni, Gili Rothblum, Guy N. Yona, Gal et al.

Schlagwörter: FOS: Computer and information sciences, 02 engineering and technology, Theory of computation → Theory and algorithms for application domains, algorithmic fairness, 01 natural sciences, 3. Good health, Computer Science - Computers and Society, Computer Science - Computer Science and Game Theory, Computer Science - Data Structures and Algorithms, Computers and Society (cs.CY), 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), ddc:004, 0101 mathematics, Computer Science and Game Theory (cs.GT)

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2111.10885
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.92

Terrain prickliness: theoretical grounds for high complexity viewsheds

Autoren: Acharyya, Ankush Jallu, Ramesh Löffler, Maarten et al.

Weitere Verfasser: Acharyya, Ankush Jallu, Ramesh Löffler, Maarten et al.

Quelle: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
11th International Conference on Geographic Information Science (GIScience 2021)-Part II

Schlagwörter: Viewshed complexity, Classificació AMS::68 Computer science::68U Computing methodologies and applications, Matemàtiques i estadística::Matemàtica aplicada a les ciències [Àrees temàtiques de la UPC], Theory of computation → Theory and algorithms for application domains, Computing methodologies, Triangulated irregular network, Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica aplicada a les ciències, Informàtica, Polyhedral Terrain, Visibility, Digital elevation model, 68 Computer science::68U Computing methodologies and applications [Classificació AMS], ddc:004

Dateibeschreibung: application/pdf

Zugangs-URL: https://research-portal.uu.nl/en/publications/6825fa18-3046-4233-b1bf-1100959069a0
https://doi.org/10.4230/LIPIcs.GIScience.2021.II.10
https://dblp.uni-trier.de/db/journals/corr/corr2103.html#abs-2103-06696
https://drops.dagstuhl.de/opus/volltexte/2021/14769/pdf/LIPIcs-GIScience-2021-II-10.pdf/
https://drops.dagstuhl.de/opus/volltexte/2021/14769/
https://dblp.uni-trier.de/db/conf/giscience/giscience2021-2.html#AcharyyaJLMSSS21
https://arxiv.org/abs/2103.06696
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2021.II.10
http://hdl.handle.net/11104/0324652
https://dspace.library.uu.nl/handle/1874/423338

Conjunctive queries with inequalities under updates

Autoren: Idris, Muhammad Ugarte, Martín Vansummeren, Stijn et al.

Quelle: Proceedings of the VLDB Endowment. 11:733-745

Schlagwörter: ddc:004, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Theory of computation, Theory and algorithms for application domains, Database theory, Database query processing and optimization (theory), 01 natural sciences, Rechentheorie, Theorie und Algorithmen für Anwendungsbereiche, Datenbanktheorie, Verarbeitung und Optimierung von Datenbankabfragen (Theorie)

Zugangs-URL: https://tud.qucosa.de/api/qucosa%3A33726/attachment/ATT-0/
http://www.vldb.org/pvldb/vol11/p733-idris.pdf
https://dl.acm.org/doi/10.14778/3192965.3192966
https://difusion.ulb.ac.be/vufind/Record/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/279063/Details
http://dblp.uni-trier.de/db/journals/pvldb/pvldb11.html#IdrisUVVL18
https://dblp.uni-trier.de/db/journals/pvldb/pvldb11.html#IdrisUVVL18
https://tud.qucosa.de/id/qucosa:79472
https://tud.qucosa.de/api/qucosa:79472/attachment/ATT-0/

Model-based integration of past & future in TimeTravel

Autoren: Khalefa, Mohamed E. Fischer, Ulrike Pedersen, Torben Bach et al.

Quelle: Khalefa, M E, Fischer, U, Pedersen, T B & Lehner, W 2012, 'Model-based Integration of Past & Future in TimeTravel', Proceedings of the VLDB Endowment, bind 5, nr. 12, s. 1974-1977. < http://vldb.org/pvldb/vol5/p1974_mohamedekhalefa_vldb2012.pdf >

Schlagwörter: ddc:004, Theorie des Datenrechnens, Theorie und Algorithmen für Anwendungsdomänen, Datenbanktheorie, Datenbankabfrageverarbeitung und -optimierung (Theorie), 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, Theory of computation, Theory and algorithms for application domains, Database theory, Database query processing and optimization (theory)

Zugangs-URL: http://vldb.org/pvldb/vol5/p1974_mohamedekhalefa_vldb2012.pdf
https://vbn.aau.dk/da/publications/6db969b9-6da2-4aa2-8e97-a9c056fc6d10
http://www.scopus.com/inward/record.url?scp=84872912230&partnerID=8YFLogxK
https://vbn.aau.dk/en/publications/modelbased-integration-of-past--future-in-timetravel(6db969b9-6da2-4aa2-8e97-a9c056fc6d10).html
https://vbn.aau.dk/en/publications/model-based-integration-of-past-amp-future-in-timetravel
https://dblp.uni-trier.de/db/journals/pvldb/pvldb5.html#KhalefaFPL12
https://vldb.org/pvldb/vol5/p1974_mohamedekhalefa_vldb2012.pdf
http://dblp.uni-trier.de/db/journals/pvldb/pvldb5.html#KhalefaFPL12
https://dl.acm.org/doi/10.14778/2367502.2367551
https://tud.qucosa.de/id/qucosa:81154
https://tud.qucosa.de/api/qucosa:81154/attachment/ATT-0/

Estimation of substitution and indel rates via k -mer statistics.

Autoren: Hera MR Medvedev P Koslicki D et al.

Quelle: BioRxiv : the preprint server for biology [bioRxiv] 2025 Jul 27. Date of Electronic Publication: 2025 Jul 27.

Publikationsart: Journal Article; Preprint

Info zur Zeitschrift: Country of Publication: United States NLM ID: 101680187 Publication Model: Electronic Cited Medium: Internet ISSN: 2692-8205 (Electronic) Linking ISSN: 26928205 NLM ISO Abbreviation: bioRxiv Subsets: PubMed not MEDLINE