X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Conference Proceeding (85) 85
Journal Article (70) 70
Publication (58) 58
Book Chapter (23) 23
Book / eBook (5) 5
Web Resource (4) 4
Book Review (1) 1
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
computer science (51) 51
algorithms (37) 37
data structures (30) 30
computer science, theory & methods (29) 29
algorithm analysis and problem complexity (28) 28
discrete mathematics in computer science (24) 24
numeric computing (18) 18
computer communication networks (13) 13
theory of computation (13) 13
computer algorithms (11) 11
computer graphics (11) 11
computer science - data structures and algorithms (10) 10
data structures, cryptology and information theory (9) 9
logics and meanings of programs (7) 7
software engineering (7) 7
analysis (6) 6
computational complexity (6) 6
computer systems organization and communication networks (6) 6
congresses (6) 6
databases (6) 6
mathematics of computing (6) 6
algorithmus (5) 5
computer science, software engineering (5) 5
lower bound (5) 5
mathematical logic and formal languages (5) 5
mathematics, applied (5) 5
studies (5) 5
theoretical computer science (5) 5
computational geometry (4) 4
computer software (4) 4
computers (4) 4
data structure (4) 4
external memory (4) 4
kongress (4) 4
mathematics (4) 4
programming techniques (4) 4
trees (4) 4
algorithmes (3) 3
algoritmos (3) 3
cache-oblivious (3) 3
combinatorial analysis (3) 3
complexity (3) 3
computation by abstract devices (3) 3
computational modeling (3) 3
computer programming (3) 3
contracts (3) 3
data structures (computer scienc (3) 3
datenstruktur (3) 3
effizienter algorithmus (3) 3
electronic books (3) 3
electronic data processing (3) 3
heaps (3) 3
index medicus (3) 3
memory (3) 3
phylogeny (3) 3
queries (3) 3
selection networks (3) 3
software (3) 3
suchverfahren (3) 3
3-sided range reporting (2) 2
algorithm (2) 2
algorithme (2) 2
application software (2) 2
balanced trees (2) 2
binary counter (2) 2
binary heaps (2) 2
biochemical research methods (2) 2
bioinformatics (2) 2
biology (2) 2
biotechnology & applied microbiology (2) 2
bit probe model (2) 2
cache-oblivious model (2) 2
combinatorics (2) 2
comparator networks (2) 2
complexity, computational (2) 2
computation (2) 2
computational biology - methods (2) 2
computational mathematics and numerical analysis (2) 2
computational theory and mathematics (2) 2
computer algorithms congresses (2) 2
computer networks (2) 2
computer science, information systems (2) 2
computer simulation (2) 2
congrès (2) 2
construction (2) 2
data structures and algorithms (2) 2
data structures and information theory (2) 2
decentralized system (2) 2
dictionary (2) 2
distributed data structure (2) 2
dynamic data structure (2) 2
dynamic data structures (2) 2
evolutionary trees (2) 2
external memory algorithms (2) 2
fibonacci lattices (2) 2
finger search trees (2) 2
general (2) 2
gray code (2) 2
i/o-model (2) 2
implicit (2) 2
more...
Library Location Library Location
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Journal Article
Algorithmica, ISSN 0178-4617, 7/2015, Volume 72, Issue 3, pp. 860 - 883
Journal Article
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2004, Volume 3111, pp. 3 - 13
Frigo, Leiserson, Prokop and Ramachandran in 1999 introduced the ideal-cache model as a formal model of computation for developing algorithms in environments... 
LOCALITY | COMPUTER SCIENCE, THEORY & METHODS | MODEL | PARALLEL MEMORY | MEMORY-HIERARCHY | SEARCH-TREES
Journal Article
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2004, Volume 3111, pp. 480 - 492
We present improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs... 
I/O | COMPUTER SCIENCE, THEORY & METHODS
Journal Article
Leibniz International Proceedings in Informatics, LIPIcs, ISSN 1868-8969, 02/2016, Volume 47
Conference Proceeding
02/2019
In this article, we determine the amortized computational complexity of the planar dynamic convex hull problem by querying. We present a data structure that... 
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 07/2016, Volume 638, pp. 33 - 43
Given a matrix of size , two dimensional range minimum queries (2D-RMQs) ask for the position of the minimum element in a rectangular range within the matrix.... 
Fibonacci lattices | Range minimum queries | Pattern matching | COMPUTER SCIENCE, THEORY & METHODS | Queries | Supports | Tradeoffs | Lattices | Data structures | Two dimensional | Indexing
Journal Article
BMC bioinformatics, ISSN 1471-2105, 2013, Volume 14, Issue Suppl 2, pp. S18 - S18
The triplet distance is a distance measure that compares two rooted trees on the same set of leaves by enumerating all sub-sets of three leaves and counting... 
Computational Biology - methods | Software | Algorithms | Phylogeny | Computer Simulation | Studies | Trees | Computer science | Leaves | Bioinformatics | Index Medicus
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 2011, Volume 412, Issue 24, pp. 2588 - 2601
We consider the following problem: Given an unsorted array of elements, and a sequence of intervals in the array, compute the median in each of the subarrays... 
Range queries | Data structures | Medians | Algorithms | SPACE | COMPUTER SCIENCE, THEORY & METHODS | CONSTANT-TIME | EFFICIENT | Intervals | Queries | Random access memory | Mathematical models | Arrays | Counting
Journal Article
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2013, Volume 8066, pp. 150 - 163
Conference Proceeding
Leibniz International Proceedings in Informatics, LIPIcs, ISSN 1868-8969, 09/2017, Volume 87
Conference Proceeding
Algorithmica, ISSN 0178-4617, 07/2015, Volume 72, Issue 3, pp. 860 - 883
We present a new overlay, called the Deterministic Decentralized tree ( D.sup.2 D 2 -tree). The D.sup.2 D 2 Indexing scheme | Decentralized system | Load-balancing | Overlay | Distributed data structure | Computer science | Indexing
Journal Article
Bioinformatics, ISSN 1367-4803, 07/2014, Volume 30, Issue 14, pp. 2079 - 2080
tqDist is a software package for computing the triplet and quartet distances between general rooted or unrooted trees, respectively. The program is based on... 
EVOLUTIONARY TREES | BIOTECHNOLOGY & APPLIED MICROBIOLOGY | PHYLOGENETIC TREES | BIOCHEMICAL RESEARCH METHODS | MATHEMATICAL & COMPUTATIONAL BIOLOGY | Classification - methods | Software | Algorithms | Phylogeny | Index Medicus
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.