Search results

...ees.svg|thumb|The dashed circle is the outline of the largest empty sphere in the [[Close-packing of equal spheres|close-packing of spheres]]. See also ' ...''' problem is the problem of finding a [[hypersphere]] of largest radius in ''d''-dimensional space whose interior does not overlap with any given obst ...

...ed by removing the longest [[edge (geometry)|edge]] from each [[triangle]] in the [[Delaunay triangulation]]. ...they are to each other). Since Delaunay triangulations can be constructed in time <math>O(n\log n)</math>, the same time bound holds for the Urquhart gr ...

...it in a 1983 conference and published it in the ''[[Journal of the ACM]]'' in 1994. ...combine the solutions from each layer in a reasonable way that will result in a feasible solution. This technique has given PTASs for the following prob ...

...y communication complexity''' is the study of [[communication complexity]] in the setting where there are more than 2 players. In the traditional two–party [[communication complexity|communication game]], ...

[[File:Polytrees in a tournament.svg|thumb|upright=1.3|A 6-vertex tournament, and copies of eve ...arvtxt|Reid|Wormald|1983}} and {{harvtxt|Wormald|1983}}. {{harvtxt|Wormald|1983}} cites the conjecture as an undated private communication by Sumner.</ref> ...

...is a [[Hungarian American|Hungarian-American]] [[mathematician]], working in [[probability theory]] and [[discrete mathematics]]. He has been a professo ...es [[Almost everywhere convergence|converge pointwise almost everywhere]]. In probabilistic terminology, the theorem is as follows. Let ξ₁,ξ<s ...

...t of ''n'' points in the [[plane (mathematics)|plane]] (or more generally, in <math>\mathbb{R}^{d}</math>) is a [[minimum spanning tree]] of that set, wh ...an be found using existing algorithms for finding a minimum spanning tree. In particular, using [[Prim's algorithm]] with an [[adjacency matrix]] yields ...

...g data replicas and are a basic mechanism for [[optimistic replication]]. In mathematical terms, the version vector generates a [[preorder]] that tracks ...ical to that in a [[vector clock]], but the update rules differ slightly; in this example, replicas can either experience local updates (e.g., the user ...

...t-time distance evaluations) but faster algorithms are possible for points in low dimensions. ...vex hull vertices found as the two points of contact of the parallel lines in this sweep. The time for this method is dominated by the time for construct ...

...em 0;line-height:1.15em | [[University of Pennsylvania]]<!-- {{smaller|(to 1983)}}--> | [[Cornell University]]<!-- {{smaller|(1984-85)}}-->}} | known_for = {{ublist|[[Quantum computing]]|[[Loss–DiVincenzo quantum computer]]| [[DiVincenzo's criteria]]}} ...

'''Rolf Rannacher''' (born 10 June 1948 in [[Leipzig]]) is a German mathematician and a professor of [[numerical analy ...1988 a professor at [[Saarland University]]. Since 1988 he is a professor in Heidelberg. ...

...ation theoretic barrier with fusion trees|journal=[[Symposium on Theory of Computing]]|pages=1–7|date=1990}}</ref> ...rations and [[bitwise operations]] including [[logical shift]]s to be done in [[constant time]] (the precise instruction set assumed by an algorithm or p ...

...st be the '''[[Least significant bit|least significant]]''' nonzero digit. In this case 15 is written canonically as 1000. Canonical skew binary representations of the numbers from 0 to 15 are shown in following table:<ref>{{cite OEIS|A169683}}</ref> ...

In [[graph theory]], a branch of mathematics, '''graph canonization''' is the | series = Lecture Notes in Comput. Sci. ...

...o.ethz.ch/alumni/pascal/refs/mst_1987_awerbuch.pdf|journal=SIAM Journal on Computing}}</ref> Unlike [[Mega-Merger]] it has a trivial termination and cost analys ...d a graph-reduction technique called ''pruning''. The algorithm is divided in a pre-processing phase followed by a cyclic repetition of a forward phase, ...

...o.ethz.ch/alumni/pascal/refs/mst_1987_awerbuch.pdf|journal=SIAM Journal on Computing}}</ref> ...while the edges that connect them are the roads and a rooted spanning tree in a sub-graph is a city. The whole graph is then a mega-city. Mega-Merger pus ...

{{Short description|Algorithm for computing the maximal flow of a network}} ...e [[Edmonds–Karp algorithm]], which runs in <math>O(|V||E|^2)</math> time, in that it uses shortest augmenting paths. The introduction of the concepts of ...

...Maryland, College Park]] department of computer science whose research is in [[computational geometry]]. ...in 1977 and received his Ph.D. in Computer Science at Purdue University in 1983 under the advisement of Christoph Hoffmann. ...

In [[Boolean algebra (logic)|Boolean algebra]], a '''parity function''' is a The parity function is notable for its role in theoretical investigation of [[circuit complexity]] of Boolean functions. ...

...rstand the complexity of computing polynomials. The basic type of question in this line of research is "what is the most efficient way to compute a given ...d in the second a ''product'' gate. An ''arithmetic formula'' is a circuit in which every gate has [[outdegree]] one (and so the underlying graph is a [[ ...