default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Golynski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c15]Ruoming Pang, Ramón Cáceres, Mike Burrows, Zhifeng Chen, Pratik Dave, Nathan Germer, Alexander Golynski, Kevin Graney, Nina Kang, Lea Kissner, Jeffrey L. Korn, Abhishek Parmar, Christopher D. Richards, Mengzhi Wang:
Zanzibar: Google's Consistent, Global Authorization System. USENIX ATC 2019: 33-46- 2014
- [j7]Alexander Golynski, Alessio Orlandi, Rajeev Raman
, S. Srinivasa Rao:
Optimal Indexes for Sparse Bit Vectors. Algorithmica 69(4): 906-924 (2014) - 2012
- [j6]Alexander Golynski, Alejandro López-Ortiz:
Optimal strategies for the list update problem under the MRM alternative cost model. Inf. Process. Lett. 112(6): 218-222 (2012) - [c14]Sonia Waharte, Alexander Golynski, Raouf Boutaba:
On the complexity of routing in wireless multihop network. IWCMC 2012: 431-436 - 2011
- [i2]Alexander Golynski, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao:
Optimal Indexes for Sparse Bit Vectors. CoRR abs/1108.2157 (2011) - 2010
- [j5]Therese Biedl, Alexander Golynski, Angèle M. Hamel, Alejandro López-Ortiz, J. Ian Munro:
Sorting with networks of data structures. Discret. Appl. Math. 158(15): 1579-1586 (2010)
2000 – 2009
- 2009
- [c13]Alexander Golynski:
Cell probe lower bounds for succinct data structures. SODA 2009: 625-634 - 2008
- [c12]Alexander Golynski, Rajeev Raman, S. Srinivasa Rao:
On the Redundancy of Succinct Data Structures. SWAT 2008: 148-159 - 2007
- [b1]Alexander Golynski:
Upper and Lower Bounds for Text Upper and Lower Bounds for Text Indexing Data Structures. University of Waterloo, Ontario, Canada, 2007 - [j4]Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao:
Adaptive searching in succinctly encoded binary relations and tree-structured documents. Theor. Comput. Sci. 387(3): 284-297 (2007) - [j3]Alexander Golynski:
Optimal lower bounds for rank and select indexes. Theor. Comput. Sci. 387(3): 348-359 (2007) - [c11]Alexander Golynski, Roberto Grossi, Ankur Gupta, Rajeev Raman, S. Srinivasa Rao:
On the Size of Succinct Indices. ESA 2007: 371-382 - 2006
- [c10]Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao:
Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents. CPM 2006: 24-35 - [c9]Alexander Golynski:
Optimal Lower Bounds for Rank and Select Indexes. ICALP (1) 2006: 370-381 - [c8]Alexander Golynski, J. Ian Munro, S. Srinivasa Rao:
Rank/select operations on large alphabets: a tool for text indexing. SODA 2006: 368-373 - 2005
- [j2]Claude-Guy Quimper, Alexander Golynski, Alejandro López-Ortiz, Peter van Beek:
An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint. Constraints An Int. J. 10(2): 115-135 (2005) - 2004
- [j1]Michael H. Albert, Alexander Golynski, Angèle M. Hamel, Alejandro López-Ortiz, S. Srinivasa Rao, Mohammad Ali Safari:
Longest increasing subsequences in sliding windows. Theor. Comput. Sci. 321(2-3): 405-414 (2004) - [c7]Claude-Guy Quimper, Alejandro López-Ortiz, Peter van Beek, Alexander Golynski:
Improved Algorithms for the Global Cardinality Constraint. CP 2004: 542-556 - 2003
- [c6]Timothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper:
Curves of width one and the river shore problem. CCCG 2003: 73-75 - [c5]Alexander Golynski, David Bremner:
Sufficiently Fat Polyhedra are Not 2-Castable. CCCG 2003: 120-122 - [c4]Timothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper:
the asteroid surveying problem and other puzzles. SCG 2003: 372-373 - [c3]Claude-Guy Quimper, Peter van Beek, Alejandro López-Ortiz, Alexander Golynski, Sayyed Bashir Sadjad:
An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint. CP 2003: 600-614 - [c2]Therese Biedl, Erik D. Demaine, Alexander Golynski, Joseph Douglas Horton, Alejandro López-Ortiz, Guillaume Poirier, Claude-Guy Quimper:
Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting. ESA 2003: 90-101 - 2002
- [c1]Alexander Golynski, Joseph Douglas Horton:
A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid. SWAT 2002: 200-209 - [i1]David Bremner, Alexander Golynski:
Sufficiently Fat Polyhedra are not 2-castable. CoRR cs.CG/0203025 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-17 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
