|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 2318 occurrences of 1673 keywords
|
|
|
Results
Found 2341 publication records. Showing 2341 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
115 | Wencheng Lu, Sartaj Sahni |
Packet Classification Using Space-Efficient Pipelined Multibit Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 57(5), pp. 591-605, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
fixed-stride tries, variable-stride tries, two-dimensional tries, dynamic programming, Packet classification, longest matching prefix, controlled prefix expansion |
103 | Wencheng Lu, Sartaj Sahni |
Packet Classification Using Pipelined Two-Dimensional Multibit Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCC ![In: Proceedings of the 11th IEEE Symposium on Computers and Communications (ISCC 2006), 26-29 June 2006, Cagliari, Sardinia, Italy, pp. 808-813, 2006, IEEE Computer Society, 0-7695-2588-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
fixed-stride tries, variable-stride tries, two-dimensional tries, dynamic programming, Packet classification, longest matching prefix, controlled prefix expansion |
95 | Wencheng Lu, Sartaj Sahni |
Packet Forwarding Using Pipelined Multibit Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCC ![In: Proceedings of the 11th IEEE Symposium on Computers and Communications (ISCC 2006), 26-29 June 2006, Cagliari, Sardinia, Italy, pp. 802-807, 2006, IEEE Computer Society, 0-7695-2588-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
fixed-stride tries, variable-stride tries, dynamic programming, Packet classification, longest matching prefix, controlled prefix expansion |
83 | T. Srinivasan 0001, R. Balakrishnan, S. A. Gangadharan, Hayawardh Vijayakumar |
Supervised Grid-of-Tries: A Novel Framework for Classifier Management. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCN ![In: Distributed Computing and Networking, 8th International Conference, ICDCN 2006, Guwahati, India, December 27-30, 2006., pp. 373-378, 2006, Springer, 3-540-68139-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
grid-of-tries, supervised grid-of-tries, routing, Packet classification |
77 | Wencheng Lu, Sartaj Sahni |
Packet Classification Using Two-Dimensional Multibit Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCC ![In: Proceedings of the 10th IEEE Symposium on Computers and Communications (ISCC 2005), 27-30 June 2005, Murcia, Cartagena, Spain, pp. 849-854, 2005, IEEE Computer Society, 0-7695-2373-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
two-dimensional tries, multibit tries, prefix expansion, dynamic programming, Packet classification |
69 | Svante Janson, Wojciech Szpankowski |
Partial fillup and search time in LC tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(4), pp. 44, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Digital trees, level-compressed tries, partial fillup, trees, probabilistic analysis, strings, Poissonization |
60 | Dow-Yung Yang, Akshay Johar, Ananth Grama, Wojciech Szpankowski |
Summary Structures for Frequency Queries on Large Transaction Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Data Compression Conference ![In: Data Compression Conference, DCC 2000, Snowbird, Utah, USA, March 28-30, 2000., pp. 420-429, 2000, IEEE Computer Society, 0-7695-0592-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Frequency Queries, Patricia Tries, Compressed Tries, Compression, Transactions, Tries, Frequent Sets |
55 | Yuriy A. Reznik |
Some Results on Tries with Adaptive Branching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings, pp. 148-158, 2000, Springer, 3-540-67787-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
53 | Robert W. P. Luk |
Time-Space Trade-Off Analysis of Morphic Trie Images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 13(6), pp. 1028-1032, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
52 | Venkatachary Srinivasan, George Varghese |
Fast Address Lookups Using Controlled Prefix Expansion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Syst. ![In: ACM Trans. Comput. Syst. 17(1), pp. 1-40, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Internet address lookup, binary search on levels, expanded tries, multibit tries, router preformance, longest-prefix match, controlled prefix expansion |
51 | Steffen Heinz, Justin Zobel, Hugh E. Williams |
Burst tries: a fast, efficient data structure for string keys. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Inf. Syst. ![In: ACM Trans. Inf. Syst. 20(2), pp. 192-223, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
string data structures, vocabulary accumulation, Binary trees, text databases, tries, splay trees |
49 | Luc Devroye, Gábor Lugosi, GaHyun Park, Wojciech Szpankowski |
Multiple choice tries and distributed hash tables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 891-899, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
45 | Pedro Manuel Pinto Ribeiro, Fernando M. A. Silva |
g-tries: an efficient data structure for discovering network motifs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), Sierre, Switzerland, March 22-26, 2010, pp. 1559-1566, 2010, ACM, 978-1-60558-639-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
algorithms, data structures, complex networks, graph mining, biological networks, tries, network motifs |
43 | Luc Devroye |
Random Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings, pp. 635, 2002, Springer, 3-540-00142-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
43 | Arne Andersson, Stefan Nilsson |
Faster Searching in Tries and Quadtrees - An Analysis of Level Compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '94, Second Annual European Symposium, Utrecht, The Netherlands, September 26-28, 1994, Proceedings, pp. 82-93, 1994, Springer, 3-540-58434-X. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
43 | Wojciech Szpankowski |
Patricia Tries Again Revisited ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 37(4), pp. 691-711, October 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
40 | Pedro Manuel Pinto Ribeiro, Fernando M. A. Silva, Luís M. B. Lopes |
Efficient Parallel Subgraph Counting Using G-Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CLUSTER ![In: Proceedings of the 2010 IEEE International Conference on Cluster Computing, Heraklion, Crete, Greece, 20-24 September, 2010, pp. 217-226, 2010, IEEE Computer Society, 978-1-4244-8373-0. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
G-Tries, Parallel Algorithms, Complex Networks, Graph Mining, Adaptive Load Balancing |
40 | Marshall D. Brain, Alan L. Tharp |
Using Tries to Eliminate Pattern Collisions in Perfect Hashing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 6(2), pp. 239-247, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
sparse matrix packing algorithm, retrieval function complexity, perfect hashing algorithms, array-based tries, Unix word list, large word lists, function building efficiency, pattern collision avoidance, ordered minimal perfect hashing function, item lists, sparse array packing, computational complexity, Unix, file organisation, ordering, list processing |
39 | Aleksandar Prokopec |
Cache-tries: concurrent lock-free hash tries with constant-time operations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPoPP ![In: Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2018, Vienna, Austria, February 24-28, 2018, pp. 137-151, 2018, ACM, 978-1-4503-4982-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
39 | Weitian Tong, Randy Goebel, Guohui Lin |
Smoothed heights of tries and patricia tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 609, pp. 620-626, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
39 | Michael Fuchs 0001, Chung-Kuei Lee |
A General Central Limit Theorem for Shape Parameters of $m$-ary Tries and PATRICIA Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 21(1), pp. 1, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
39 | Charles Knessl, Wojciech Szpankowski |
Heights in Generalized Tries and PATRICIA Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2000: Theoretical Informatics, 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000, Proceedings, pp. 298-307, 2000, Springer, 3-540-67306-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
37 | GaHyun Park, Wojciech Szpankowski |
Towards a complete characterization of tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 33-42, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
37 | Sartaj Sahni, Kun Suk Kim |
Efficient construction of multibit tries for IP lookup. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 11(4), pp. 650-662, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
multibit trie, dynamic programming, packet routing, longest matching prefix, controlled prefix expansion |
32 | Ghada Badr, B. John Oommen |
A novel look-ahead optimization strategy for trie-based approximate string matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Pattern Anal. Appl. ![In: Pattern Anal. Appl. 9(2-3), pp. 177-187, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Trie-based syntactic pattern recognition, Noisy syntactic recognition using tries, Branch and bound techniques, Pruning, Approximate string matching |
32 | Lars Arge, David Eppstein, Michael T. Goodrich |
Skip-webs: efficient distributed data structures for multi-dimensional data sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005, Las Vegas, NV, USA, July 17-20, 2005, pp. 69-76, 2005, ACM, 1-58113-994-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
trapezoidal maps, peer-to-peer networks, quadtrees, octrees, distributed data structures, tries, skip lists |
31 | Andrew Matusiewicz, Neil V. Murray, Erik Rosenthal |
Prime Implicate Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TABLEAUX ![In: Automated Reasoning with Analytic Tableaux and Related Methods, 18th International Conference, TABLEAUX 2009, Oslo, Norway, July 6-10, 2009. Proceedings, pp. 250-264, 2009, Springer, 978-3-642-02715-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
31 | Neil V. Murray, Erik Rosenthal |
Reduced Implicate/Implicant Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMIS ![In: Foundations of Intelligent Systems, 17th International Symposium, ISMIS 2008, Toronto, Canada, May 20-23, 2008, Proceedings, pp. 203-214, 2008, Springer, 978-3-540-68122-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Haoyu Song 0001, Jonathan S. Turner, John W. Lockwood |
Shape Shifting Tries for Faster IP Route Lookup. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNP ![In: 13th IEEE International Conference on Network Protocols (ICNP 2005), 6-9 November 2005, Boston, MA, USA, pp. 358-367, 2005, IEEE Computer Society, 0-7695-2437-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
31 | Yat-Kin Lam, Qiang Huo |
A Data Structure Using Hashing and Tries For Efficient Chinese Lexical Access. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: Eighth International Conference on Document Analysis and Recognition (ICDAR 2005), 29 August - 1 September 2005, Seoul, Korea, pp. 506-510, 2005, IEEE Computer Society, 0-7695-2420-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
31 | Sartaj Sahni, Kun Suk Kim |
Efficient Construction of Fixed-Stride Multibit Tries for IP Lookup. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FTDCS ![In: 8th IEEE Workshop on Future Trends of Distributed Computer Systems (FTDCS 2001), 31 October, 2 November 2001, Bologna, Italy, Proceedings, pp. 178-184, 2001, IEEE Computer Society, 0-7695-1384-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
multibit trie, dynamic programming, Packet routing, longest matching prefix, controlled prefix expansion |
29 | Conrado Martinez, Alois Panholzer, Helmut Prodinger |
Partial Match Queries in Relaxed Multidimensional Search Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 29(1), pp. 181-204, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
26 | Wencheng Lu, Sartaj Sahni |
Succinct representation of static packet classifiers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 17(3), pp. 803-816, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
one- and two-dimensional tries, dynamic programming, packet classification, succinct representation |
26 | David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman 0001, S. Srinivasa Rao 0001 |
Representing Trees of Higher Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 43(4), pp. 275-292, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Cardinal trees, Ordinal trees, Digital search trees, Data structures, Data compression, Information theory, Hashing, Analysis of algorithms, Dictionary, Tries, Succinct data structures |
26 | Jahangir Hasan, T. N. Vijaykumar |
Dynamic pipelining: making IP-lookup truly scalable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCOMM ![In: Proceedings of the ACM SIGCOMM 2005 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Philadelphia, Pennsylvania, USA, August 22-26, 2005, pp. 205-216, 2005, ACM, 1-59593-009-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
scalable, pipelined, IP-lookup, longest prefix matching, tries |
25 | |
Compact Suffix Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Database Systems ![In: Encyclopedia of Database Systems, pp. 404, 2009, Springer US, 978-0-387-35544-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
25 | Erik D. Demaine, Stefan Langerman, Eric Price 0001 |
Confluently Persistent Tries for Efficient Version Control. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings, pp. 160-172, 2008, Springer, 978-3-540-69900-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | P. Suman Karthik, C. V. Jawahar |
Efficient Region Based Indexing and Retrieval for Images with Elastic Bucket Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR (4) ![In: 18th International Conference on Pattern Recognition (ICPR 2006), 20-24 August 2006, Hong Kong, China, pp. 169-172, 2006, IEEE Computer Society, 0-7695-2521-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Mickaël Gastineau, Jacques Laskar |
Development of TRIP: Fast Sparse Multivariate Polynomial Multiplication Using Burst Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (2) ![In: Computational Science - ICCS 2006, 6th International Conference, Reading, UK, May 28-31, 2006, Proceedings, Part II, pp. 446-453, 2006, Springer, 3-540-34381-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Luc Devroye |
Universal Asymptotics for Random Tries and PATRICIA Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 42(1), pp. 11-29, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Yuriy A. Reznik |
Analysis of a Class of Tries with Adaptive Multi-digit Branching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings, pp. 61-72, 2005, Springer, 3-540-28101-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Yuriy A. Reznik, Wojciech Szpankowski |
Improved Behaviour of Tries by the "Symmetrization" of the Source. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCC ![In: 2002 Data Compression Conference (DCC 2002), 2-4 April, 2002, Snowbird, UT, USA, pp. 372-, 2002, IEEE Computer Society, 0-7695-1477-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
25 | Sartaj Sahni, Kun Suk Kim |
Efficient Construction of Variable-Stride Multibit Tries for IP Lookup. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAINT ![In: 2002 Symposium on Applications and the Internet (SAINT 2002), 28 January - 1 February 2002, Nara City, Japan, Proceedings, pp. 220-229, 2002, IEEE Computer Society, 0-7695-1447-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
multibit trie, dynamic programming, Packet routing, longest matching prefix, controlled prefix expansion |
25 | Charles Knessl |
A Note on the Asymptotic Behavior of the Depth of Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 22(4), pp. 547-560, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Digital trees, Asymptotics |
25 | Pilar de la Torre, David T. Kao |
A Uniform Analysis of Trie Structures that Store Prefixing-Keys with Application to Doubly-Chained Prefixing-Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings, pp. 542-553, 1996, Springer, 3-540-61550-4. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
25 | Wojciech Szpankowski |
Average Complexity of Additive Properties for Multiway Tries: A Unified Approach (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAPSOFT, Vol.1 ![In: TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 23-27, 1987, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming (CAAP'87), pp. 13-25, 1987, Springer, 3-540-17660-8. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
23 | Douglas Comer |
Analysis of a Heuristic for Trie Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 6(3), pp. 513-537, 1981. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
trie index, trie size, heuristic |
20 | Rajeev Raman, Venkatesh Raman 0001, Srinivasa Rao Satti |
Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(4), pp. 43, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Dictionaries, sets, perfect hashing, multisets, prefix sums, tries, succinct data structures |
20 | B. John Oommen, Ghada Hany Badr |
Breadth-first search strategies for trie-based syntactic pattern recognition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Pattern Anal. Appl. ![In: Pattern Anal. Appl. 10(1), pp. 1-13, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Trie-based syntactic pattern recognition, Noisy syntactic recognition using tries, Approximate string matching |
20 | Nian-Feng Tzeng |
Routing Table Partitioning for Speedy Packet Lookups in Scalable Routers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 17(5), pp. 481-494, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
line cards, prefix matching search, routing table lookups, Caches, interconnects, routers, tries, forwarding engines |
20 | Ranjan Sinha, Justin Zobel, David Ring |
Cache-efficient string sorting using copying. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 11, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
algorthims, string management, cache, Sorting, tries, experimental algorithms |
20 | Manolis Terrovitis, Spyros Passas, Panos Vassiliadis, Timos K. Sellis |
A combination of trie-trees and inverted files for the indexing of set-valued attributes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 2006 ACM CIKM International Conference on Information and Knowledge Management, Arlington, Virginia, USA, November 6-11, 2006, pp. 728-737, 2006, ACM, 1-59593-433-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
HTI, containment queries, inverted files, tries |
20 | Adam L. Buchsbaum, Glenn S. Fowler, Balachander Krishnamurthy, Kiem-Phong Vo, Jia Wang 0001 |
Fast prefix matching of bounded strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 8, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
prefix matching, tries, table look-up, IP routing |
20 | Torben Hagerup |
Sorting and Searching on the Word RAM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings, pp. 366-398, 1998, Springer, 3-540-64230-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
word-level parallelism, exponential range reduction, fusion trees, exponential search trees, AC', searching, Sorting, network flow, multiplication, dictionaries, tries, word RAM, conservative algorithms |
19 | Hideo Bannai, Keisuke Goto 0001, Shunsuke Kanda, Dominik Köppl |
NP-Completeness for the Space-Optimality of Double-Array Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.04951, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
19 | Shunsuke Inenaga |
Linear-size Suffix Tries and Linear-size CDAWGs Simplified and Improved. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2401.04509, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
19 | Michael Fuchs 0001, Tsan-Cheng Yu |
Asymptotic normality for the size of graph tries built from M-ary tree labelings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 968, pp. 114011, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Andrew W. Appel, Xavier Leroy |
Efficient Extensional Binary Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 67(1), pp. 8, March 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Eduardo Kochenborger Duarte, Masahiro Shiomi, Alexey V. Vinel, Martin Cooney |
Trust in Robot Self-Defense: People Would Prefer a Competent, Tele-Operated Robot That Tries to Help*. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RO-MAN ![In: 32nd IEEE International Conference on Robot and Human Interactive Communication, RO-MAN 2023, Busan, Republic of Korea, August 28-31, 2023, pp. 2447-2453, 2023, IEEE, 979-8-3503-3670-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Christoffer J. W. Romild, Thomas H. Schauser, Joachim Alexander Borup |
Enhancing Approximate Nearest Neighbor Search: Binary-Indexed LSH-Tries, Trie Rebuilding, and Batch Extraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SISAP ![In: Similarity Search and Applications - 16th International Conference, SISAP 2023, A Coruña, Spain, October 9-11, 2023, Proceedings, pp. 265-272, 2023, Springer, 978-3-031-46993-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Berg Ferreira, Edleno Silva de Moura, Altigran Soares da Silva |
Applying burst-tries for error-tolerant prefix search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Retr. J. ![In: Inf. Retr. J. 25(4), pp. 481-518, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Amin Hosseininasab, Willem-Jan van Hoeve, André A. Ciré |
Memory Efficient Tries for Sequential Pattern Mining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2202.06834, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
19 | Hasibul Jamil, Ning Weng |
Multibit Tries Packet Classification with Deep Reinforcement Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2205.08606, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Virginia Niculescu, Robert Manuel Stefanica |
Tries-Based Parallel Solutions for Generating Perfect Crosswords Grids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms ![In: Algorithms 15(1), pp. 22, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Robert Binna, Eva Zangerle, Martin Pichl, Günther Specht, Viktor Leis |
Height Optimized Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 47(1), pp. 3:1-3:46, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann |
Top Tree Compression of Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(12), pp. 3602-3628, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
19 | Ioana O. Bercea, Guy Even |
Upper tail analysis of bucket sort and random tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 895, pp. 55-67, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
19 | Diego Arroyuelo, Rodrigo Cánovas, Johannes Fischer 0001, Dominik Köppl, Marvin Löbel, Gonzalo Navarro 0001, Rajeev Raman |
Engineering Practical Lempel-Ziv Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 26, pp. 14:1-14:47, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
19 | Bolong Zheng, Lianggui Weng, Xi Zhao 0006, Kai Zeng, Xiaofang Zhou 0001, Christian S. Jensen |
REPOSE: Distributed Top-k Trajectory Similarity Search with Local Reference Point Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2101.08929, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
19 | Akio Nishimoto, Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga |
Position Heaps for Cartesian-tree Matching on Strings and Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2106.01595, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
19 | Andrew W. Appel, Xavier Leroy |
Efficient Extensional Binary Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2110.05063, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
19 | Nicola Prezza |
On Locating Paths in Compressed Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021, pp. 744-760, 2021, SIAM, 978-1-61197-646-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
19 | Bolong Zheng, Lianggui Weng, Xi Zhao 0006, Kai Zeng 0002, Xiaofang Zhou 0001, Christian S. Jensen |
REPOSE: Distributed Top-k Trajectory Similarity Search with Local Reference Point Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: 37th IEEE International Conference on Data Engineering, ICDE 2021, Chania, Greece, April 19-22, 2021, pp. 708-719, 2021, IEEE, 978-1-7281-9184-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
19 | Ioana O. Bercea, Guy Even |
Upper Tail Analysis of Bucket Sort and Random Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity - 12th International Conference, CIAC 2021, Virtual Event, May 10-12, 2021, Proceedings, pp. 116-129, 2021, Springer, 978-3-030-75241-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
19 | Akio Nishimoto, Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga |
Position Heaps for Cartesian-Tree Matching on Strings and Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: String Processing and Information Retrieval - 28th International Symposium, SPIRE 2021, Lille, France, October 4-6, 2021, Proceedings, pp. 241-254, 2021, Springer, 978-3-030-86691-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
19 | Shunsuke Kanda, Dominik Köppl, Yasuo Tabei, Kazuhiro Morita, Masao Fuketa |
Dynamic Path-decomposed Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 25, pp. 1-28, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
19 | Ioana Oriana Bercea, Guy Even |
Upper Tail Analysis of Bucket Sort and Random Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.10499, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
19 | Svante Janson |
Central limit theorems for additive functionals and fringe trees in tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2003.02725, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
19 | Hasibul Jamil, Ning Weng |
Multibit Tries Packet Classification with Deep Reinforcement Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPSR ![In: 21st IEEE International Conference on High Performance Switching and Routing, HPSR 2020, Newark, NJ, USA, May 11-14, 2020, pp. 1-6, 2020, IEEE, 978-1-7281-4846-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
19 | Valérie Berthé, Eda Cesaratto, Frédéric Paccaut, Pablo Rotondo, Martín D. Safe, Brigitte Vallée |
Two Arithmetical Sources and Their Associated Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AofA ![In: 31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA 2020, June 15-19, 2020, Klagenfurt, Austria (Virtual Conference)., pp. 4:1-4:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-147-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
19 | Shunsuke Inenaga |
Suffix Trees, DAWGs and CDAWGs for Forward and Backward Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2020: Theoretical Informatics - 14th Latin American Symposium, São Paulo, Brazil, January 5-8, 2021, Proceedings, pp. 194-206, 2020, Springer, 978-3-030-61791-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
19 | Katsuhito Nakashima, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara |
An Extension of Linear-size Suffix Tries for Parameterized Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM (Doctoral Student Research Forum) ![In: Proceedings of the SOFSEM 2020 Doctoral Student Research Forum co-located with the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2020), Limassol, Cyprus, January 20-24, 2020., pp. 97-108, 2020, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
19 | Tomasz Placek |
Laplace's demon tries on Aristotle's cloak: on two approaches to determinism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Synth. ![In: Synth. 196(1), pp. 11-30, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
19 | Niloufar Shafiei |
Non-blocking Patricia tries with replace operations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 32(5), pp. 423-442, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
19 | Philip Bille, Inge Li Gørtz, Pawel Gawrychowski, Gad M. Landau, Oren Weimann |
Top Tree Compression of Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1902.02187, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
19 | Katsuhito Nakashima, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara |
Linear-size Suffix Tries for Parameterized Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1902.00216, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
19 | Shunsuke Kanda, Dominik Köppl, Yasuo Tabei, Kazuhiro Morita, Masao Fuketa |
Dynamic Path-Decomposed Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1906.06015, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
19 | Shunsuke Inenaga |
Suffix Trees, DAWGs and CDAWGs for Forward and Backward Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1904.04513, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
19 | Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
Dynamic Packed Compact Tries Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1904.07467, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
19 | Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann |
Top Tree Compression of Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 4:1-4:18, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
19 | Lingjing You, Yongkun Li 0001, Fan Guo 0003, Yinlong Xu, Jinzhong Chen, Liu Yuan 0002 |
Leveraging Array Mapped Tries in KSM for Lightweight Memory Deduplication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NAS ![In: 2019 IEEE International Conference on Networking, Architecture and Storage, NAS 2019, EnShi, China, August 15-17, 2019, pp. 1-8, 2019, IEEE, 978-1-7281-4409-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
19 | Pedro Moreno, Miguel Areias 0001, Ricardo Rocha 0001 |
Memory Reclamation Methods for Lock-Free Hash Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SBAC-PAD ![In: 31st International Symposium on Computer Architecture and High Performance Computing, SBAC-PAD 2019, Campo Grande, Brazil, October 15-18, 2019, pp. 188-195, 2019, IEEE, 978-1-7281-4194-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
19 | Mehri Javanian |
Protected node profile of Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Theor. Comput. Sci. ![In: Discret. Math. Theor. Comput. Sci. 20(1), 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
19 | Abram Magner, Wojciech Szpankowski |
Profiles of PATRICIA Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 80(1), pp. 331-397, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
19 | Chia-Tung Kuo, Ian Davidson |
On The Equivalence of Tries and Dendrograms - Efficient Hierarchical Clustering of Traffic Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1810.05357, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
19 | Huanchen Zhang, Hyeontaek Lim, Viktor Leis, David G. Andersen, Michael Kaminsky, Kimberly Keeton, Andrew Pavlo |
SuRF: Practical Range Query Filtering with Fast Succinct Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the 2018 International Conference on Management of Data, SIGMOD Conference 2018, Houston, TX, USA, June 10-15, 2018, pp. 323-336, 2018, ACM. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
19 | Michael J. Steindorfer, Jurgen J. Vinju |
To-many or to-one? all-in-one! efficient purely functional multi-maps with type-heterogeneous hash-tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2018, Philadelphia, PA, USA, June 18-22, 2018, pp. 283-295, 2018, ACM, 978-1-4503-5698-5. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
19 | Holger Heissmeyer |
Yes/no-object: a communicative object that tries to establish boundaries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AfriCHI ![In: Proceedings of the Second African Conference for Human Computer Interaction: Thriving Communities, AfriCHI 2018, Windhoek, Namibia, December 03-07, 2018, pp. 60:1-60:4, 2018, ACM, 978-1-4503-6558-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
19 | Yi Wu 0011, Ge Nong, Mounir Hamdi |
Scalable pipelined IP lookup with prefix tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Networks ![In: Comput. Networks 120, pp. 1-11, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
19 | Silvia Businger |
Asymptotics of the occupancy scheme in a random environment and its applications to tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Theor. Comput. Sci. ![In: Discret. Math. Theor. Comput. Sci. 19(1), 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 2341 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|