×

Found 981 Documents (Results 1–100)

Newest Citations Relevance
Angelopoulos, Spyros; Kamali, Shahin

Rényi-Ulam games and online computation with imperfect advice. (English) Zbl 07953262

Leroux, Jérôme (ed.) et al., 48th international symposium on mathematical foundations of computer science, MFCS 2023, Bordeaux, France, August 28 – September 1, 2023. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 272, Article 13, 15 p. (2023).
MSC:  68Qxx
Cite Review PDF
Full Text: DOI arXiv
Gupta, Anupam

Algorithms for uncertain environments: going beyond the worst-case (invited talk). (English) Zbl 07912908

Dawar, Anuj (ed.) et al., 42nd IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2022), IIT Madras, Chennai, India, December 18–20, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 250, Article 1, 1 p. (2022).
MSC:  68N30 68Qxx
Cite Review PDF
Full Text: DOI
Goldberg, Halley; Kabanets, Valentine; Lu, Zhenjian; Oliveira, Igor C.

Probabilistic Kolmogorov complexity with applications to average-case complexity. (English) Zbl 07877663

Lovett, Shachar (ed.), 37th computational complexity conference, CCC 2022, Philadelphia, PA, USA, July 20–23, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 234, Article 16, 60 p. (2022).
MSC:  68Q25
Cite Review PDF
Full Text: DOI
Skalistis, Stefanos; Kritikakou, Angeliki

Dynamic interference-sensitive run-time adaptation of time-triggered schedules. (English) Zbl 1541.68056

Völp, Marcus (ed.), 32nd Euromicro conference on real-time systems, ECRTS 2020, virtual conference, July 7–10, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 165, Article 4, 22 p. (2020).
MSC:  68M20
Cite Review PDF
Full Text: DOI
Wei, Alexander

Better and simpler learning-augmented online caching. (English) Zbl 07758362

Byrka, Jarosław (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 23rd international conference, APPROX 2020, and 24th international conference, RANDOM 2020, August 17–19, 2020, Virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 176, Article 60, 17 p. (2020).
MSC:  68W20 68W25 90C27
Cite Review PDF
Full Text: DOI arXiv
Ageev, Alexander; Ivanov, Mikhail

An improved approximation algorithm for the coupled-task scheduling problem with equal exact delays. (English) Zbl 1460.90082

Kononov, Alexander (ed.) et al., Mathematical optimization theory and operations research. 19th international conference, MOTOR 2020, Novosibirsk, Russia, July 6–10, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12095, 265-273 (2020).
MSC:  90B35 68W25
Cite Review PDF
Full Text: DOI
Ageev, Alexander; Kononov, Alexander

A 0.3622-approximation algorithm for the maximum \(k\)-edge-colored clustering problem. (English) Zbl 1460.90147

Kochetov, Yury (ed.) et al., Mathematical optimization theory and operations research. 19th international conference, MOTOR 2020, Novosibirsk, Russia, July 6–10, 2020. Revised selected papers. Cham: Springer. Commun. Comput. Inf. Sci. 1275, 3-15 (2020).
MSC:  90C27 90C35
Cite Review PDF
Full Text: DOI
Louis, Anand; Venkat, Rakesh

Planted models for \(k\)-way edge and vertex expansion. (English) Zbl 07650320

Chattopadhyay, Arkadev (ed.) et al., 39th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2019, Bombay, India, December 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 150, Article 23, 15 p. (2019).
MSC:  68N30 68Qxx
Cite Review PDF
Full Text: DOI arXiv
Nasri, Mitra; Nelissen, Geoffrey; Brandenburg, Björn B.

Response-time analysis of limited-preemptive parallel DAG tasks under global scheduling. (English) Zbl 1541.68049

Quinton, Sophie (ed.), 31st Euromicro conference on real-time systems, ECRTS 2019, Stuttgart, Germany, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 133, Article 21, 23 p. (2019).
MSC:  68M20
Cite Review PDF
Full Text: DOI
Angelidakis, Haris; Awasthi, Pranjal; Blum, Avrim; Chatziafratis, Vaggos; Dan, Chen

Bilu-Linial stability, certified algorithms and the independent set problem. (English) Zbl 1547.68533

Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 7, 16 p. (2019).
MSC:  68R10 05C69 05C70 68W25 68W40
Cite Review PDF
Full Text: DOI arXiv
Chekuri, Chandra; Gupta, Shalmoli

Perturbation resilient clustering for k-center and related problems via LP relaxations. (English) Zbl 1521.68269

Blais, Eric (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 21st international workshop, APPROX 2018, and 22nd international workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 116, Article 9, 16 p. (2018).
MSC:  68W40 62H30
Cite Review PDF
Full Text: DOI arXiv
Louis, Anand; Venkat, Rakesh

Semi-random graphs with planted sparse vertex cuts: algorithms for exact and approximate recovery. (English) Zbl 1499.68285

Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 101, 15 p. (2018).
MSC:  68R10 68W25 68W40
Cite Review PDF
Full Text: DOI arXiv
Charikar, Moses; Solomon, Shay

Fully dynamic almost-maximal matching: breaking the polynomial worst-case time barrier. (English) Zbl 1499.68261

Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 33, 14 p. (2018).
MSC:  68R10 05C70 05C85 68W20 68W25 68W40
Cite Review PDF
Full Text: DOI

Filter Results by …

Access

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software