Yakov Nekrich - RankMe

162 papers A* 20A 8B 25C 4Misc 2Journal 82Unranked 19

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Optimal-Cost Construction of Shallow Cuttings for 3-D Dominance Ranges in the I/O-Model. CoRR Yakov Nekrich, Saladi Rahul
2025	A*	`conf`	Convexity Helps Iterated Search in 3D. SoCG Peyman Afshani, Yakov Nekrich, Frank Staals
2025	J	`jnl`	Convexity Helps Iterated Search in 3D. CoRR Peyman Afshani, Yakov Nekrich, Frank Staals
2025	A*	`conf`	Incremental Planar Nearest Neighbor Queries with Optimal Query Time. SoCG John Iacono, Yakov Nekrich
2025	J	`jnl`	Incremental Planar Nearest Neighbor Queries with Optimal Query Time. CoRR John Iacono, Yakov Nekrich
2025	J	`jnl`	Online computation of normalized substring complexity. CoRR Gregory Kucherov, Yakov Nekrich
2025	A*	`conf`	Top- SODA Gonzalo Navarro, Yakov Nekrich
2024	—	`conf`	Size-Constrained Weighted Ancestors with Applications. SWAT Philip Bille, Yakov Nekrich, Solon P. Pissis
2023	A*	`conf`	4D Range Reporting in the Pointer Machine Model in Almost-Optimal Time. SODA Yakov Nekrich, Saladi Rahul
2023	J	`jnl`	Size-constrained Weighted Ancestors with Applications. CoRR Philip Bille, Yakov Nekrich, Solon P. Pissis
2023	—	`conf`	Sum-of-Local-Effects Data Structures for Separable Graphs. COCOON (1) Xing Lyu, Travis Gagie, Meng He, Yakov Nekrich, Norbert Zeh
2023	J	`jnl`	Sum-of-Local-Effects Data Structures for Separable Graphs. CoRR Xing Lyu, Travis Gagie, Meng He, Yakov Nekrich, Norbert Zeh
2022	J	`jnl`	4D Range Reporting in the Pointer Machine Model in Almost-Optimal Time. CoRR Yakov Nekrich, Saladi Rahul
2022	B	`conf`	External-Memory Dictionaries with Worst-Case Update Cost. ISAAC Rathish Das, John Iacono, Yakov Nekrich
2022	J	`jnl`	External-memory dictionaries with worst-case update cost. CoRR Rathish Das, John Iacono, Yakov Nekrich
2022	J	`jnl`	Finding a Maximum Clique in a Grounded 1-Bend String Graph. J. Graph Algorithms Appl. J. Mark Keil, Debajyoti Mondal, Ehsan Moradi, Yakov Nekrich
2022	J	`jnl`	Orthogonal point location and rectangle stabbing queries in 3-d. J. Comput. Geom. Timothy M. Chan, Yakov Nekrich, Saladi Rahul, Konstantinos Tsakalidis
2021	A*	`conf`	Dynamic planar point location in optimal time. STOC Yakov Nekrich
2021	J	`jnl`	Finding a Maximum Clique in a Grounded 1-Bend String Graph. CoRR J. Mark Keil, Debajyoti Mondal, Ehsan Moradi, Yakov Nekrich
2021	A*	`conf`	New Data Structures for Orthogonal Range Reporting and Range Minima Queries. SODA Yakov Nekrich
2021	J	`jnl`	Range Majorities and Minorities in Arrays. Algorithmica Djamal Belazzougui, Travis Gagie, J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
2020	J	`jnl`	A linear-space data structure for range-LCP queries in poly-logarithmic time. Theor. Comput. Sci. Paniz Abedin, Arnab Ganguly, Wing-Kai Hon, Kotaro Matsuda, Yakov Nekrich, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan
2020	A*	`conf`	Better Data Structures for Colored Orthogonal Range Reporting. SODA Timothy M. Chan, Yakov Nekrich
2020	J	`jnl`	Breadth-First Rank/Select in Succinct Trees and Distance Oracles for Interval Graphs. CoRR Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu
2020	B	`conf`	Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees. ISAAC Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu
2020	J	`jnl`	Fast Compressed Self-indexes with Deterministic Linear-Time Construction. Algorithmica J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
2020	A	`conf`	Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing. ESA Younan Gao, Meng He, Yakov Nekrich
2020	J	`jnl`	Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing. CoRR Younan Gao, Meng He, Yakov Nekrich
2020	A*	`conf`	Four-Dimensional Dominance Range Reporting in Linear Space. SoCG Yakov Nekrich
2020	J	`jnl`	Four-Dimensional Dominance Range Reporting in Linear Space. CoRR Yakov Nekrich
2020	A*	`conf`	Further Results on Colored Range Searching. SoCG Timothy M. Chan, Qizheng He, Yakov Nekrich
2020	J	`jnl`	Further Results on Colored Range Searching. CoRR Timothy M. Chan, Qizheng He, Yakov Nekrich
2020	J	`jnl`	New Data Structures for Orthogonal Range Reporting and Range Minima Queries. CoRR Yakov Nekrich
2020	J	`jnl`	Parallel computation of the Burrows Wheeler Transform in compact space. Theor. Comput. Sci. José Fuentes-Sepúlveda, Gonzalo Navarro, Yakov Nekrich
2020	B	`conf`	Text Indexing and Searching in Sublinear Time. CPM J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
2019	A	`conf`	Categorical Range Reporting with Frequencies. ICDT Arnab Ganguly, J. Ian Munro, Yakov Nekrich, Rahul Shah, Sharma V. Thankachan
2019	A*	`conf`	Dynamic Planar Point Location in External Memory. SoCG J. Ian Munro, Yakov Nekrich
2019	J	`jnl`	Dynamic Planar Point Location in External Memory. CoRR J. Ian Munro, Yakov Nekrich
2019	B	`conf`	On Approximate Range Mode and Range Selection. ISAAC Hicham El-Zein, Meng He, J. Ian Munro, Yakov Nekrich, Bryce Sandlund
2019	J	`jnl`	On Approximate Range Mode and Range Selection. CoRR Hicham El-Zein, Meng He, J. Ian Munro, Yakov Nekrich, Bryce Sandlund
2019	B	`conf`	Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. WADS Timothy M. Chan, Yakov Nekrich, Michiel H. M. Smid
2019	J	`jnl`	Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. CoRR Timothy M. Chan, Yakov Nekrich, Michiel H. M. Smid
2019	B	`conf`	Space-Efficient Computation of the Burrows-Wheeler Transform. DCC José Fuentes-Sepúlveda, Gonzalo Navarro, Yakov Nekrich
2018	Misc	`conf`	A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time. COCOON Paniz Abedin, Arnab Ganguly, Wing-Kai Hon, Yakov Nekrich, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan
2018	A	`conf`	Dynamic Trees with Almost-Optimal Access Cost. ESA Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich
2018	J	`jnl`	Dynamic Trees with Almost-Optimal Access Cost. CoRR Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich
2018	A*	`conf`	Orthogonal Point Location and Rectangle Stabbing Queries in 3-d. ICALP Timothy M. Chan, Yakov Nekrich, Saladi Rahul, Konstantinos Tsakalidis
2018	J	`jnl`	Orthogonal Point Location and Rectangle Stabbing Queries in 3-d. CoRR Timothy M. Chan, Yakov Nekrich, Saladi Rahul, Konstantinos Tsakalidis
2018	—	`conf`	Succinct Dynamic One-Dimensional Point Reporting. SWAT Hicham El-Zein, J. Ian Munro, Yakov Nekrich
2018	J	`jnl`	Towards an Optimal Method for Dynamic Planar Point Location. SIAM J. Comput. Timothy M. Chan, Yakov Nekrich
2017	B	`conf`	Fast Compressed Self-Indexes with Deterministic Linear-Time Construction. ISAAC J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
2017	J	`jnl`	Fast Compressed Self-Indexes with Deterministic Linear-Time Construction. CoRR J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
2017	J	`jnl`	Full-Fledged Real-Time Indexing for Constant Size Alphabets. Algorithmica Gregory Kucherov, Yakov Nekrich
2017	A*	`conf`	Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time. SODA J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
2017	B	`conf`	Succinct Color Searching in One Dimension. ISAAC Hicham El-Zein, J. Ian Munro, Yakov Nekrich
2017	J	`jnl`	Text Indexing and Searching in Sublinear Time. CoRR J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
2017	J	`jnl`	Time-Optimal Top-k Document Retrieval. SIAM J. Comput. Gonzalo Navarro, Yakov Nekrich
2016	J	`jnl`	Document retrieval with one wildcard. Theor. Comput. Sci. Moshe Lewenstein, J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan
2016	J	`jnl`	Fast construction of wavelet trees. Theor. Comput. Sci. J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter
2016	—	`ch.`	Orthogonal Range Searching on Discrete Grids. Encyclopedia of Algorithms Yakov Nekrich
2016	J	`jnl`	Range Majorities and Minorities in Arrays. CoRR Djamal Belazzougui, Travis Gagie, J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
2016	J	`jnl`	Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time. CoRR J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
2015	A	`conf`	A Data-Aware FM-index. ALENEX Hongwei Huo, Longgang Chen, Heng Zhao, Jeffrey Scott Vitter, Yakov Nekrich, Qiang Yu
2015	J	`jnl`	An Efficient Exact Algorithm for the Motif Stem Search Problem over Large Alphabets. IEEE ACM Trans. Comput. Biol. Bioinform. Qiang Yu, Hongwei Huo, Jeffrey Scott Vitter, Jun Huan, Yakov Nekrich
2015	A	`conf`	Compressed Data Structures for Dynamic Sequences. ESA J. Ian Munro, Yakov Nekrich
2015	J	`jnl`	Compressed Data Structures for Dynamic Sequences. CoRR J. Ian Munro, Yakov Nekrich
2015	A*	`conf`	Dynamic Data Structures for Document Collections and Graphs. PODS J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter
2015	J	`jnl`	Dynamic Data Structures for Document Collections and Graphs. CoRR J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter
2015	J	`jnl`	Efficient and Compact Representations of Prefix Codes. IEEE Trans. Inf. Theory Travis Gagie, Gonzalo Navarro, Yakov Nekrich, Alberto Ordóñez Pereira
2015	—	`conf`	Range Counting with Distinct Constraints. CCCG J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan
2015	A*	`conf`	Towards an Optimal Method for Dynamic Planar Point Location. FOCS Timothy M. Chan, Yakov Nekrich
2014	B	`conf`	A Practical Implementation of Compressed Suffix Arrays with Applications to Self-Indexing. DCC Hongwei Huo, Longgang Chen, Jeffrey Scott Vitter, Yakov Nekrich
2014	A*	`conf`	Categorical range maxima queries. PODS Manish Patil, Sharma V. Thankachan, Rahul Shah, Yakov Nekrich, Jeffrey Scott Vitter
2014	J	`jnl`	Cross-document pattern matching. J. Discrete Algorithms Tsvi Kopelowitz, Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya
2014	—	`conf`	Document Retrieval with One Wildcard. MFCS (2) Moshe Lewenstein, J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan
2014	J	`jnl`	Efficient Fully-Compressed Sequence Representations. Algorithmica Jérémy Barbay, Francisco Claude, Travis Gagie, Gonzalo Navarro, Yakov Nekrich
2014	J	`jnl`	Efficient and Compact Representations of Prefix Codes. CoRR Travis Gagie, Gonzalo Navarro, Yakov Nekrich, Alberto Ordóñez Pereira
2014	J	`jnl`	Efficient range searching for categorical and plain data. ACM Trans. Database Syst. Yakov Nekrich
2014	C	`conf`	Fast Construction of Wavelet Trees. SPIRE J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter
2014	B	`conf`	LZ77-Based Self-indexing with Faster Pattern Matching. LATIN Travis Gagie, Pawel Gawrychowski, Juha Kärkkäinen, Yakov Nekrich, Simon J. Puglisi
2014	J	`jnl`	Optimal Dynamic Sequence Representations. SIAM J. Comput. Gonzalo Navarro, Yakov Nekrich
2014	A	`conf`	Space-Efficient String Indexing for Wildcard Pattern Matching. STACS Moshe Lewenstein, Yakov Nekrich, Jeffrey Scott Vitter
2014	J	`jnl`	Space-Efficient String Indexing for Wildcard Pattern Matching. CoRR Moshe Lewenstein, Yakov Nekrich, Jeffrey Scott Vitter
2013	J	`jnl`	External Memory orthogonal Range Reporting with Fast Updates. Int. J. Comput. Geom. Appl. Yakov Nekrich
2013	—	`conf`	Full-Fledged Real-Time Indexing for Constant Size Alphabets. ICALP (1) Gregory Kucherov, Yakov Nekrich
2013	J	`jnl`	Full-fledged Real-Time Indexing for Constant Size Alphabets CoRR Gregory Kucherov, Yakov Nekrich
2013	J	`jnl`	Heaviest Induced Ancestors and Longest Common Substrings CoRR Travis Gagie, Pawel Gawrychowski, Yakov Nekrich
2013	—	`conf`	Heaviest Induced Ancestors and Longest Common Substrings. CCCG Travis Gagie, Pawel Gawrychowski, Yakov Nekrich
2013	C	`conf`	Minimal Discriminating Words Problem Revisited. SPIRE Pawel Gawrychowski, Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya
2013	A	`conf`	Optimal Color Range Reporting in One Dimension. ESA Yakov Nekrich, Jeffrey Scott Vitter
2013	J	`jnl`	Optimal Color Range Reporting in One Dimension. CoRR Yakov Nekrich, Jeffrey Scott Vitter
2013	A*	`conf`	Optimal Dynamic Sequence Representations. SODA Gonzalo Navarro, Yakov Nekrich
2013	J	`jnl`	Optimal Top-k Document Retrieval. CoRR Gonzalo Navarro, Yakov Nekrich
2013	J	`jnl`	Space-efficient data-analysis queries on grids. Theor. Comput. Sci. Gonzalo Navarro, Yakov Nekrich, Luís M. S. Russo
2013	—	`conf`	StemFinder: An efficient algorithm for searching motif stems over large alphabets. BIBM Qiang Yu, Hongwei Huo, Jeffrey Scott Vitter, Jun Huan, Yakov Nekrich
2012	C	`conf`	A Faster Grammar-Based Self-index. LATA Travis Gagie, Pawel Gawrychowski, Juha Kärkkäinen, Yakov Nekrich, Simon J. Puglisi
2012	C	`conf`	Computing Discriminating and Generic Words. SPIRE Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya
2012	J	`jnl`	Cross-Document Pattern Matching CoRR Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya
2012	B	`conf`	Cross-Document Pattern Matching. CPM Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya
2012	J	`jnl`	Optimal Dynamic Sequence Representations. CoRR Gonzalo Navarro, Yakov Nekrich
2012	J	`jnl`	Sorted Range Reporting CoRR Yakov Nekrich, Gonzalo Navarro
2012	—	`conf`	Sorted Range Reporting. SWAT Yakov Nekrich, Gonzalo Navarro
2012	A*	`conf`	Space-efficient range reporting for categorical data. PODS Yakov Nekrich
2012	A*	`conf`	Top- SODA Gonzalo Navarro, Yakov Nekrich
2011	J	`jnl`	A Compressed Self-Index for Genomic Databases CoRR Travis Gagie, Juha Kärkkäinen, Yakov Nekrich, Simon J. Puglisi
2011	J	`jnl`	A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time CoRR Yakov Nekrich
2011	B	`conf`	A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time. ISAAC Yakov Nekrich
2011	B	`conf`	A Fast Algorithm for Three-Dimensional Layers of Maxima Problem. WADS Yakov Nekrich
2011	J	`jnl`	External Memory Orthogonal Range Reporting with Fast Updates CoRR Yakov Nekrich
2011	B	`conf`	External Memory Orthogonal Range Reporting with Fast Updates. ISAAC Yakov Nekrich
2011	J	`jnl`	Tight bounds for online stable sorting. J. Discrete Algorithms Travis Gagie, Yakov Nekrich
2011	A*	`conf`	Top-K Color Queries for Document Retrieval. SODA Marek Karpinski, Yakov Nekrich
2010	J	`jnl`	A Fast Algorithm for Three-Dimensional Layers of Maxima Problem CoRR Yakov Nekrich
2010	—	`conf`	Alphabet Partitioning for Compressed Rank/Select and Applications. ISAAC (2) Jérémy Barbay, Travis Gagie, Gonzalo Navarro, Yakov Nekrich
2010	—	`conf`	Approximating range-aggregate queries using coresets. CCCG Yakov Nekrich, Michiel H. M. Smid
2010	J	`jnl`	Dynamic Range Reporting in External Memory CoRR Yakov Nekrich
2010	—	`conf`	Dynamic Range Reporting in External Memory. ISAAC (2) Yakov Nekrich
2010	B	`conf`	Fast and Compact Prefix Codes. SOFSEM Travis Gagie, Gonzalo Navarro, Yakov Nekrich
2010	J	`jnl`	Range Reporting for Moving Points on a Grid CoRR Marek Karpinski, J. Ian Munro, Yakov Nekrich
2010	J	`jnl`	Searching in Dynamic Catalogs on a Tree CoRR Yakov Nekrich
2010	J	`jnl`	Top-K Color Queries for Document Retrieval CoRR Marek Karpinski, Yakov Nekrich
2009	J	`jnl`	A Fast Algorithm for Adaptive Prefix Coding. Algorithmica Marek Karpinski, Yakov Nekrich
2009	J	`jnl`	A Linear Space Data Structure for Orthogonal Range Reporting and Emptiness Queries. Int. J. Comput. Geom. Appl. Yakov Nekrich
2009	J	`jnl`	Alphabet Partitioning for Compressed Rank/Select with Applications CoRR Jérémy Barbay, Travis Gagie, Gonzalo Navarro, Yakov Nekrich
2009	B	`conf`	Data Structures for Approximate Orthogonal Range Counting. ISAAC Yakov Nekrich
2009	J	`jnl`	Data Structures for Approximate Range Counting CoRR Yakov Nekrich
2009	J	`jnl`	Fast and Compact Prefix Codes CoRR Travis Gagie, Gonzalo Navarro, Yakov Nekrich
2009	B	`conf`	Low-Memory Adaptive Prefix Coding. DCC Travis Gagie, Marek Karpinski, Yakov Nekrich
2009	J	`jnl`	Orthogonal range searching in linear and almost-linear space. Comput. Geom. Yakov Nekrich
2009	Misc	`conf`	Space Efficient Multi-dimensional Range Reporting. COCOON Marek Karpinski, Yakov Nekrich
2009	J	`jnl`	Tight Bounds for Online Stable Sorting CoRR Travis Gagie, Yakov Nekrich
2009	B	`conf`	Worst-Case Optimal Adaptive Prefix Coding. WADS Travis Gagie, Yakov Nekrich
2008	—	`conf`	Data Structures with Local Update Operations. SWAT Yakov Nekrich
2008	B	`conf`	I/O-Efficient Point Location in a Set of Rectangles. LATIN Yakov Nekrich
2008	J	`jnl`	Low-Memory Adaptive Prefix Coding CoRR Travis Gagie, Marek Karpinski, Yakov Nekrich
2008	J	`jnl`	Searching for Frequent Colors in Rectangles CoRR Marek Karpinski, Yakov Nekrich
2008	—	`conf`	Searching for Frequent Colors in Rectangles. CCCG Marek Karpinski, Yakov Nekrich
2008	J	`jnl`	Space-Efficient Multi-Dimensional Range Reporting CoRR Marek Karpinski, Yakov Nekrich
2008	J	`jnl`	Worst-Case Optimal Adaptive Prefix Coding CoRR Travis Gagie, Yakov Nekrich
2007	—	`conf`	A data structure for multi-dimensional range reporting. SCG Yakov Nekrich
2007	B	`conf`	An Efficient Implementation of Adaptive Prefix Coding. DCC Yakov Nekrich
2007	J	`jnl`	Approximating Huffman codes in parallel. J. Discrete Algorithms Piotr Berman, Marek Karpinski, Yakov Nekrich
2007	B	`conf`	External Memory Range Reporting on a Grid. ISAAC Yakov Nekrich
2007	J	`jnl`	Optimal trade-off for Merkle tree traversal. Theor. Comput. Sci. Piotr Berman, Marek Karpinski, Yakov Nekrich
2007	B	`conf`	Orthogonal Range Searching in Linear and Almost-Linear Space. WADS Yakov Nekrich
2007	J	`jnl`	Space Efficient Dynamic Orthogonal Range Reporting. Algorithmica Yakov Nekrich
2006	B	`conf`	A Fast Algorithm for Adaptive Prefix Coding. ISIT Marek Karpinski, Yakov Nekrich
2006	—	`conf`	A Linear Space Data Structure for Orthogonal Range Reporting and Emptiness Queries. CCCG Yakov Nekrich
2006	J	`jnl`	Algorithms for Construction of Optimal and Almost-optimal Length-restricted Codes. Parallel Process. Lett. Marek Karpinski, Yakov Nekrich
2005	B	`conf`	Algorithms for Construction of Optimal and Almost-Optimal Length-Restricted Codes. DCC Marek Karpinski, Yakov Nekrich
2005	—	`conf`	Optimal Trade-Off for Merkle Tree Traversal. ICETE (Selected Papers) Piotr Berman, Marek Karpinski, Yakov Nekrich
2005	—	`conf`	Optimal trade-off for merkle tree traversal. ICETE Marek Karpinski, Yakov Nekrich
2005	A	`conf`	Predecessor Queries in Constant Time?. ESA Marek Karpinski, Yakov Nekrich
2005	—	`conf`	Space efficient dynamic orthogonal range reporting. SCG Yakov Nekrich
2004	J	`jnl`	A Note on Traversing Skew Merkle Trees Electron. Colloquium Comput. Complex. Marek Karpinski, Yakov Nekrich
2004	J	`jnl`	Optimal Trade-Off for Merkle Tree Traversal Electron. Colloquium Comput. Complex. Piotr Berman, Marek Karpinski, Yakov Nekrich
2004	J	`jnl`	Work-Efficient Algorithms For The Construction Of Length-Limited Huffman Codes. Parallel Process. Lett. Marek Karpinski, Lawrence L. Larmore, Yakov Nekrich
2002	J	`jnl`	Approximating Huffman Codes in Parallel Electron. Colloquium Comput. Complex. Piotr Berman, Marek Karpinski, Yakov Nekrich
2002	A*	`conf`	Approximating Huffman Codes in Parallel. ICALP Piotr Berman, Marek Karpinski, Yakov Nekrich
2002	J	`jnl`	Parallel Construction of Minimum Redundancy Length-Limited Codes Electron. Colloquium Comput. Complex. Marek Karpinski, Yakov Nekrich
2001	—	`—`	Huffman coding and its applications. Yakov Nekrich
2000	B	`conf`	Decoding of Canonical Huffman Codes with Look-Up Tables. Data Compression Conference Yakov Nekrich