Results 1  10
of
3,377
Refactoring ObjectOriented Frameworks
, 1992
"... This thesis defines a set of program restructuring operations (refactorings) that support the design, evolution and reuse of objectoriented application frameworks. The focus of the thesis is on automating the refactorings in a way that preserves the behavior of a program. The refactorings are defin ..."
Abstract

Cited by 482 (4 self)
 Add to MetaCart
that behavior is preserved across some refactorings. This thesis gives some conservative algorithms for determining whether a program satisfies these constraints, and describes how to use this design information to refactor a program.
A Separator Theorem for Planar Graphs
, 1977
"... Let G be any nvertex planar graph. We prove that the vertices of G can be partitioned into three sets A, B, C such that no edge joins a vertex in A with a vertex in B, neither A nor B contains more than 2n/3 vertices, and C contains no more than 2& & vertices. We exhibit an algorithm which ..."
Abstract

Cited by 465 (1 self)
 Add to MetaCart
Let G be any nvertex planar graph. We prove that the vertices of G can be partitioned into three sets A, B, C such that no edge joins a vertex in A with a vertex in B, neither A nor B contains more than 2n/3 vertices, and C contains no more than 2& & vertices. We exhibit an algorithm which
Practical Graph Isomorphism
, 1981
"... We develop an improved algorithm for canonically labelling a graph and finding generators for its automorph.ism grou.p. The emphasis i, on th.e power of the algorithm for,01 fling pr4ctical problem.t, rather than on the theoretical n,icetiu of tJu algo rith.m. Th.e nsult is a.n implementa.tion wh.ic ..."
Abstract

Cited by 334 (7 self)
 Add to MetaCart
We develop an improved algorithm for canonically labelling a graph and finding generators for its automorph.ism grou.p. The emphasis i, on th.e power of the algorithm for,01 fling pr4ctical problem.t, rather than on the theoretical n,icetiu of tJu algo rith.m. Th.e nsult is a.n implementa.tion wh
Deterministic Algorithms for the Lovasz Local Lemma
, 2010
"... The Lovász Local Lemma [5] (LLL) is a powerful result in probability theory that states that the probability that none of a set of bad events happens is nonzero if the probability of each event is small compared to the number of events that depend on it. It is often used in combination with the prob ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
The Lovász Local Lemma [5] (LLL) is a powerful result in probability theory that states that the probability that none of a set of bad events happens is nonzero if the probability of each event is small compared to the number of events that depend on it. It is often used in combination
Distributed Algorithms for the Lovász Local Lemma and Graph Coloring
"... The Lovász Local Lemma (LLL), introduced by Erdős and Lovász in 1975, is a powerful tool of the probabilistic method that allows one to prove that a set of n “bad ” events do not happen with nonzero probability, provided that the events have limited dependence. However, the LLL itself does not sugg ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
The Lovász Local Lemma (LLL), introduced by Erdős and Lovász in 1975, is a powerful tool of the probabilistic method that allows one to prove that a set of n “bad ” events do not happen with nonzero probability, provided that the events have limited dependence. However, the LLL itself does
FloatingPoint LLL Revisited
, 2005
"... The LenstraLenstraLovász lattice basis reduction algorithm (LLL or L³) is a very popular tool in publickey cryptanalysis and in many other fields. Given an integer ddimensional lattice basis with vectors of norm less than B in an ndimensional space, L³ outputs a socalled L³reduced basis in po ..."
Abstract

Cited by 53 (7 self)
 Add to MetaCart
The LenstraLenstraLovász lattice basis reduction algorithm (LLL or L³) is a very popular tool in publickey cryptanalysis and in many other fields. Given an integer ddimensional lattice basis with vectors of norm less than B in an ndimensional space, L³ outputs a socalled L³reduced basis
The Technological Society
, 1964
"... A penetrating analysis of our technical civilization and of the effect of an increasingly standardized culture on the future of man ..."
Abstract

Cited by 259 (1 self)
 Add to MetaCart
A penetrating analysis of our technical civilization and of the effect of an increasingly standardized culture on the future of man
New Constructive Aspects of the Lovász Local Lemma
"... The Lovász Local Lemma (LLL) is a powerful tool that gives sufficient conditions for avoiding all of a given set of “bad ” events, with positive probability. A series of results have provided algorithms to efficiently construct structures whose existence is nonconstructively guaranteed by the LLL, ..."
Abstract

Cited by 26 (4 self)
 Add to MetaCart
The Lovász Local Lemma (LLL) is a powerful tool that gives sufficient conditions for avoiding all of a given set of “bad ” events, with positive probability. A series of results have provided algorithms to efficiently construct structures whose existence is nonconstructively guaranteed by the LLL
Results 1  10
of
3,377