generated by bibbase.org
  2024 (1)
Size-Constrained Weighted Ancestors with Applications. Bille, P.; Nekrich, Y.; and Pissis, S. P. In Bodlaender, H. L., editor(s), SWAT, volume 294, of LIPIcs, pages 14:1-14:12, 2024. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Size-Constrained Weighted Ancestors with Applications. [link]Link   Size-Constrained Weighted Ancestors with Applications. [link]Paper   link   bibtex  
  2023 (4)
Sum-of-Local-Effects Data Structures for Separable Graphs. Lyu, X.; Gagie, T.; He, M.; Nekrich, Y.; and Zeh, N. In Wu, W.; and Tong, G., editor(s), COCOON (1), volume 14422, of Lecture Notes in Computer Science, pages 195-206, 2023. Springer
Sum-of-Local-Effects Data Structures for Separable Graphs. [link]Link   Sum-of-Local-Effects Data Structures for Separable Graphs. [link]Paper   link   bibtex  
Size-constrained Weighted Ancestors with Applications. Bille, P.; Nekrich, Y.; and Pissis, S. P. CoRR, abs/2311.15777. 2023.
Size-constrained Weighted Ancestors with Applications. [link]Link   Size-constrained Weighted Ancestors with Applications. [link]Paper   link   bibtex  
Sum-of-Local-Effects Data Structures for Separable Graphs. Lyu, X.; Gagie, T.; He, M.; Nekrich, Y.; and Zeh, N. CoRR, abs/2305.03240. 2023.
Sum-of-Local-Effects Data Structures for Separable Graphs. [link]Link   Sum-of-Local-Effects Data Structures for Separable Graphs. [link]Paper   link   bibtex  
4D Range Reporting in the Pointer Machine Model in Almost-Optimal Time. Nekrich, Y.; and Rahul, S. In Bansal, N.; and Nagarajan, V., editor(s), SODA, pages 1862-1876, 2023. SIAM
4D Range Reporting in the Pointer Machine Model in Almost-Optimal Time. [link]Link   4D Range Reporting in the Pointer Machine Model in Almost-Optimal Time. [link]Paper   link   bibtex  
  2022 (5)
Finding a Maximum Clique in a Grounded 1-Bend String Graph. Keil, J. M.; Mondal, D.; Moradi, E.; and Nekrich, Y. J. Graph Algorithms Appl., 26(1): 553-575. 2022.
Finding a Maximum Clique in a Grounded 1-Bend String Graph. [link]Link   Finding a Maximum Clique in a Grounded 1-Bend String Graph. [link]Paper   link   bibtex  
External-Memory Dictionaries with Worst-Case Update Cost. Das, R.; Iacono, J.; and Nekrich, Y. In Bae, S. W.; and Park, H., editor(s), ISAAC, volume 248, of LIPIcs, pages 21:1-21:13, 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
External-Memory Dictionaries with Worst-Case Update Cost. [link]Link   External-Memory Dictionaries with Worst-Case Update Cost. [link]Paper   link   bibtex  
External-memory dictionaries with worst-case update cost. Das, R.; Iacono, J.; and Nekrich, Y. CoRR, abs/2211.06044. 2022.
External-memory dictionaries with worst-case update cost. [link]Link   External-memory dictionaries with worst-case update cost. [link]Paper   link   bibtex  
4D Range Reporting in the Pointer Machine Model in Almost-Optimal Time. Nekrich, Y.; and Rahul, S. CoRR, abs/2211.03161. 2022.
4D Range Reporting in the Pointer Machine Model in Almost-Optimal Time. [link]Link   4D Range Reporting in the Pointer Machine Model in Almost-Optimal Time. [link]Paper   link   bibtex  
Orthogonal point location and rectangle stabbing queries in 3-d. Chan, T. M.; Nekrich, Y.; Rahul, S.; and Tsakalidis, K. J. Comput. Geom., 13(1). 2022.
Orthogonal point location and rectangle stabbing queries in 3-d. [link]Link   Orthogonal point location and rectangle stabbing queries in 3-d. [link]Paper   link   bibtex  
  2021 (4)
Range Majorities and Minorities in Arrays. Belazzougui, D.; Gagie, T.; Munro, J. I.; Navarro, G.; and Nekrich, Y. Algorithmica, 83(6): 1707-1733. 2021.
Range Majorities and Minorities in Arrays. [link]Link   Range Majorities and Minorities in Arrays. [link]Paper   link   bibtex  
Finding a Maximum Clique in a Grounded 1-Bend String Graph. Keil, J. M.; Mondal, D.; Moradi, E.; and Nekrich, Y. CoRR, abs/2107.05198. 2021.
Finding a Maximum Clique in a Grounded 1-Bend String Graph. [link]Link   Finding a Maximum Clique in a Grounded 1-Bend String Graph. [link]Paper   link   bibtex  
New Data Structures for Orthogonal Range Reporting and Range Minima Queries. Nekrich, Y. In Marx, D., editor(s), SODA, pages 1191-1205, 2021. SIAM
New Data Structures for Orthogonal Range Reporting and Range Minima Queries. [link]Link   New Data Structures for Orthogonal Range Reporting and Range Minima Queries. [link]Paper   link   bibtex  
Dynamic planar point location in optimal time. Nekrich, Y. In Khuller, S.; and Williams, V. V., editor(s), STOC, pages 1003-1014, 2021. ACM
Dynamic planar point location in optimal time. [link]Link   Dynamic planar point location in optimal time. [link]Paper   link   bibtex  
  2020 (13)
