Machine Learning and Knowledge Graphs: Existing Gaps and Future Research Challenges by d'Amato, Claudia, Mahon, Louis, Monnin, Pierre, Stamou, Giorgos

“…Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik…”
Get full text

Higher-Dimensional Timed and Hybrid Automata by Fahrenberg, Uli

“…Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik…”
Get full text

Knowledge Engineering Using Large Language Models by Allen, Bradley P., Stork, Lise, Groth, Paul

“…Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik…”
Get full text

Risk-Aware Scheduling of Dual Criticality Job Systems Using Demand Distributions by Alahmad, Bader Naim, Gopalakrishnan, Sathish

“…Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik…”
Get full text

Rule Learning over Knowledge Graphs: A Review by Wu, Hong, Wang, Zhe, Wang, Kewen, Omran, Pouya Ghiasnezhad, Li, Jiangmeng

“…Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik…”
Get full text

A Static Analysis for the Minimization of Voters in Fault-Tolerant Circuits by Burlyaev, Dmitry, Fradet, Pascal, Girault, Alain

“…Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik…”
Get full text

Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree by Barak, Boaz, O'Donnell, Ryan, Raghavendra, Prasad, Regev, Oded, Steurer, David, Trevisan, Luca, Vijayaraghavan, Aravindan, Witmer, David, Wright, John, Moitra, Ankur

“…Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik…”
Get full text
Get full text

Tight SoS-Degree Bounds for Approximate Nash Equilibria by Wu, Xiaodi, Harrow, Aram W, Natarajan, Anand Venkat

“…Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik…”
Get full text
Get full text
Get full text

Lower Bound on Expected Communication Cost of Quantum Huffman Coding by Anshu, Anurag, Garg, Ankit, Yao, Penghui, Harrow, Aram W

“…Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik…”
Get full text
Get full text

The fewest clues problem by Fermi, Ma, Schvartzman, Ariel, Waingarten, Erik, Demaine, Erik D, Aaronson, Scott

“…Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik…”
Get full text
Get full text
Get full text

Bridging the Gap Between General-Purpose and Domain-Specific Compilers with Synthesis by Cheung, Alvin, Kamil, Shoaib, Solar Lezama, Armando

“…Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik…”
Get full text
Get full text

On the Resiliency of Randomized Routing Against Multiple Edge Failures by Chiesa, Marco, Gurtov, Andrei, Madry, Aleksander, Mitrovic, Slobodan, Nikolaevskiy, Ilya, Shapira, Michael, Shenker, Scott

“…Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik…”
Get full text
Get full text

Noise stability is computable and approximately low-dimensional by De, Anindya, Mossel, Elchanan, Neeman, Joe

“…Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik…”
Get full text

Solving the Rubik’s Cube optimally is NP-complete by Demaine, Erik D, Eisenstat, Sarah Charmian, Rudoy, Mikhail

“…Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik…”
Get full text

Brief announcement: Practical synchronous byzantine consensus by Abraham, Ittai, Devadas, Srinivas, Nayak, Kartik, Ren, Ling

“…Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik…”
Get full text

Toward a general complexity theory of motion planning: Characterizing which gadgets make games hard by Demaine, Erik D, Hendrickson, Dylan H., Lynch, Jayson R.

“…Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik…”
Get full text

Counting induced subgraphs: an algebraic approach to #W[1]-hardness by Dörfler, J, Roth, M, Schmitt, J, Wellnitz, P

“…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”

Two variable logic with ultimately periodic counting by Benedikt, M, Kostylev, EV, Tan, T

“…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”

Better bounds for online line chasing by Bienkowski, M, Byrka, J, Chrobak, M, Coester, C, Jeż, Ł, Koutsoupias, E

“…Schloss Dagstuhl – Leibniz-Zentrum für Informatik…”

Improved strong spatial mixing for colorings on trees by Efthymiou, C, Galanis, A, Hayes, T, Štefankovič, D, Vigoda, E

“…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”