Aller au contenu principal
Profil bibliographique

Alexander Golynski

Informations fournies par OpenAlex. Research Africa ne déduit ni nationalité, ni poste, ni coordonnées personnelles.

33Publications signalées
867Citations signalées
1Affiliations récentes

Les institutions déclarées

Les domaines associés

Algorithms and Data CompressionComputational Geometry and Mesh GenerationData Management and AlgorithmsError Correcting Code TechniquesDNA and Biological Computing

Les publications récentes

2019 conference-paper OpenAlex

Zanzibar: Google's consistent, global authorization system

Ruoming Pang, Ramón Cáceres, Mike Burrows, Zhifeng Chen et autres

Determining whether online users are authorized to access digital objects is central to preserving privacy. This paper presents the design, implementation, and deployment of Zanzibar, a global system for storing and evaluating access control lists. Zanzibar provides a uniform data model and …

us (code pays fourni par la source)

16 citations USENIX Annual Technical Conference
Accès ouvert 2011 preprint OpenAlex

Optimal Indexes for Sparse Bit Vectors

Alexander Golynski, Alessio Orlandi, Rajeev Raman

We consider the problem of supporting Rank() and Select() operations on a bit vector of length m with n 1 bits. The problem is considered in the succinct index model, where the bit vector is stored in "read-only" memory and an additional …

us, ch, gb, kr (code pays fourni par la source)

0 citations arXiv (Cornell University)
2009 article OpenAlex

Cell probe lower bounds for succinct data structures

Alexander Golynski

In this paper, we consider several static data structure problems in the deterministic cell probe model. We develop a new technique for proving lower bounds for succinct data structures, where the redundancy in the storage can be small compared to the informationtheoretic …

us (code pays fourni par la source)

31 citations
2009 conference-paper OpenAlex

Cell Probe Lower Bounds For Succinct Data Structures

Alexander Golynski

In this paper, we consider several static data structure problems in the deterministic cell probe model. We develop a new technique for proving lower bounds for succinct data structures, where the redundancy in the storage can be small compared to the information-theoretic …

us (code pays fourni par la source)

18 citations Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms

BNTIC News n’est pas le producteur de ces données. Les publications sont interrogées à la demande dans Crossref, OpenAIRE, DOAJ, Europe PMC, HAL, DataCite, AfricArXiv, ROR et la Banque mondiale, sans clé d’accès. OpenAlex reste optionnel. Aucun service payant n’est nécessaire et aucune donnée externe n’est enregistrée en base. Consulter les sources et leurs limites.