Fast Compressed Self-indexes with Deterministic Linear-Time Construction. Munro, J. I.; Navarro, G.; and Nekrich, Y. Algorithmica, 82(2): 316-337. 2020.
Fast Compressed Self-indexes with Deterministic Linear-Time Construction. [link]Link   Fast Compressed Self-indexes with Deterministic Linear-Time Construction. [link]Paper   link   bibtex  
Parallel computation of the Burrows Wheeler Transform in compact space. Fuentes-Sepúlveda, J.; Navarro, G.; and Nekrich, Y. Theor. Comput. Sci., 812: 123-136. 2020.
Parallel computation of the Burrows Wheeler Transform in compact space. [link]Link   Parallel computation of the Burrows Wheeler Transform in compact space. [link]Paper   link   bibtex  
Text Indexing and Searching in Sublinear Time. Munro, J. I.; Navarro, G.; and Nekrich, Y. In Gørtz, I. L.; and Weimann, O., editor(s), CPM, volume 161, of LIPIcs, pages 24:1-24:15, 2020. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Text Indexing and Searching in Sublinear Time. [link]Link   Text Indexing and Searching in Sublinear Time. [link]Paper   link   bibtex  
A linear-space data structure for range-LCP queries in poly-logarithmic time. Abedin, P.; Ganguly, A.; Hon, W.; Matsuda, K.; Nekrich, Y.; Sadakane, K.; Shah, R.; and Thankachan, S. V. Theor. Comput. Sci., 822: 15-22. 2020.
A linear-space data structure for range-LCP queries in poly-logarithmic time. [link]Link   A linear-space data structure for range-LCP queries in poly-logarithmic time. [link]Paper   link   bibtex   1 download  
Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing. Gao, Y.; He, M.; and Nekrich, Y. In Grandoni, F.; Herman, G.; and Sanders, P., editor(s), ESA, volume 173, of LIPIcs, pages 54:1-54:18, 2020. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing. [link]Link   Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing. [link]Paper   link   bibtex  
Further Results on Colored Range Searching. Chan, T. M.; He, Q.; and Nekrich, Y. CoRR, abs/2003.11604. 2020.
Further Results on Colored Range Searching. [link]Link   Further Results on Colored Range Searching. [link]Paper   link   bibtex  
Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees. He, M.; Munro, J. I.; Nekrich, Y.; Wild, S.; and Wu, K. In Cao, Y.; Cheng, S.; and Li, M., editor(s), ISAAC, volume 181, of LIPIcs, pages 25:1-25:18, 2020. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees. [link]Link   Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees. [link]Paper   link   bibtex  
Better Data Structures for Colored Orthogonal Range Reporting. Chan, T. M.; and Nekrich, Y. In Chawla, S., editor(s), SODA, pages 627-636, 2020. SIAM
Better Data Structures for Colored Orthogonal Range Reporting. [link]Link   Better Data Structures for Colored Orthogonal Range Reporting. [link]Paper   link   bibtex  
Four-Dimensional Dominance Range Reporting in Linear Space. Nekrich, Y. In Cabello, S.; and Chen, D. Z., editor(s), SoCG, volume 164, of LIPIcs, pages 59:1-59:14, 2020. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Four-Dimensional Dominance Range Reporting in Linear Space. [link]Link   Four-Dimensional Dominance Range Reporting in Linear Space. [link]Paper   link   bibtex  
Further Results on Colored Range Searching. Chan, T. M.; He, Q.; and Nekrich, Y. In Cabello, S.; and Chen, D. Z., editor(s), SoCG, volume 164, of LIPIcs, pages 28:1-28:15, 2020. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Further Results on Colored Range Searching. [link]Link   Further Results on Colored Range Searching. [link]Paper   link   bibtex  
New Data Structures for Orthogonal Range Reporting and Range Minima Queries. Nekrich, Y. CoRR, abs/2007.11094. 2020.
New Data Structures for Orthogonal Range Reporting and Range Minima Queries. [link]Link   New Data Structures for Orthogonal Range Reporting and Range Minima Queries. [link]Paper   link   bibtex  
Breadth-First Rank/Select in Succinct Trees and Distance Oracles for Interval Graphs. He, M.; Munro, J. I.; Nekrich, Y.; Wild, S.; and Wu, K. CoRR, abs/2005.07644. 2020.
Breadth-First Rank/Select in Succinct Trees and Distance Oracles for Interval Graphs. [link]Link   Breadth-First Rank/Select in Succinct Trees and Distance Oracles for Interval Graphs. [link]Paper   link   bibtex  
Four-Dimensional Dominance Range Reporting in Linear Space. Nekrich, Y. CoRR, abs/2003.06742. 2020.
Four-Dimensional Dominance Range Reporting in Linear Space. [link]Link   Four-Dimensional Dominance Range Reporting in Linear Space. [link]Paper   link   bibtex  
  2019 (8)
Categorical Range Reporting with Frequencies. Ganguly, A.; Munro, J. I.; Nekrich, Y.; Shah, R.; and Thankachan, S. V. In Barceló, P.; and Calautti, M., editor(s), ICDT, volume 127, of LIPIcs, pages 9:1-9:19, 2019. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Categorical Range Reporting with Frequencies. [link]Link   Categorical Range Reporting with Frequencies. [link]Paper   link   bibtex  
Space-Efficient Computation of the Burrows-Wheeler Transform. Fuentes-Sepúlveda, J.; Navarro, G.; and Nekrich, Y. In Bilgin, A.; Marcellin, M. W.; Serra-Sagristà, J.; and Storer, J. A., editor(s), DCC, pages 132-141, 2019. IEEE
Space-Efficient Computation of the Burrows-Wheeler Transform. [link]Link   Space-Efficient Computation of the Burrows-Wheeler Transform. [link]Paper   link   bibtex  
On Approximate Range Mode and Range Selection. El-Zein, H.; He, M.; Munro, J. I.; Nekrich, Y.; and Sandlund, B. In Lu, P.; and Zhang, G., editor(s), ISAAC, volume 149, of LIPIcs, pages 57:1-57:14, 2019. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
On Approximate Range Mode and Range Selection. [link]Link   On Approximate Range Mode and Range Selection. [link]Paper   link   bibtex  
Dynamic Planar Point Location in External Memory. Munro, J. I.; and Nekrich, Y. In Barequet, G.; and Wang, Y., editor(s), SoCG, volume 129, of LIPIcs, pages 52:1-52:15, 2019. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Dynamic Planar Point Location in External Memory. [link]Link   Dynamic Planar Point Location in External Memory. [link]Paper   link   bibtex  
Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. Chan, T. M.; Nekrich, Y.; and Smid, M. H. M. In Friggstad, Z.; Sack, J.; and Salavatipour, M. R., editor(s), WADS, volume 11646, of Lecture Notes in Computer Science, pages 283-295, 2019. Springer
Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. [link]Link   Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. [link]Paper   link   bibtex  
On Approximate Range Mode and Range Selection. El-Zein, H.; He, M.; Munro, J. I.; Nekrich, Y.; and Sandlund, B. CoRR, abs/1907.08579. 2019.
On Approximate Range Mode and Range Selection. [link]Link   On Approximate Range Mode and Range Selection. [link]Paper   link   bibtex  
Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. Chan, T. M.; Nekrich, Y.; and Smid, M. H. M. CoRR, abs/1905.02322. 2019.
Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. [link]Link   Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. [link]Paper   link   bibtex  
Dynamic Planar Point Location in External Memory. Munro, J. I.; and Nekrich, Y. CoRR, abs/1903.06601. 2019.
Dynamic Planar Point Location in External Memory. [link]Link   Dynamic Planar Point Location in External Memory. [link]Paper   link   bibtex  
  2018 (7)
