Tight bounds for 2−dimensional indexing schemes

Tight bounds for 2−dimensional indexing schemes

Bibliografiska uppgifter
Huvudupphovsmän:	Koutsoupias, E, Taylor, D
Materialtyp:	Conference item
Publicerad:	Seattle‚ Washington 2015

Liknande verk

Indexing schemes for random points
av: Koutsoupias, E, et al.
Publicerad: (2015)

On the analysis of indexing schemes
av: Hellerstein, J, et al.
Publicerad: (2015)

Tight Bounds on the Complexity of Parallel Sorting
av: Leighton, Tom
Publicerad: (2023)

Tight Lower Bound for Linear Sketches of Moments
av: Andoni, Alexandr, et al.
Publicerad: (2014)

Tight bounds for parallel randomized load balancing
av: Lenzen, Christoph, et al.
Publicerad: (2016)

Tight bounds for the subspace sketch problem with applications
av: Li, Yi, et al.
Publicerad: (2022)

On a model of indexability and its bounds for range queries
av: Hellerstein, J, et al.
Publicerad: (2002)

Tight bounds on the coefficients of partition functions via stability
av: Davies, E, et al.
Publicerad: (2018)

Classical generalization bounds are surprisingly tight for Deep Networks
av: Liao, Qianli, et al.
Publicerad: (2018)

Towards Tight Bounds for the Streaming Set Cover Problem
av: Har-Peled, Sariel, et al.
Publicerad: (2018)

Tight approximation bounds for combinatorial frugal coverage algorithms
av: Caragiannis, I, et al.
Publicerad: (2013)

Toward Tight Approximation Bounds for Graph Diameter and Eccentricities
av: Backurs, Arturs, et al.
Publicerad: (2022)

Tight SoS-Degree Bounds for Approximate Nash Equilibria
av: Wu, Xiaodi, et al.
Publicerad: (2017)

Tight approximation bounds for combinatorial frugal coverage algorithms
av: Caragiannis, I, et al.
Publicerad: (2012)

Tight Approximation Bounds for Greedy Frugal Coverage Algorithms
av: Caragiannis, I, et al.
Publicerad: (2011)

Tight Conditional Lower Bounds for Approximating Diameter in Directed Graphs
av: Dalirrooyfard, Mina, et al.
Publicerad: (2022)

Tight Revenue Bounds With Possibilistic Beliefs and Level-k Rationality
av: Chen, Jing, et al.
Publicerad: (2016)

Tight revenue bounds with possibilistic beliefs and level-k rationality
av: Chen, Jing, et al.
Publicerad: (2022)

Tight Dynamic Problem Lower Bounds from Generalized BMM and OMv
av: Jin, Ce, et al.
Publicerad: (2022)

Tight global linear convergence rate bounds for operator splitting methods
av: Banjac, G, et al.
Publicerad: (2018)

Tight performance bounds for ./D/1 queues with leaky-bucket-regulated arrivals
Publicerad: (2003)

A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem
av: Barak, Boaz, et al.
Publicerad: (2022)

Tight Bounds for Minimax Grid Matching, with Applications to the Average Case Analysis of Algorithms
av: Leighton, Tom, et al.
Publicerad: (2023)

A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem
av: Barak, Boaz, et al.
Publicerad: (2018)

Tight sampling and discarding bounds for scenario programs with an arbitrary number of removed samples
av: Romao, L, et al.
Publicerad: (2021)

Maximal violation of tight Bell inequalities for maximal high-dimensional entanglement
av: Lee, S, et al.
Publicerad: (2009)

Maximal violation of tight Bell inequalities for maximal high-dimensional entanglement
av: Lee, S, et al.
Publicerad: (2009)

Tight bounds for the expected risk of linear classifiers and PAC-bayes finite-sample guarantees
av: Honorio Carrillo, Jean, et al.
Publicerad: (2018)

Tight junctions /
av: Gonzalez-Mariscal, Lorenza
Publicerad: (2006)

Effectiveness of enhanced tight finite scheme in quantum key distribution protocol for network communication
av: Khalid, Roszelinda, et al.
Publicerad: (2014)

A lower bound for scheduling mechanisms.
av: Christodoulou, G, et al.
Publicerad: (2015)

A Lower Bound for Scheduling Mechanisms
av: Christodoulou, G, et al.
Publicerad: (2009)

A Lower Bound for Scheduling Mechanisms
av: Christodoulou, G, et al.
Publicerad: (2009)

Lossy CSI-FiSh: Efficient signature scheme with tight reduction to decisional CSIDH-512
av: El Kaafarani, A, et al.
Publicerad: (2020)

UUM finance tight
av: Sin Chiew, Daily
Publicerad: (2011)

A Lower Bound of 1+phi for Truthful Scheduling Mechanisms
av: Koutsoupias, E, et al.
Publicerad: (2015)

A Lower Bound of 1+φ for Truthful Scheduling Mechanisms
av: Koutsoupias, E, et al.
Publicerad: (2013)

HIGH-TEMPERATURE SUSCEPTIBILITY BOUNDS FOR 2-DIMENSIONAL ISING-MODEL
av: Abraham, D
Publicerad: (1972)

An approximation scheme for planar graph TSP
av: Grigni, M, et al.
Publicerad: (2015)

Nil (1,1) algebra of bounded index /
av: 216282 Ng, Seong Nam
Publicerad: (1986)