Rezultati - "Data Structures and Algorithms"

Balanced Allocations with Incomplete Information: The Power of Two Queries od Los, Dimitrios, Sauerwald, Thomas

Teme: “...Data Structures and Algorithms...”
Polni tekst
Polni tekst

Balanced Allocations: Caching and Packing, Twinning and Thinning od Los, Dimitrios, Sauerwald, Thomas, Sylvester, John

Teme: “...Data Structures and Algorithms...”
Polni tekst
Polni tekst

Min-cost-flow preserving bijection between subgraphs and orientations od Elmaleh, Izhak, Feldheim, Ohad N.

Teme: “...Data Structures and Algorithms...”
Polni tekst
Polni tekst

Tight Bounds for Repeated Balls-into-Bins od Los, Dimitrios, Sauerwald, Thomas

Teme: “...Data Structures and Algorithms...”
Polni tekst
Polni tekst

Balanced Allocations in Batches: Simplified and Generalized od Los, Dimitrios, Sauerwald, Thomas

Teme: “...Data Structures and Algorithms...”
Polni tekst
Polni tekst

The Power of Filling in Balanced Allocations od Los, Dimitrios, Sauerwald, Thomas, Sylvester, John

Teme: “...Data Structures and Algorithms...”
Polni tekst
Polni tekst

Balanced Allocations with the Choice of Noise od Los, Dimitrios, Sauerwald, Thomas

Teme: “...Data Structures and Algorithms...”
Polni tekst
Polni tekst

On the Complexity of Identifying Strongly Regular Graphs od Levet, Michael

Teme: “...Data Structures and Algorithms...”
Polni tekst
Polni tekst

On the arboreal jump number of a poset od Cavalcante, Evellyn S., Urrutia, Sebastián, Santos, Vinicius F. dos

Teme: “...Data Structures and Algorithms...”
Polni tekst
Polni tekst

Popularity on the Roommate Diversity Problem od Ge, Steven, Itoh, Toshiya

Teme: “...Data Structures and Algorithms...”
Polni tekst
Polni tekst

Balanced Allocations with Heterogeneous Bins: The Power of Memory od Los, Dimitrios, Sauerwald, Thomas, Sylvester, John

Teme: “...Data Structures and Algorithms...”
Polni tekst
Polni tekst

Logarithmic Weisfeiler--Leman and Treewidth od Levet, Michael, Rombach, Puck, Sieger, Nicholas

Teme: “...Data Structures and Algorithms...”
Polni tekst
Polni tekst

Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler--Leman od Levet, Michael, Rombach, Puck, Sieger, Nicholas

Teme: “...Data Structures and Algorithms...”
Polni tekst
Polni tekst

Mean-Biased Processes for Balanced Allocations od Los, Dimitrios, Sauerwald, Thomas, Sylvester, John

Teme: “...Data Structures and Algorithms...”
Polni tekst
Polni tekst

Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem od Boros, Endre, Gurvich, Vladimir, Milanič, Martin, Uno, Yushi

Teme: “...Data Structures and Algorithms...”
Polni tekst
Polni tekst

Dynamic programming on bipartite tree decompositions od Jaffke, Lars, Morelle, Laure, Sau, Ignasi, Thilikos, Dimitrios M.

Teme: “...Data Structures and Algorithms...”
Polni tekst
Polni tekst

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$ od Heimann, Sophia, Hoang, Hung P., Hougardy, Stefan

Teme: “...Data Structures and Algorithms...”
Polni tekst
Polni tekst

The Bottom-Left Algorithm for the Strip Packing Problem od Hougardy, Stefan, Zondervan, Bart

Teme: “...Data Structures and Algorithms...”
Polni tekst
Polni tekst

A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads od Rockel-Wolff, Benjamin

Teme: “...Data Structures and Algorithms...”
Polni tekst
Polni tekst

Strongly-polynomial time and validation analysis of policy gradient methods od Ju, Caleb, Lan, Guanghui

Teme: “...Data Structures and Algorithms...”
Polni tekst
Polni tekst