A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time. Abedin, P.; Ganguly, A.; Hon, W.; Nekrich, Y.; Sadakane, K.; Shah, R.; and Thankachan, S. V. In Wang, L.; and Zhu, D., editor(s), COCOON, volume 10976, of Lecture Notes in Computer Science, pages 615-625, 2018. Springer
A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time. [link]Link   A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time. [link]Paper   link   bibtex  
Dynamic Trees with Almost-Optimal Access Cost. Golin, M. J.; Iacono, J.; Langerman, S.; Munro, J. I.; and Nekrich, Y. In Azar, Y.; Bast, H.; and Herman, G., editor(s), ESA, volume 112, of LIPIcs, pages 38:1-38:14, 2018. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Dynamic Trees with Almost-Optimal Access Cost. [link]Link   Dynamic Trees with Almost-Optimal Access Cost. [link]Paper   link   bibtex  
Towards an Optimal Method for Dynamic Planar Point Location. Chan, T. M.; and Nekrich, Y. SIAM J. Comput., 47(6): 2337-2361. 2018.
Towards an Optimal Method for Dynamic Planar Point Location. [link]Link   Towards an Optimal Method for Dynamic Planar Point Location. [link]Paper   link   bibtex  
Orthogonal Point Location and Rectangle Stabbing Queries in 3-d. Chan, T. M.; Nekrich, Y.; Rahul, S.; and Tsakalidis, K. In Chatzigiannakis, I.; Kaklamanis, C.; Marx, D.; and Sannella, D., editor(s), ICALP, volume 107, of LIPIcs, pages 31:1-31:14, 2018. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Orthogonal Point Location and Rectangle Stabbing Queries in 3-d. [link]Link   Orthogonal Point Location and Rectangle Stabbing Queries in 3-d. [link]Paper   link   bibtex  
Succinct Dynamic One-Dimensional Point Reporting. El-Zein, H.; Munro, J. I.; and Nekrich, Y. In Eppstein, D., editor(s), SWAT, volume 101, of LIPIcs, pages 17:1-17:11, 2018. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Succinct Dynamic One-Dimensional Point Reporting. [link]Link   Succinct Dynamic One-Dimensional Point Reporting. [link]Paper   link   bibtex  
Dynamic Trees with Almost-Optimal Access Cost. Golin, M. J.; Iacono, J.; Langerman, S.; Munro, J. I.; and Nekrich, Y. CoRR, abs/1806.10498. 2018.
Dynamic Trees with Almost-Optimal Access Cost. [link]Link   Dynamic Trees with Almost-Optimal Access Cost. [link]Paper   link   bibtex  
Orthogonal Point Location and Rectangle Stabbing Queries in 3-d. Chan, T. M.; Nekrich, Y.; Rahul, S.; and Tsakalidis, K. CoRR, abs/1805.08602. 2018.
Orthogonal Point Location and Rectangle Stabbing Queries in 3-d. [link]Link   Orthogonal Point Location and Rectangle Stabbing Queries in 3-d. [link]Paper   link   bibtex  
  2017 (7)
Text Indexing and Searching in Sublinear Time. Munro, J. I.; Navarro, G.; and Nekrich, Y. CoRR, abs/1712.07431. 2017.
Text Indexing and Searching in Sublinear Time. [link]Link   Text Indexing and Searching in Sublinear Time. [link]Paper   link   bibtex  
Fast Compressed Self-Indexes with Deterministic Linear-Time Construction. Munro, J. I.; Navarro, G.; and Nekrich, Y. CoRR, abs/1707.01743. 2017.
Fast Compressed Self-Indexes with Deterministic Linear-Time Construction. [link]Link   Fast Compressed Self-Indexes with Deterministic Linear-Time Construction. [link]Paper   link   bibtex  
Fast Compressed Self-Indexes with Deterministic Linear-Time Construction. Munro, J. I.; Navarro, G.; and Nekrich, Y. In Okamoto, Y.; and Tokuyama, T., editor(s), ISAAC, volume 92, of LIPIcs, pages 57:1-57:12, 2017. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Fast Compressed Self-Indexes with Deterministic Linear-Time Construction. [link]Link   Fast Compressed Self-Indexes with Deterministic Linear-Time Construction. [link]Paper   link   bibtex  
Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time. Munro, J. I.; Navarro, G.; and Nekrich, Y. In Klein, P. N., editor(s), SODA, pages 408-424, 2017. SIAM
Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time. [link]Link   Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time. [link]Paper   link   bibtex  
Succinct Color Searching in One Dimension. El-Zein, H.; Munro, J. I.; and Nekrich, Y. In Okamoto, Y.; and Tokuyama, T., editor(s), ISAAC, volume 92, of LIPIcs, pages 30:1-30:11, 2017. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Succinct Color Searching in One Dimension. [link]Link   Succinct Color Searching in One Dimension. [link]Paper   link   bibtex  
Full-Fledged Real-Time Indexing for Constant Size Alphabets. Kucherov, G.; and Nekrich, Y. Algorithmica, 79(2): 387-400. 2017.
Full-Fledged Real-Time Indexing for Constant Size Alphabets. [link]Link   Full-Fledged Real-Time Indexing for Constant Size Alphabets. [link]Paper   link   bibtex  
  2016 (5)
Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time. Munro, J. I.; Navarro, G.; and Nekrich, Y. CoRR, abs/1607.04346. 2016.
Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time. [link]Link   Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time. [link]Paper   link   bibtex  
Range Majorities and Minorities in Arrays. Belazzougui, D.; Gagie, T.; Munro, J. I.; Navarro, G.; and Nekrich, Y. CoRR, abs/1606.04495. 2016.
Range Majorities and Minorities in Arrays. [link]Link   Range Majorities and Minorities in Arrays. [link]Paper   link   bibtex  
Fast construction of wavelet trees. Munro, J. I.; Nekrich, Y.; and Vitter, J. S. Theor. Comput. Sci., 638: 91-97. 2016.
Fast construction of wavelet trees. [link]Link   Fast construction of wavelet trees. [link]Paper   link   bibtex  
Document retrieval with one wildcard. Lewenstein, M.; Munro, J. I.; Nekrich, Y.; and Thankachan, S. V. Theor. Comput. Sci., 635: 94-101. 2016.
Document retrieval with one wildcard. [link]Link   Document retrieval with one wildcard. [link]Paper   link   bibtex  
Orthogonal Range Searching on Discrete Grids. Nekrich, Y. In Encyclopedia of Algorithms, pages 1484-1489. 2016.
Orthogonal Range Searching on Discrete Grids. [link]Link   Orthogonal Range Searching on Discrete Grids. [link]Paper   link   bibtex  
  2015 (9)
