Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
scientific article; zbMATH DE number 6472611 - MaRDI portal

scientific article; zbMATH DE number 6472611

From MaRDI portal
Publication:5501814

zbMath1321.68549MaRDI QIDQ5501814

Robert Sedgewick, Jon Louis Bentley

Publication date: 14 August 2015


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (32)

Restricted rotation distance between k-ary treesNew method in information processing for maintaining an efficient dynamic ordered setBreadth-first search strategies for trie-based syntactic pattern recognitionA novel look-ahead optimization strategy for trie-based approximate string matchingReplacing suffix trees with enhanced suffix arraysBuilding efficient and compact data structures for simplicial complexesDynamic Path-decomposed TriesEngineering Practical Lempel-Ziv TriesCompressed string dictionaries via data-aware subtrie compactionOn demand string sorting over unbounded alphabetsOn the possible patterns of inputs for block sorting in the Burrows-Wheeler transformationFaster semi-external suffix sortingMultikey quickselectWeighted height of random treesPSAEC: An Improved Algorithm for Short Read Error Correction Using Partial Suffix ArraysPractical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch TriesFast BWT in small space by blockwise suffix sortingFaster suffix sortingUnnamed ItemAn artificial neural network based approach for online string matching/filtering of large databasesEngineering parallel string sortingTernary directed acyclic word graphsD?E?K=(1000)8An experimental study of a compressed indexImproving multikey Quicksort for sorting strings with many equal elementsSpace efficient algorithms for the Burrows-Wheeler backtransformationThe Simplex Tree: An Efficient Data Structure for General Simplicial ComplexesProbabilistic analysis of algorithms for the Dutch national flag problemSpace efficient linear time construction of suffix arraysIn-memory hash tables for accumulating text vocabulariesA Fast Suffix-Sorting AlgorithmModified binary searching for static tables




This page was built for publication: