Faster access than browser!
32 relations: Bell Labs, Comparison sort, Data structure, Evolutionary biology, Fractional cascading, Fusion tree, Gödel's incompleteness theorems, Harvard University, Information Processing Letters, Integer sorting, Journal of Computer and System Sciences, Journal of Symbolic Logic, Michael Fredman, Minimum spanning tree, Nature (journal), Order-maintenance problem, Priority queue, Radix sort, Range searching, Robert Trivers, Science (journal), Science News, Self-verifying theories, Sex ratio, Shortest path problem, Stony Brook University, Symposium on Theory of Computing, Transdichotomous model, Trivers–Willard hypothesis, University at Albany, SUNY, X-fast trie, Y-fast trie.
Bell Labs
Nokia Bell Labs (formerly named AT&T Bell Laboratories, Bell Telephone Laboratories and Bell Labs) is an American research and scientific development company, owned by Finnish company Nokia.
New!!: Dan Willard and Bell Labs · See more »
Comparison sort
A comparison sort is a type of sorting algorithm that only reads the list elements through a single abstract comparison operation (often a "less than or equal to" operator or a three-way comparison) that determines which of two elements should occur first in the final sorted list.
New!!: Dan Willard and Comparison sort · See more »
Data structure
In computer science, a data structure is a data organization and storage format that enables efficient access and modification.
New!!: Dan Willard and Data structure · See more »
Evolutionary biology
Evolutionary biology is the subfield of biology that studies the evolutionary processes that produced the diversity of life on Earth, starting from a single common ancestor.
New!!: Dan Willard and Evolutionary biology · See more »
Fractional cascading
In computer science, fractional cascading is a technique to speed up a sequence of binary searches for the same value in a sequence of related data structures.
New!!: Dan Willard and Fractional cascading · See more »
Fusion tree
In computer science, a fusion tree is a type of tree data structure that implements an associative array on -bit integers.
New!!: Dan Willard and Fusion tree · See more »
Gödel's incompleteness theorems
Gödel's incompleteness theorems are two theorems of mathematical logic that demonstrate the inherent limitations of every formal axiomatic system containing basic arithmetic.
New!!: Dan Willard and Gödel's incompleteness theorems · See more »
Harvard University
Harvard University is a private Ivy League research university in Cambridge, Massachusetts.
New!!: Dan Willard and Harvard University · See more »
Information Processing Letters
Information Processing Letters is a peer reviewed scientific journal in the field of computer science, published by Elsevier.
New!!: Dan Willard and Information Processing Letters · See more »
Integer sorting
In computer science, integer sorting is the algorithmic problem of sorting a collection of data values by numeric keys, each of which is an integer.
New!!: Dan Willard and Integer sorting · See more »
Journal of Computer and System Sciences
The Journal of Computer and System Sciences (JCSS) is a peer-reviewed scientific journal in the field of computer science.
New!!: Dan Willard and Journal of Computer and System Sciences · See more »
Journal of Symbolic Logic
The Journal of Symbolic Logic is a peer-reviewed mathematics journal published quarterly by Association for Symbolic Logic.
New!!: Dan Willard and Journal of Symbolic Logic · See more »
Michael Fredman
Michael Lawrence Fredman is an emeritus professor at the Computer Science Department at Rutgers University, United States.
New!!: Dan Willard and Michael Fredman · See more »
Minimum spanning tree
A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted (un)directed graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight.
New!!: Dan Willard and Minimum spanning tree · See more »
Nature (journal)
Nature is a British multidisciplinary scientific journal, first published on 4 November 1869.
New!!: Dan Willard and Nature (journal) · See more »
Order-maintenance problem
In computer science, the order-maintenance problem involves maintaining a totally ordered set supporting the following operations.
New!!: Dan Willard and Order-maintenance problem · See more »
Priority queue
In computer science, a priority queue is an abstract data type which is like a regular queue or stack data structure, but where additionally each element has a "priority" associated with it.
New!!: Dan Willard and Priority queue · See more »
Radix sort
In computer science, radix sort is a non-comparative integer sorting algorithm that sorts data with integer keys by grouping keys by the individual digits which share the same significant position and value.
New!!: Dan Willard and Radix sort · See more »
Range searching
In data structures, the range searching problem most generally consists of preprocessing a set S of objects, in order to determine which objects from S intersect with a query object, called a range.
New!!: Dan Willard and Range searching · See more »
Robert Trivers
Robert Ludlow "Bob" Trivers (born February 19, 1943) is an American evolutionary biologist and sociobiologist.
New!!: Dan Willard and Robert Trivers · See more »
Science (journal)
Science, also widely referred to as Science Magazine, is the peer-reviewed academic journal of the American Association for the Advancement of Science (AAAS) and one of the world's top academic journals.
New!!: Dan Willard and Science (journal) · See more »
Science News
Science News is an American bi-weekly magazine devoted to short articles about new scientific and technical developments, typically gleaned from recent scientific and technical journals.
New!!: Dan Willard and Science News · See more »
Self-verifying theories
Self-verifying theories are consistent first-order systems of arithmetic much weaker than Peano arithmetic that are capable of proving their own consistency.
New!!: Dan Willard and Self-verifying theories · See more »
Sex ratio
The sex ratio is the ratio of males to females in a population.
New!!: Dan Willard and Sex ratio · See more »
Shortest path problem
In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized.
New!!: Dan Willard and Shortest path problem · See more »
Stony Brook University
The State University of New York at Stony Brook (also known as Stony Brook University or SUNY Stony Brook) is a public sea-grant and space-grant research university in the eastern United States.
New!!: Dan Willard and Stony Brook University · See more »
Symposium on Theory of Computing
The Annual ACM Symposium on Theory of Computing (STOC) is an academic conference in the field of theoretical computer science.
New!!: Dan Willard and Symposium on Theory of Computing · See more »
Transdichotomous model
In computational complexity theory, and more specifically in the analysis of algorithms with integer data, the transdichotomous model is a variation of the random access machine in which the machine word size is assumed to match the problem size.
New!!: Dan Willard and Transdichotomous model · See more »
Trivers–Willard hypothesis
In evolutionary biology and evolutionary psychology, the Trivers–Willard hypothesis, formally proposed by Robert Trivers and Dan Willard, suggests that female mammals are able to adjust offspring sex ratio in response to their maternal condition.
New!!: Dan Willard and Trivers–Willard hypothesis · See more »
University at Albany, SUNY
The State University of New York at Albany, also known as University at Albany, SUNY Albany or UAlbany, is a public research university with campuses in Albany, Guilderland, and Rensselaer, New York, United States.
New!!: Dan Willard and University at Albany, SUNY · See more »
X-fast trie
In computer science, an x-fast trie is a data structure for storing integers from a bounded domain.
New!!: Dan Willard and X-fast trie · See more »
Y-fast trie
In computer science, a y-fast trie is a data structure for storing integers from a bounded domain.
New!!: Dan Willard and Y-fast trie · See more »
Redirects here:
References
[1] https://en.wikipedia.org/wiki/Dan_Willard