Efficient and Compact Representations of Prefix Codes. Gagie, T.; Navarro, G.; Nekrich, Y.; and Pereira, A. O. IEEE Trans. Inf. Theory, 61(9): 4999-5011. 2015.
Efficient and Compact Representations of Prefix Codes. [link]Link   Efficient and Compact Representations of Prefix Codes. [link]Paper   link   bibtex  
An Efficient Exact Algorithm for the Motif Stem Search Problem over Large Alphabets. Yu, Q.; Huo, H.; Vitter, J. S.; Huan, J.; and Nekrich, Y. IEEE ACM Trans. Comput. Biol. Bioinform., 12(2): 384-397. 2015.
An Efficient Exact Algorithm for the Motif Stem Search Problem over Large Alphabets. [link]Link   An Efficient Exact Algorithm for the Motif Stem Search Problem over Large Alphabets. [link]Paper   link   bibtex  
Towards an Optimal Method for Dynamic Planar Point Location. Chan, T. M.; and Nekrich, Y. In Guruswami, V., editor(s), FOCS, pages 390-409, 2015. IEEE Computer Society
Towards an Optimal Method for Dynamic Planar Point Location. [link]Link   Towards an Optimal Method for Dynamic Planar Point Location. [link]Paper   link   bibtex  
Dynamic Data Structures for Document Collections and Graphs. Munro, J. I.; Nekrich, Y.; and Vitter, J. S. In Milo, T.; and Calvanese, D., editor(s), PODS, pages 277-289, 2015. ACM
Dynamic Data Structures for Document Collections and Graphs. [link]Link   Dynamic Data Structures for Document Collections and Graphs. [link]Paper   link   bibtex  
A Data-Aware FM-index. Huo, H.; Chen, L.; Zhao, H.; Vitter, J. S.; Nekrich, Y.; and Yu, Q. In Brandes, U.; and Eppstein, D., editor(s), ALENEX, pages 10-23, 2015. SIAM
A Data-Aware FM-index. [link]Link   A Data-Aware FM-index. [link]Paper   link   bibtex  
Range Counting with Distinct Constraints. Munro, J. I.; Nekrich, Y.; and Thankachan, S. V. In CCCG, 2015. Queen's University, Ontario, Canada
Range Counting with Distinct Constraints. [pdf]Link   Range Counting with Distinct Constraints. [link]Paper   link   bibtex  
Compressed Data Structures for Dynamic Sequences. Munro, J. I.; and Nekrich, Y. In Bansal, N.; and Finocchi, I., editor(s), ESA, volume 9294, of Lecture Notes in Computer Science, pages 891-902, 2015. Springer
Compressed Data Structures for Dynamic Sequences. [link]Link   Compressed Data Structures for Dynamic Sequences. [link]Paper   link   bibtex  
Dynamic Data Structures for Document Collections and Graphs. Munro, J. I.; Nekrich, Y.; and Vitter, J. S. CoRR, abs/1503.05977. 2015.
Dynamic Data Structures for Document Collections and Graphs. [link]Link   Dynamic Data Structures for Document Collections and Graphs. [link]Paper   link   bibtex  
Compressed Data Structures for Dynamic Sequences. Munro, J. I.; and Nekrich, Y. CoRR, abs/1507.06866. 2015.
Compressed Data Structures for Dynamic Sequences. [link]Link   Compressed Data Structures for Dynamic Sequences. [link]Paper   link   bibtex  
  2014 (12)
