Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
19 | Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura |
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. ![In: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(9), pp. 1785-1793, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
19 | Shunsuke Kanda, Kazuhiro Morita, Masao Fuketa |
Compressed double-array tries for string dictionaries supporting fast lookup. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Inf. Syst. ![In: Knowl. Inf. Syst. 51(3), pp. 1023-1042, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
19 | Aleksandar Prokopec |
Analysis of Concurrent Lock-Free Hash Tries with Constant-Time Operations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1712.09636, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
19 | Aleksandar Prokopec, Phil Bagwell, Martin Odersky |
Cache-Aware Lock-Free Concurrent Hash Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1709.06056, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
19 | Johannes Fischer 0001, Dominik Köppl |
Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1706.03035, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
19 | Marcel Ehrhardt, Wolfgang Mulzer |
Delta-Fast Tries: Local Searches in Bounded Universes with Linear Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures - 15th International Symposium, WADS 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings, pp. 361-372, 2017, Springer, 978-3-319-62126-5. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
19 | Johannes Fischer 0001, Dominik Köppl |
Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings, pp. 191-207, 2017, Springer, 978-3-319-67427-8. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
19 | Tony Finch |
QP tries are smaller and faster than crit-bit trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Tiny Trans. Comput. Sci. ![In: Tiny Trans. Comput. Sci. 4, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
19 | Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi |
Linear-size suffix tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 638, pp. 171-178, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
19 | Michael Drmota, Abram Magner, Wojciech Szpankowski |
Asymmetric Rényi Problem and PATRICIA Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1605.01814, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
19 | Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura |
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1602.00422, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
19 | Nicolai Diethelm |
Randomized Ternary Search Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1606.04042, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
19 | Michael J. Steindorfer, Jurgen J. Vinju |
Fast and Lean Immutable Multi-Maps on the JVM based on Heterogeneous Hash-Array Mapped Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1608.01036, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
19 | Michael Fuchs 0001, Hsien-Kuei Hwang |
Dependence between External Path-Length and Size in Random Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1604.08658, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
19 | Junichiro Fukuyama |
Partial-Match Queries with Random Wildcards: In Tries and Distributed Hash Tables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1601.04213, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
19 | Lerrel Pinto, Abhinav Gupta 0001 |
Supersizing self-supervision: Learning to grasp from 50K tries and 700 robot hours. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICRA ![In: 2016 IEEE International Conference on Robotics and Automation, ICRA 2016, Stockholm, Sweden, May 16-21, 2016, pp. 3406-3413, 2016, IEEE, 978-1-4673-8026-3. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
19 | Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura |
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings, pp. 213-225, 2016, Springer, 978-3-319-44542-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
19 | Manu Goel, Kanu Goel |
FP-Growth Implementation Using Tries for Association Rule Mining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SocProS (2) ![In: Proceedings of Sixth International Conference on Soft Computing for Problem Solving - SocProS 2016, Volume 2, Thapar University, Patiala, India, December 23-24, 2016., pp. 21-29, 2016, 978-981-10-3324-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
19 | Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
Constructing LZ78 tries and position heaps in linear time for large alphabets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 115(9), pp. 655-659, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
19 | Jesper Jansson 0001, Kunihiko Sadakane, Wing-Kin Sung |
Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 71(4), pp. 969-988, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
19 | Siavash Sheikhizadeh, Dick de Ridder |
ACE: accurate correction of errors using K-mer tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bioinform. ![In: Bioinform. 31(19), pp. 3216-3218, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
19 | Sven Groppe, Dennis Heinrich, Stefan Werner 0002, Christopher Blochwitz, Thilo Pionteck |
PatTrieSort - External String Sorting based on Patricia Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Open J. Databases ![In: Open J. Databases 2(1), pp. 36-50, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
19 | Lerrel Pinto, Abhinav Gupta 0001 |
Supersizing Self-supervision: Learning to Grasp from 50K Tries and 700 Robot Hours. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1509.06825, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
19 | Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
Constructing LZ78 Tries and Position Heaps in Linear Time for Large Alphabets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1501.06619, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
19 | Kevin Leckey, Ralph Neininger, Wojciech Szpankowski |
A Limit Theorem for Radix Sort and Tries with Markovian Input. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1505.07321, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
19 | Peggy Cénac, Brigitte Chauvin, Frédéric Paccaut, Nicolas Pouyanne |
Uncommon suffix tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 46(1), pp. 117-141, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
19 | Alistair Morris, Constantinos Patsakis, Vinny Cahill, Mélanie Bouroche |
Snapcab: Urban Scale Context-Aware Smart Transport Using Adaptive Context Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCASA ![In: Context-Aware Systems and Applications - 4th International Conference, ICCASA 2015, Vung Tau, Vietnam, November 26-27, 2015, Revised Selected Papers, pp. 31-40, 2015, Springer, 978-3-319-29235-9. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
19 | Michael J. Steindorfer, Jurgen J. Vinju |
Optimizing hash-array mapped tries for fast and lean immutable JVM collections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OOPSLA ![In: Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2015, part of SPLASH 2015, Pittsburgh, PA, USA, October 25-30, 2015, pp. 783-800, 2015, ACM, 978-1-4503-3689-5. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
19 | Takahiro Ota, Hiroyoshi Morita |
On a two-dimensional antidictionary construction using suffix tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIT ![In: IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, China, June 14-19, 2015, pp. 2974-2978, 2015, IEEE, 978-1-4673-7704-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
19 | Michael Cochez, Hao Mou |
Twister Tries: Approximate Hierarchical Agglomerative Clustering for Average Distance in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31 - June 4, 2015, pp. 505-517, 2015, ACM, 978-1-4503-2758-9. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
19 | Philippe Jacquet, Abram Magner |
Variance of Size in Regular Graph Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANALCO ![In: Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2015, San Diego, CA, USA, January 4, 2015, pp. 97-104, 2015, SIAM, 978-1-61197-376-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
19 | Andreas Poyias, Rajeev Raman |
Improved Practical Compact Dynamic Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings, pp. 324-336, 2015, Springer, 978-3-319-23825-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
19 | Michael Cochez, Ferrante Neri |
Scalable Hierarchical Clustering: Twister Tries with a Posteriori Trie Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSCI ![In: IEEE Symposium Series on Computational Intelligence, SSCI 2015, Cape Town, South Africa, December 7-10, 2015, pp. 756-763, 2015, IEEE, 978-1-4799-7560-0. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
19 | Pedro Manuel Pinto Ribeiro, Fernando M. A. Silva |
G-Tries: a data structure for storing and finding subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Data Min. Knowl. Discov. ![In: Data Min. Knowl. Discov. 28(2), pp. 337-377, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
19 | Roberto Grossi, Giuseppe Ottaviano |
Fast Compressed Tries through Path Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 19(1), 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
19 | Miguel Areias 0001, Ricardo Rocha 0001 |
On the Correctness and Efficiency of Lock-Free Expandable Tries for Tabled Logic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PADL ![In: Practical Aspects of Declarative Languages - 16th International Symposium, PADL 2014, San Diego, CA, USA, January 20-21, 2014. Proceedings, pp. 168-183, 2014, Springer, 978-3-319-04131-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
19 | Karen Renaud, Rosanne English, Thomas Wynne, Florian Weber |
You Have Three Tries Before Lockout. Why Three?. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HAISA ![In: Eighth International Symposium on Human Aspects of Information Security & Assurance, HAISA 2014 ,Plymouth, UK, July 8-9, 2014. Proceedings, pp. 101-111, 2014, University of Plymouth, 978-1-84102-375-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
19 | Pramod G. Joisha |
Sticky tries: fast insertions, fast lookups, no deletions for large key universes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMM ![In: International Symposium on Memory Management, ISMM '14, Edinburgh, United Kingdom, June 12, 2014, pp. 35-46, 2014, ACM, 978-1-4503-2921-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
19 | Zachary A. Kissel, Jie Wang 0002 |
A Note on Verifiable Privacy-Preserving Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE CLOUD ![In: 2014 IEEE 7th International Conference on Cloud Computing, Anchorage, AK, USA, June 27 - July 2, 2014, pp. 942-943, 2014, IEEE Computer Society, 978-1-4799-5063-8. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
19 | Michael J. Steindorfer, Jurgen J. Vinju |
Code specialization for memory efficient hash tries (short paper). ![Search on Bibsonomy](Pics/bibsonomy.png) |
GPCE ![In: Generative Programming: Concepts and Experiences, GPCE'14, Vasteras, Sweden, September 15-16, 2014, pp. 11-14, 2014, ACM, 978-1-4503-3161-6. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
19 | Abram Magner, Charles Knessl, Wojciech Szpankowski |
Expected External Profile of PATRICIA Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANALCO ![In: 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2014, Portland, Oregon, USA, January 6, 2014, pp. 16-24, 2014, SIAM, 978-1-61197-320-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
19 | Craig W. Johnson, Craig Harrington, Rodney Howell, Taiwo Akinwande |
Does Allowing Repeated Tries Without Penalty for Incorrect Responses Increase Guessing? ![Search on Bibsonomy](Pics/bibsonomy.png) |
AMIA ![In: AMIA 2014, American Medical Informatics Association Annual Symposium, Washington, DC, USA, November 15-19, 2014, 2014, AMIA. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
19 | Niloufar Shafiei |
Non-blocking Patricia Tries with Replace Operations ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1303.3626, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
19 | Ralph Neininger, Kevin Leckey, Wojciech Szpankowski |
Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013, pp. 877-886, 2013, SIAM, 978-1-61197-251-1. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
19 | Fritz Henglein, Ralf Hinze |
Sorting and Searching by Distribution: From Generic Discrimination to Generic Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APLAS ![In: Programming Languages and Systems - 11th Asian Symposium, APLAS 2013, Melbourne, VIC, Australia, December 9-11, 2013. Proceedings, pp. 315-332, 2013, Springer, 978-3-319-03541-3. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
19 | Niloufar Shafiei |
Non-blocking Patricia Tries with Replace Operations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS ![In: IEEE 33rd International Conference on Distributed Computing Systems, ICDCS 2013, 8-11 July, 2013, Philadelphia, Pennsylvania, USA, pp. 216-225, 2013, IEEE Computer Society, 978-0-7695-5000-8. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
19 | Brice Bognet |
Strate'gies nume'riques avance'es pour la simulation de modèles de'finis sur des ge'ome'tries de plaques et coques : solutions 3D avec une complexite' 2D. (Advanced simulation of models defined in plate and shell geometries: 3D solutions with 2D computational complexity). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2013 |
RDF |
|
19 | Svante Janson |
Renewal theory in the analysis of tries and strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 416, pp. 33-54, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
19 | Kevin Leckey, Ralph Neininger, Wojciech Szpankowski |
Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1207.0302, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
19 | Silvio do Lago Pereira, Leliane Nunes de Barros |
A planner agent that tries its best in presence of nondeterminism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Appl. Log. ![In: J. Appl. Log. 10(4), pp. 419-430, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
19 | Vincent Gripon, Michael G. Rabbat, Vitaly Skachek, Warren J. Gross |
Compressing multisets using tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITW ![In: 2012 IEEE Information Theory Workshop, Lausanne, Switzerland, September 3-7, 2012, pp. 642-646, 2012, IEEE, 978-1-4673-0224-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
19 | Pedro Manuel Pinto Ribeiro, Fernando M. A. Silva |
Querying subgraph sets with g-tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DBSocial ![In: Proceedings of the 2nd ACM SIGMOD Workshop on Databases and Social Networks, DBSocial 2012, Scottsdale, AZ, USA, May 20, 2012, pp. 25-30, 2012, ACM, 978-1-4503-1495-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
19 | Giuseppe Ottaviano, Roberto Grossi |
Fast Compressed Tries through Path Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, ALENEX 2012, The Westin Miyako, Kyoto, Japan, January 16, 2012, pp. 65-74, 2012, SIAM / Omnipress, 978-1-61197-212-2. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
19 | Aleksandar Prokopec, Nathan Grasso Bronson, Phil Bagwell, Martin Odersky |
Concurrent tries with efficient non-blocking snapshots. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPoPP ![In: Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP 2012, New Orleans, LA, USA, February 25-29, 2012, pp. 151-160, 2012, ACM, 978-1-4503-1160-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
19 | Paolo Boldi, Sebastiano Vigna |
E=I+T: The internal extent formula for compacted tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 111(7), pp. 310-313, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
19 | Ming-che Lai, Lei Gao |
Two-level tries: A general acceleration structure for parallel routing table accesses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Commun. Networks ![In: J. Commun. Networks 13(4), pp. 408-417, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
19 | Peggy Cénac, Brigitte Chauvin, Frédéric Paccaut, Nicolas Pouyanne |
Uncommon Suffix Tries ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1112.4131, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
19 | Flávio Cruz, Ricardo Rocha 0001 |
Single Time-Stamped Tries for Retroactive Call Subsumption ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1112.3779, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
19 | Roberto Grossi, Giuseppe Ottaviano |
Fast Compressed Tries through Path Decompositions ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1111.5220, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
19 | Michel Hanna, Sangyeun Cho, Rami G. Melhem |
A Novel Scalable IPv6 Lookup Scheme Using Compressed Pipelined Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networking (1) ![In: NETWORKING 2011 - 10th International IFIP TC 6 Networking Conference, Valencia, Spain, May 9-13, 2011, Proceedings, Part I, pp. 406-419, 2011, Springer, 978-3-642-20756-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
19 | Koray Ak, Olcay Taner Yildiz |
Unsupervised Morphological Analysis Using Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCIS ![In: Computer and Information Sciences II - 26th International Symposium on Computer and Information Sciences, London, UK, 26-28 September 2011, pp. 69-75, 2011, Springer, 978-1-4471-2154-1. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
19 | Aleksandar Prokopec, Phil Bagwell, Martin Odersky |
Lock-Free Resizeable Concurrent Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCPC ![In: Languages and Compilers for Parallel Computing, 24th International Workshop, LCPC 2011, Fort Collins, CO, USA, September 8-10, 2011. Revised Selected Papers, pp. 156-170, 2011, Springer, 978-3-642-36035-0. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
19 | Yi Wu 0011, Ge Nong |
A scalable routing architecture for prefix tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICON ![In: Proceedings of the 17th IEEE International Conference on Networks, ICON 2011, Singapore, December 14-16, 2011, pp. 264-269, 2011, IEEE, 978-1-4577-1824-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
19 | Ioannis Sourdis, Sri Harsha Katamaneni |
Longest Prefix Match and updates in Range Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASAP ![In: 22nd IEEE International Conference on Application-specific Systems, Architectures and Processors, ASAP 2011, Santa Monica, CA, USA, Sept. 11-14, 2011, pp. 51-58, 2011, IEEE Computer Society, 978-1-4577-1291-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
19 | Neil V. Murray, Erik Rosenthal |
Identifying Prime Implicate Branches in Reduced Implicate Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 99(2), pp. 227-243, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
19 | A. G. Alagu Priya, Hyesook Lim |
Hierarchical packet classification using a Bloom filter and rule-priority tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Commun. ![In: Comput. Commun. 33(10), pp. 1215-1226, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
19 | Erik D. Demaine, Stefan Langerman, Eric Price 0001 |
Confluently Persistent Tries for Efficient Version Control. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 57(3), pp. 462-483, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
19 | Hyesook Lim, Changhoon Yim, Earl E. Swartzlander Jr. |
Priority Tries for IP Address Lookup. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 59(6), pp. 784-794, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
binary trie, priority trie, range representation, Internet, router, IP address lookup |
19 | Paolo Boldi, Sebastiano Vigna |
E = I + T: The internal extent formula for compacted tries ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1012.3024, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
19 | Neil V. Murray, Erik Rosenthal |
Reduced Implicate Tries with Updates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 20(1), pp. 261-281, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
19 | Nikolas Askitis, Ranjan Sinha |
Engineering scalable, cache and space efficient tries for strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLDB J. ![In: VLDB J. 19(5), pp. 633-660, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
19 | Gahyun Park, Minseok Kwon |
Distributed tries for load balancing in peer-to-peer systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWQoS ![In: 18th International Workshop on Quality of Service, IWQoS 2010, Beijing, China, 16-18 June 2010., pp. 1-9, 2010, IEEE, 978-1-4244-5987-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
19 | Djamal Belazzougui, Paolo Boldi, Sebastiano Vigna |
Dynamic Z-Fast Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings, pp. 159-172, 2010, Springer, 978-3-642-16320-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
19 | Pedro Manuel Pinto Ribeiro, Fernando M. A. Silva |
Efficient Subgraph Frequency Estimation with G-Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: Algorithms in Bioinformatics, 10th International Workshop, WABI 2010, Liverpool, UK, September 6-8, 2010. Proceedings, pp. 238-249, 2010, Springer, 978-3-642-15293-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
19 | Wencheng Lu, Sartaj Sahni |
Efficient 2D Multibit Tries for Packet Classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 58(12), pp. 1695-1709, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Svante Janson |
Renewal theory in analysis of tries and strings ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0912.2174, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
19 | Luc Devroye, Gábor Lugosi, GaHyun Park, Wojciech Szpankowski |
Multiple choice tries and distributed hash tables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 34(3), pp. 337-367, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
19 | GaHyun Park, Hsien-Kuei Hwang, Pierre Nicodème, Wojciech Szpankowski |
Profiles of Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 38(5), pp. 1821-1880, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Nikolas Askitis, Justin Zobel |
B-tries for disk-based string management. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLDB J. ![In: VLDB J. 18(1), pp. 157-179, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Burst trie, Vocabulary accumulation, Word-level indexing, Data structures, B-tree, Secondary storage |
19 | Neil V. Murray, Erik Rosenthal |
Prime Implicates and Reduced Implicate Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMIS ![In: Foundations of Intelligent Systems, 18th International Symposium, ISMIS 2009, Prague, Czech Republic, September 14-17, 2009. Proceedings, pp. 191-200, 2009, Springer, 978-3-642-04124-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Stas Bevc, Iztok Savnik |
Using tries for subset and superset queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITI ![In: Proceedings of the ITI 2009 31st International Conference on Information Technology Interfaces, Cavtat/Dubrovnik, Croatia, June 22-25, 2009, pp. 147-152, 2009, IEEE, 978-953-7138-15-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Ray R. Larson |
Decomposing Text Processing for Retrieval: Cheshire Tries GRID@CLEF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CLEF (1) ![In: Multilingual Information Access Evaluation I. Text Retrieval Experiments, 10th Workshop of the Cross-Language Evaluation Forum, CLEF 2009, Corfu, Greece, September 30 - October 2, 2009, Revised Selected Papers, pp. 566-569, 2009, Springer, 978-3-642-15753-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Ray R. Larson |
Decomposing Text Processing for Retrieval: Cheshire tries GRID@CLEF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CLEF (Working Notes) ![In: Working Notes for CLEF 2009 Workshop co-located with the 13th European Conference on Digital Libraries (ECDL 2009) , Corfù, Greece, September 30 - October 2, 2009., 2009, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
19 | Andrew Matusiewicz, Neil V. Murray, Erik Rosenthal |
Reduced Implicate Tries and Logical Operations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KEOD ![In: KEOD 2009 - Proceedings of the International Conference on Knowledge Engineering and Ontology Development, Funchal - Madeira, Portugal, October 6-8, 2009, pp. 456-459, 2009, INSTICC Press, 978-989-674-012-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
19 | Ioannis Sourdis, Georgios Stefanakis, Ruben de Smet, Georgi Gaydadjiev |
Range Tries for scalable address lookup. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANCS ![In: Proceedings of the 2009 ACM/IEEE Symposium on Architecture for Networking and Communications Systems, ANCS 2009, Princeton, New Jersey, USA, October 19-20, 2009, pp. 143-152, 2009, ACM, 978-1-60558-630-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Bernd Stefan Eckhardt |
Complexity analysis of tries and spanning tree problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2009 |
RDF |
|
19 | Nicolas Broutin, Luc Devroye |
An Analysis of the Height of Tries with Random Weights on the Edges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. Probab. Comput. ![In: Comb. Probab. Comput. 17(2), pp. 161-202, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Bradford G. Nickerson, Qingxiu Shi |
On k-d Range Search with Patricia Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 37(5), pp. 1373-1386, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | GaHyun Park, Hsien-Kuei Hwang, Pierre Nicodème, Wojciech Szpankowski |
Profile of Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 1-11, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Mian Pan, Haibin Lu |
Build shape-shifting tries for fast IP lookup in O(n) time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Commun. ![In: Comput. Commun. 30(18), pp. 3787-3795, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Neil V. Murray, Erik Rosenthal |
Efficient Query Processing with Reduced Implicate Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 38(1-3), pp. 155-172, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
reduced implicate trie, query processing, knowledge base |
19 | Neil V. Murray, Erik Rosenthal |
Updating Reduced Implicate Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TABLEAUX ![In: Automated Reasoning with Analytic Tableaux and Related Methods, 16th International Conference, TABLEAUX 2007, Aix en Provence, France, July 3-6, 2007, Proceedings, pp. 183-198, 2007, Springer, 978-3-540-73098-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Jesper Jansson 0001, Kunihiko Sadakane, Wing-Kin Sung |
Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings, pp. 424-435, 2007, Springer, 978-3-540-77049-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Ghada Badr, B. John Oommen |
On optimizing syntactic pattern recognition using tries and AI-based heuristic-search strategies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Syst. Man Cybern. Part B ![In: IEEE Trans. Syst. Man Cybern. Part B 36(3), pp. 611-622, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Alberto Apostolico, Yongwook Choi |
Compressing with Collapsible Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITW ![In: 2006 IEEE Information Theory Workshop, ITW 2006, Punta del Este, Uruguay, March 13-17, 2006, pp. 92-96, 2006, IEEE, 1-4244-0036-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Alberto Apostolico, Yongwook Choi |
Textual Compression by Collapsible Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCC ![In: 2006 Data Compression Conference (DCC 2006), 28-30 March 2006, Snowbird, UT, USA, pp. 437, 2006, IEEE Computer Society, 0-7695-2545-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Svante Janson, Wojciech Szpankowski |
Partial Fillup and Search Time in LC Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANALCO ![In: Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2006, Miami, Florida, USA, January 21, 2006, pp. 223-229, 2006, SIAM, 978-1-61197-296-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Muhammad Umer Arshad, Muhammad Naeem Ayyaz |
Mining N-most Interesting Itemsets using Support-Ordered Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AICCSA ![In: 2006 IEEE/ACS International Conference on Computer Systems and Applications (AICCSA 2006), March 8-11, Dubai/Sharjah, UAE, pp. 592-599, 2006, IEEE Computer Society, 1-4244-0211-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Yuriy A. Reznik |
On the average depth of asymmetric LC-tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 96(3), pp. 106-113, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Ranjan Sinha, Justin Zobel |
Using random sampling to build approximate tries for efficient string sorting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 10, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
cache-aware, cache-conscious, in-memory, data structure, Sorting, string |