Search alternatives:
trier » tried
tries » tried, tres
trees » tree
Cover Image
Read Now

1
Published 2023
Springer Nature Switzerland
Table of Contents: “... -- The rectilinear convex hull of line segments -- Domino Snake Problems on Groups -- Parsing Unranked Tree Languages...”
Cover Image
Read Now

2
Published 2010
Springer Berlin Heidelberg
Table of Contents: “... of Language -- Arbology: Trees and Pushdown Automata -- Analysis of Communicating Automata -- Regular Papers...”
Cover Image
Read Now

3
Published 1987
Springer Berlin Heidelberg
Table of Contents: “...On the complexity of branching programs and decision trees for clique functions -- Average...”
Cover Image
Read Now

4
by Mailund, Thomas
Published 2020
Apress
Table of Contents: “...1. Introduction -- 2. Classical Algorithms for Exact Search -- 3. Suffix Trees -- 4. Suffix Arrays...”
Cover Image
Read Now

5
by Mailund, Thomas
Published 2020
Apress
Table of Contents: “...1. Introduction -- 2. Classical Algorithms for Exact Search -- 3. Suffix Trees -- 4. Suffix Arrays...”
Cover Image
Read Now

6
by Sengupta, Saumyendra, Korobkin, Carl P.
Published 1994
Springer New York
Table of Contents: “... Multidimensional Search Trees and Search Tries -- 9.1 Extending the Single-Key Model -- 9.2 Geometric Formulation...”
Cover Image
Read Now

7
Published 2008
Springer Berlin Heidelberg
Table of Contents: “... Operations -- On the Redundancy of Succinct Data Structures -- Confluently Persistent Tries for Efficient...”
Cover Image
Read Now

8
by Jamro, Marcin
Published 2024
Packt Publishing
Table of Contents: “... trees -- AVL trees -- Red-black trees -- Tries -- Implementation -- Example -- autocomplete -- Heaps...”
Cover Image
Read Now

9
by Skopik, Florian, Wurzenberger, Markus, Landauer, Max
Published 2021
Springer International Publishing
Table of Contents: “... -- 3.4 Try it out -- 3.4.1 Exim Mainlog -- 3.4.2 Messages log file -- 4 Generating character-based...”
Cover Image
Read Now

10
by Lewis, Jonathan
Published 2006
Apress
Table of Contents: “...What Do You Mean by Cost? -- Tablescans -- Single Table Selectivity -- Simple B-tree Access...”
Cover Image
Read Now

11
Published 2020
Springer International Publishing
Table of Contents: “... and their relation to ternary trees -- A theorem to reduce certain modular form relations modulo primes -- Trying...”
Cover Image
Read Now

12
by Hébert, Fred
Published 2013
No Starch Press
Table of Contents: “... the Catch; Trying Multiple Expressions; Wait, There's More!; Try a try in a Tree...”
Cover Image
Read Now

13
by Chawdhuri, Debasish Ray
Published 2017
Packt Publishing
Table of Contents: “... -- The flatMap method on a linked list -- The concept of a monad -- Option monad -- Try monad -- Analysis...”
Cover Image
Read Now

14
by Lewis, Jonathan
Published 2006
Apress
Table of Contents: “.... Simple B-tree access -- Ch. 5. The clustering factor -- Ch. 6. Selectivity issues -- Ch. 7. Histograms...”
Cover Image
Read Now

15
Published 2002
Springer Berlin Heidelberg
Table of Contents: “... to Clustering Large Datasets -- Symbolic Class Descriptions -- Consensus Trees and Phylogenetics -- A Comparison...”
Cover Image
Read Now

16
Published 2013
Springer International Publishing
Table of Contents: “...Brzozowski’s and Up-To Algorithms for Must Testing -- Practical Alternating Parity Tree Automata...”
Cover Image
Read Now

17
Published 2021
Springer International Publishing
Table of Contents: “... Tries -- Throughput Scheduling with Equal Additive Laxity -- Fragile Complexity of Adaptive Algorithms...”
Cover Image
Read Now

18
by Naccache, Rafik
Published 2015
Packt Publishing
Table of Contents: “... efficient splay trees""; ""Designing an efficient key-value store using B-Trees""; ""Devising an undo...”
Cover Image
Read Now

19
by Kane, Frank
Published 2017
Packt Publishing
Table of Contents: “... type -- Rating data type -- Decision Trees in Spark with MLlib -- Exploring decision trees code...”
Cover Image
Read Now

20
Published 2005
Springer Berlin Heidelberg
Table of Contents: “...Research Papers -- An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees...”