Efficient Fully-Compressed Sequence Representations. Barbay, J.; Claude, F.; Gagie, T.; Navarro, G.; and Nekrich, Y. Algorithmica, 69(1): 232-268. 2014.
Efficient Fully-Compressed Sequence Representations. [link]Link   Efficient Fully-Compressed Sequence Representations. [link]Paper   link   bibtex  
Efficient and Compact Representations of Prefix Codes. Gagie, T.; Navarro, G.; Nekrich, Y.; and Pereira, A. O. CoRR, abs/1410.3438. 2014.
Efficient and Compact Representations of Prefix Codes. [link]Link   Efficient and Compact Representations of Prefix Codes. [link]Paper   link   bibtex  
Categorical range maxima queries. Patil, M.; Thankachan, S. V.; Shah, R.; Nekrich, Y.; and Vitter, J. S. In Hull, R.; and Grohe, M., editor(s), PODS, pages 266-277, 2014. ACM
Categorical range maxima queries. [link]Link   Categorical range maxima queries. [link]Paper   link   bibtex  
Space-Efficient String Indexing for Wildcard Pattern Matching. Lewenstein, M.; Nekrich, Y.; and Vitter, J. S. In Mayr, E. W.; and Portier, N., editor(s), STACS, volume 25, of LIPIcs, pages 506-517, 2014. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Space-Efficient String Indexing for Wildcard Pattern Matching. [link]Link   Space-Efficient String Indexing for Wildcard Pattern Matching. [link]Paper   link   bibtex  
A Practical Implementation of Compressed Suffix Arrays with Applications to Self-Indexing. Huo, H.; Chen, L.; Vitter, J. S.; and Nekrich, Y. In Bilgin, A.; Marcellin, M. W.; Serra-Sagristà, J.; and Storer, J. A., editor(s), DCC, pages 292-301, 2014. IEEE
A Practical Implementation of Compressed Suffix Arrays with Applications to Self-Indexing. [link]Link   A Practical Implementation of Compressed Suffix Arrays with Applications to Self-Indexing. [link]Paper   link   bibtex  
LZ77-Based Self-indexing with Faster Pattern Matching. Gagie, T.; Gawrychowski, P.; Kärkkäinen, J.; Nekrich, Y.; and Puglisi, S. J. In Pardo, A.; and Viola, A., editor(s), LATIN, volume 8392, of Lecture Notes in Computer Science, pages 731-742, 2014. Springer
LZ77-Based Self-indexing with Faster Pattern Matching. [link]Link   LZ77-Based Self-indexing with Faster Pattern Matching. [link]Paper   link   bibtex  
Cross-document pattern matching. Kopelowitz, T.; Kucherov, G.; Nekrich, Y.; and Starikovskaya, T. J. Discrete Algorithms, 24: 40-47. 2014.
Cross-document pattern matching. [link]Link   Cross-document pattern matching. [link]Paper   link   bibtex  
Efficient range searching for categorical and plain data. Nekrich, Y. ACM Trans. Database Syst., 39(1): 9:1-9:21. 2014.
Efficient range searching for categorical and plain data. [link]Link   Efficient range searching for categorical and plain data. [link]Paper   link   bibtex  
Document Retrieval with One Wildcard. Lewenstein, M.; Munro, J. I.; Nekrich, Y.; and Thankachan, S. V. In Csuhaj-Varjú, E.; Dietzfelbinger, M.; and Ésik, Z., editor(s), MFCS (2), volume 8635, of Lecture Notes in Computer Science, pages 529-540, 2014. Springer
Document Retrieval with One Wildcard. [link]Link   Document Retrieval with One Wildcard. [link]Paper   link   bibtex  
Space-Efficient String Indexing for Wildcard Pattern Matching. Lewenstein, M.; Nekrich, Y.; and Vitter, J. S. CoRR, abs/1401.0625. 2014.
Space-Efficient String Indexing for Wildcard Pattern Matching. [link]Link   Space-Efficient String Indexing for Wildcard Pattern Matching. [link]Paper   link   bibtex  
Fast Construction of Wavelet Trees. Munro, J. I.; Nekrich, Y.; and Vitter, J. S. In de Moura, E. S.; and Crochemore, M., editor(s), SPIRE, volume 8799, of Lecture Notes in Computer Science, pages 101-110, 2014. Springer
Fast Construction of Wavelet Trees. [link]Link   Fast Construction of Wavelet Trees. [link]Paper   link   bibtex  
  2013 (12)
StemFinder: An efficient algorithm for searching motif stems over large alphabets. Yu, Q.; Huo, H.; Vitter, J. S.; Huan, J.; and Nekrich, Y. In Li, G.; Kim, S.; Hughes, M.; McLachlan, G. J.; Sun, H.; Hu, X.; Ressom, H. W.; Liu, B.; and Liebman, M. N., editor(s), BIBM, pages 473-476, 2013. IEEE Computer Society
StemFinder: An efficient algorithm for searching motif stems over large alphabets. [link]Link   StemFinder: An efficient algorithm for searching motif stems over large alphabets. [link]Paper   link   bibtex  
Optimal Color Range Reporting in One Dimension. Nekrich, Y.; and Vitter, J. S. In Bodlaender, H. L.; and Italiano, G. F., editor(s), ESA, volume 8125, of Lecture Notes in Computer Science, pages 743-754, 2013. Springer
Optimal Color Range Reporting in One Dimension. [link]Link   Optimal Color Range Reporting in One Dimension. [link]Paper   link   bibtex  
External Memory orthogonal Range Reporting with Fast Updates. Nekrich, Y. Int. J. Comput. Geom. Appl., 23(2): 141-. 2013.
External Memory orthogonal Range Reporting with Fast Updates. [link]Link   External Memory orthogonal Range Reporting with Fast Updates. [link]Paper   link   bibtex  
Heaviest Induced Ancestors and Longest Common Substrings. Gagie, T.; Gawrychowski, P.; and Nekrich, Y. In CCCG, 2013. Carleton University, Ottawa, Canada
Heaviest Induced Ancestors and Longest Common Substrings. [pdf]Link   Heaviest Induced Ancestors and Longest Common Substrings. [link]Paper   link   bibtex  
Minimal Discriminating Words Problem Revisited. Gawrychowski, P.; Kucherov, G.; Nekrich, Y.; and Starikovskaya, T. In Kurland, O.; Lewenstein, M.; and Porat, E., editor(s), SPIRE, volume 8214, of Lecture Notes in Computer Science, pages 129-140, 2013. Springer
Minimal Discriminating Words Problem Revisited. [link]Link   Minimal Discriminating Words Problem Revisited. [link]Paper   link   bibtex  
Full-Fledged Real-Time Indexing for Constant Size Alphabets. Kucherov, G.; and Nekrich, Y. In Fomin, F. V.; Freivalds, R.; Kwiatkowska, M. Z.; and Peleg, D., editor(s), ICALP (1), volume 7965, of Lecture Notes in Computer Science, pages 650-660, 2013. Springer
Full-Fledged Real-Time Indexing for Constant Size Alphabets. [link]Link   Full-Fledged Real-Time Indexing for Constant Size Alphabets. [link]Paper   link   bibtex  
Heaviest Induced Ancestors and Longest Common Substrings. Gagie, T.; Gawrychowski, P.; and Nekrich, Y. CoRR, abs/1305.3164. 2013.
Heaviest Induced Ancestors and Longest Common Substrings [link]Link   Heaviest Induced Ancestors and Longest Common Substrings [link]Paper   link   bibtex  
Optimal Color Range Reporting in One Dimension. Nekrich, Y.; and Vitter, J. S. CoRR, abs/1306.5029. 2013.
Optimal Color Range Reporting in One Dimension. [link]Link   Optimal Color Range Reporting in One Dimension. [link]Paper   link   bibtex  
Full-fledged Real-Time Indexing for Constant Size Alphabets. Kucherov, G.; and Nekrich, Y. CoRR, abs/1302.4016. 2013.
Full-fledged Real-Time Indexing for Constant Size Alphabets [link]Link   Full-fledged Real-Time Indexing for Constant Size Alphabets [link]Paper   link   bibtex  
  2012 (9)
Sorted Range Reporting. Nekrich, Y.; and Navarro, G. In Fomin, F. V.; and Kaski, P., editor(s), SWAT, volume 7357, of Lecture Notes in Computer Science, pages 271-282, 2012. Springer
Sorted Range Reporting. [link]Link   Sorted Range Reporting. [link]Paper   link   bibtex  
Sorted Range Reporting. Nekrich, Y.; and Navarro, G. CoRR, abs/1204.4509. 2012.
Sorted Range Reporting [link]Link   Sorted Range Reporting [link]Paper   link   bibtex  
A Faster Grammar-Based Self-index. Gagie, T.; Gawrychowski, P.; Kärkkäinen, J.; Nekrich, Y.; and Puglisi, S. J. In Dediu, A.; and Martín-Vide, C., editor(s), LATA, volume 7183, of Lecture Notes in Computer Science, pages 240-251, 2012. Springer
A Faster Grammar-Based Self-index. [link]Link   A Faster Grammar-Based Self-index. [link]Paper   link   bibtex  
Computing Discriminating and Generic Words. Kucherov, G.; Nekrich, Y.; and Starikovskaya, T. In Calderón-Benavides, L.; González-Caro, C. N.; Chávez, E.; and Ziviani, N., editor(s), SPIRE, volume 7608, of Lecture Notes in Computer Science, pages 307-317, 2012. Springer
Computing Discriminating and Generic Words. [link]Link   Computing Discriminating and Generic Words. [link]Paper   link   bibtex  
Cross-Document Pattern Matching. Kucherov, G.; Nekrich, Y.; and Starikovskaya, T. In Kärkkäinen, J.; and Stoye, J., editor(s), CPM, volume 7354, of Lecture Notes in Computer Science, pages 196-207, 2012. Springer
Cross-Document Pattern Matching. [link]Link   Cross-Document Pattern Matching. [link]Paper   link   bibtex  
Cross-Document Pattern Matching. Kucherov, G.; Nekrich, Y.; and Starikovskaya, T. CoRR, abs/1202.4076. 2012.
Cross-Document Pattern Matching [link]Link   Cross-Document Pattern Matching [link]Paper   link   bibtex  
Space-efficient range reporting for categorical data. Nekrich, Y. In Benedikt, M.; Krötzsch, M.; and Lenzerini, M., editor(s), PODS, pages 113-120, 2012. ACM
Space-efficient range reporting for categorical data. [link]Link   Space-efficient range reporting for categorical data. [link]Paper   link   bibtex  
  2011 (8)
Tight bounds for online stable sorting. Gagie, T.; and Nekrich, Y. J. Discrete Algorithms, 9(2): 176-181. 2011.
Tight bounds for online stable sorting. [link]Link   Tight bounds for online stable sorting. [link]Paper   link   bibtex  
Top-K Color Queries for Document Retrieval. Karpinski, M.; and Nekrich, Y. In Randall, D., editor(s), SODA, pages 401-411, 2011. SIAM
Top-K Color Queries for Document Retrieval. [link]Link   Top-K Color Queries for Document Retrieval. [link]Paper   link   bibtex  
A Fast Algorithm for Three-Dimensional Layers of Maxima Problem. Nekrich, Y. In Dehne, F.; Iacono, J.; and Sack, J., editor(s), WADS, volume 6844, of Lecture Notes in Computer Science, pages 607-618, 2011. Springer
A Fast Algorithm for Three-Dimensional Layers of Maxima Problem. [link]Link   A Fast Algorithm for Three-Dimensional Layers of Maxima Problem. [link]Paper   link   bibtex  
A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time. Nekrich, Y. In Asano, T.; Nakano, S.; Okamoto, Y.; and Watanabe, O., editor(s), ISAAC, volume 7074, of Lecture Notes in Computer Science, pages 170-179, 2011. Springer
A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time. [link]Link   A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time. [link]Paper   link   bibtex  
External Memory Orthogonal Range Reporting with Fast Updates. Nekrich, Y. In Asano, T.; Nakano, S.; Okamoto, Y.; and Watanabe, O., editor(s), ISAAC, volume 7074, of Lecture Notes in Computer Science, pages 395-404, 2011. Springer
External Memory Orthogonal Range Reporting with Fast Updates. [link]Link   External Memory Orthogonal Range Reporting with Fast Updates. [link]Paper   link   bibtex  
A Compressed Self-Index for Genomic Databases. Gagie, T.; Kärkkäinen, J.; Nekrich, Y.; and Puglisi, S. J. CoRR, abs/1111.1355. 2011.
A Compressed Self-Index for Genomic Databases [link]Link   A Compressed Self-Index for Genomic Databases [link]Paper   link   bibtex  
A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time. Nekrich, Y. CoRR, abs/1109.3890. 2011.
A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time [link]Link   A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time [link]Paper   link   bibtex  
External Memory Orthogonal Range Reporting with Fast Updates. Nekrich, Y. CoRR, abs/1106.6261. 2011.
External Memory Orthogonal Range Reporting with Fast Updates [link]Link   External Memory Orthogonal Range Reporting with Fast Updates [link]Paper   link   bibtex  
  2010 (9)
Alphabet Partitioning for Compressed Rank/Select and Applications. Barbay, J.; Gagie, T.; Navarro, G.; and Nekrich, Y. In Cheong, O.; Chwa, K.; and Park, K., editor(s), ISAAC (2), volume 6507, of Lecture Notes in Computer Science, pages 315-326, 2010. Springer
Alphabet Partitioning for Compressed Rank/Select and Applications. [link]Link   Alphabet Partitioning for Compressed Rank/Select and Applications. [link]Paper   link   bibtex  
Fast and Compact Prefix Codes. Gagie, T.; Navarro, G.; and Nekrich, Y. In van Leeuwen, J.; Muscholl, A.; Peleg, D.; Pokorný, J.; and Rumpe, B., editor(s), SOFSEM, volume 5901, of Lecture Notes in Computer Science, pages 419-427, 2010. Springer
Fast and Compact Prefix Codes. [link]Link   Fast and Compact Prefix Codes. [link]Paper   link   bibtex  
Approximating range-aggregate queries using coresets. Nekrich, Y.; and Smid, M. H. M. In CCCG, pages 253-256, 2010.
Approximating range-aggregate queries using coresets. [pdf]Link   Approximating range-aggregate queries using coresets. [link]Paper   link   bibtex  
Dynamic Range Reporting in External Memory. Nekrich, Y. In Cheong, O.; Chwa, K.; and Park, K., editor(s), ISAAC (2), volume 6507, of Lecture Notes in Computer Science, pages 25-36, 2010. Springer
Dynamic Range Reporting in External Memory. [link]Link   Dynamic Range Reporting in External Memory. [link]Paper   link   bibtex  
Range Reporting for Moving Points on a Grid. Karpinski, M.; Munro, J. I.; and Nekrich, Y. CoRR, abs/1002.3511. 2010.
Range Reporting for Moving Points on a Grid [link]Link   Range Reporting for Moving Points on a Grid [link]Paper   link   bibtex  
Searching in Dynamic Catalogs on a Tree. Nekrich, Y. CoRR, abs/1007.3415. 2010.
Searching in Dynamic Catalogs on a Tree [link]Link   Searching in Dynamic Catalogs on a Tree [link]Paper   link   bibtex  
Top-K Color Queries for Document Retrieval. Karpinski, M.; and Nekrich, Y. CoRR, abs/1007.1361. 2010.
Top-K Color Queries for Document Retrieval [link]Link   Top-K Color Queries for Document Retrieval [link]Paper   link   bibtex  
Dynamic Range Reporting in External Memory. Nekrich, Y. CoRR, abs/1006.4093. 2010.
Dynamic Range Reporting in External Memory [link]Link   Dynamic Range Reporting in External Memory [link]Paper   link   bibtex  
A Fast Algorithm for Three-Dimensional Layers of Maxima Problem. Nekrich, Y. CoRR, abs/1007.1593. 2010.
A Fast Algorithm for Three-Dimensional Layers of Maxima Problem [link]Link   A Fast Algorithm for Three-Dimensional Layers of Maxima Problem [link]Paper   link   bibtex  
  2009 (11)
Alphabet Partitioning for Compressed Rank/Select with Applications. Barbay, J.; Gagie, T.; Navarro, G.; and Nekrich, Y. CoRR, abs/0911.4981. 2009.
Alphabet Partitioning for Compressed Rank/Select with Applications [link]Link   Alphabet Partitioning for Compressed Rank/Select with Applications [link]Paper   link   bibtex  
Fast and Compact Prefix Codes. Gagie, T.; Navarro, G.; and Nekrich, Y. CoRR, abs/0905.3107. 2009.
Fast and Compact Prefix Codes [link]Link   Fast and Compact Prefix Codes [link]Paper   link   bibtex  
Low-Memory Adaptive Prefix Coding. Gagie, T.; Karpinski, M.; and Nekrich, Y. In Storer, J. A.; and Marcellin, M. W., editor(s), DCC, pages 13-22, 2009. IEEE Computer Society
Low-Memory Adaptive Prefix Coding. [link]Link   Low-Memory Adaptive Prefix Coding. [link]Paper   link   bibtex  
Worst-Case Optimal Adaptive Prefix Coding. Gagie, T.; and Nekrich, Y. In Dehne, F. K. H. A.; Gavrilova, M. L.; Sack, J.; and Tóth, C. D., editor(s), WADS, volume 5664, of Lecture Notes in Computer Science, pages 315-326, 2009. Springer
Worst-Case Optimal Adaptive Prefix Coding. [link]Link   Worst-Case Optimal Adaptive Prefix Coding. [link]Paper   link   bibtex  
Orthogonal range searching in linear and almost-linear space. Nekrich, Y. Comput. Geom., 42(4): 342-351. 2009.
Orthogonal range searching in linear and almost-linear space. [link]Link   Orthogonal range searching in linear and almost-linear space. [link]Paper   link   bibtex  
A Linear Space Data Structure for Orthogonal Range Reporting and Emptiness Queries. Nekrich, Y. Int. J. Comput. Geom. Appl., 19(1): 1-15. 2009.
A Linear Space Data Structure for Orthogonal Range Reporting and Emptiness Queries. [link]Link   A Linear Space Data Structure for Orthogonal Range Reporting and Emptiness Queries. [link]Paper   link   bibtex  
A Fast Algorithm for Adaptive Prefix Coding. Karpinski, M.; and Nekrich, Y. Algorithmica, 55(1): 29-41. 2009.
A Fast Algorithm for Adaptive Prefix Coding. [link]Link   A Fast Algorithm for Adaptive Prefix Coding. [link]Paper   link   bibtex  
Space Efficient Multi-dimensional Range Reporting. Karpinski, M.; and Nekrich, Y. In Ngo, H. Q., editor(s), COCOON, volume 5609, of Lecture Notes in Computer Science, pages 215-224, 2009. Springer
Space Efficient Multi-dimensional Range Reporting. [link]Link   Space Efficient Multi-dimensional Range Reporting. [link]Paper   link   bibtex  
Data Structures for Approximate Orthogonal Range Counting. Nekrich, Y. In Dong, Y.; Du, D.; and Ibarra, O. H., editor(s), ISAAC, volume 5878, of Lecture Notes in Computer Science, pages 183-192, 2009. Springer
Data Structures for Approximate Orthogonal Range Counting. [link]Link   Data Structures for Approximate Orthogonal Range Counting. [link]Paper   link   bibtex  
Data Structures for Approximate Range Counting. Nekrich, Y. CoRR, abs/0906.2738. 2009.
Data Structures for Approximate Range Counting [link]Link   Data Structures for Approximate Range Counting [link]Paper   link   bibtex  
Tight Bounds for Online Stable Sorting. Gagie, T.; and Nekrich, Y. CoRR, abs/0907.0741. 2009.
Tight Bounds for Online Stable Sorting [link]Link   Tight Bounds for Online Stable Sorting [link]Paper   link   bibtex  
  2008 (7)
Data Structures with Local Update Operations. Nekrich, Y. In Gudmundsson, J., editor(s), SWAT, volume 5124, of Lecture Notes in Computer Science, pages 138-147, 2008. Springer
Data Structures with Local Update Operations. [link]Link   Data Structures with Local Update Operations. [link]Paper   link   bibtex  
Searching for Frequent Colors in Rectangles. Karpinski, M.; and Nekrich, Y. CoRR, abs/0805.1348. 2008.
Searching for Frequent Colors in Rectangles [link]Link   Searching for Frequent Colors in Rectangles [link]Paper   link   bibtex  
Low-Memory Adaptive Prefix Coding. Gagie, T.; Karpinski, M.; and Nekrich, Y. CoRR, abs/0811.3602. 2008.
Low-Memory Adaptive Prefix Coding [link]Link   Low-Memory Adaptive Prefix Coding [link]Paper   link   bibtex  
Space-Efficient Multi-Dimensional Range Reporting. Karpinski, M.; and Nekrich, Y. CoRR, abs/0806.4361. 2008.
Space-Efficient Multi-Dimensional Range Reporting [link]Link   Space-Efficient Multi-Dimensional Range Reporting [link]Paper   link   bibtex  
Worst-Case Optimal Adaptive Prefix Coding. Gagie, T.; and Nekrich, Y. CoRR, abs/0812.3306. 2008.
Worst-Case Optimal Adaptive Prefix Coding [link]Link   Worst-Case Optimal Adaptive Prefix Coding [link]Paper   link   bibtex  
Searching for Frequent Colors in Rectangles. Karpinski, M.; and Nekrich, Y. In CCCG, 2008.
Searching for Frequent Colors in Rectangles. [link]Link   Searching for Frequent Colors in Rectangles. [link]Paper   link   bibtex  
I/O-Efficient Point Location in a Set of Rectangles. Nekrich, Y. In Laber, E. S.; Bornstein, C. F.; Nogueira, L. T.; and Faria, L., editor(s), LATIN, volume 4957, of Lecture Notes in Computer Science, pages 687-698, 2008. Springer
I/O-Efficient Point Location in a Set of Rectangles. [link]Link   I/O-Efficient Point Location in a Set of Rectangles. [link]Paper   link   bibtex  
  2007 (7)
An Efficient Implementation of Adaptive Prefix Coding. Nekrich, Y. In DCC, pages 396, 2007. IEEE Computer Society
An Efficient Implementation of Adaptive Prefix Coding. [link]Link   An Efficient Implementation of Adaptive Prefix Coding. [link]Paper   link   bibtex  
A data structure for multi-dimensional range reporting. Nekrich, Y. In Erickson, J., editor(s), SCG, pages 344-353, 2007. ACM
A data structure for multi-dimensional range reporting. [link]Link   A data structure for multi-dimensional range reporting. [link]Paper   link   bibtex  
Optimal trade-off for Merkle tree traversal. Berman, P.; Karpinski, M.; and Nekrich, Y. Theor. Comput. Sci., 372(1): 26-36. 2007.
Optimal trade-off for Merkle tree traversal. [link]Link   Optimal trade-off for Merkle tree traversal. [link]Paper   link   bibtex  
Approximating Huffman codes in parallel. Berman, P.; Karpinski, M.; and Nekrich, Y. J. Discrete Algorithms, 5(3): 479-490. 2007.
Approximating Huffman codes in parallel. [link]Link   Approximating Huffman codes in parallel. [link]Paper   link   bibtex  
Space Efficient Dynamic Orthogonal Range Reporting. Nekrich, Y. Algorithmica, 49(2): 94-108. 2007.
Space Efficient Dynamic Orthogonal Range Reporting. [link]Link   Space Efficient Dynamic Orthogonal Range Reporting. [link]Paper   link   bibtex  
Orthogonal Range Searching in Linear and Almost-Linear Space. Nekrich, Y. In Dehne, F. K. H. A.; Sack, J.; and Zeh, N., editor(s), WADS, volume 4619, of Lecture Notes in Computer Science, pages 15-26, 2007. Springer
Orthogonal Range Searching in Linear and Almost-Linear Space. [link]Link   Orthogonal Range Searching in Linear and Almost-Linear Space. [link]Paper   link   bibtex  
External Memory Range Reporting on a Grid. Nekrich, Y. In Tokuyama, T., editor(s), ISAAC, volume 4835, of Lecture Notes in Computer Science, pages 525-535, 2007. Springer
External Memory Range Reporting on a Grid. [link]Link   External Memory Range Reporting on a Grid. [link]Paper   link   bibtex  
  2006 (3)
A Linear Space Data Structure for Orthogonal Range Reporting and Emptiness Queries. Nekrich, Y. In CCCG, 2006.
A Linear Space Data Structure for Orthogonal Range Reporting and Emptiness Queries. [pdf]Link   A Linear Space Data Structure for Orthogonal Range Reporting and Emptiness Queries. [link]Paper   link   bibtex  
Algorithms for Construction of Optimal and Almost-optimal Length-restricted Codes. Karpinski, M.; and Nekrich, Y. Parallel Process. Lett., 16(1): 81-92. 2006.
Algorithms for Construction of Optimal and Almost-optimal Length-restricted Codes. [link]Link   Algorithms for Construction of Optimal and Almost-optimal Length-restricted Codes. [link]Paper   link   bibtex  
A Fast Algorithm for Adaptive Prefix Coding. Karpinski, M.; and Nekrich, Y. In ISIT, pages 592-596, 2006. IEEE
A Fast Algorithm for Adaptive Prefix Coding. [link]Link   A Fast Algorithm for Adaptive Prefix Coding. [link]Paper   link   bibtex  
  2005 (5)
Algorithms for Construction of Optimal and Almost-Optimal Length-Restricted Codes. Karpinski, M.; and Nekrich, Y. In DCC, pages 464, 2005. IEEE Computer Society
Algorithms for Construction of Optimal and Almost-Optimal Length-Restricted Codes. [link]Link   Algorithms for Construction of Optimal and Almost-Optimal Length-Restricted Codes. [link]Paper   link   bibtex