Sciweavers

57 search results - page 5 / 12
» N Degrees of Separation: Multi-Dimensional Separation of Con...
Sort
View
IPPS
1994
IEEE
15 years 1 months ago
AVL Trees with Relaxed Balance
AVL trees with relaxed balance were introduced with the aim of improving runtime performance by allowing a greater degree of concurrency. This is obtained by uncoupling updating f...
Kim S. Larsen
JCT
2010
112views more  JCT 2010»
14 years 8 months ago
Annular embeddings of permutations for arbitrary genus
In the symmetric group on a set of size 2n, let P2n denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as “pairings”, since each ...
I. P. Goulden, William Slofstra
COCO
1997
Springer
144views Algorithms» more  COCO 1997»
15 years 1 months ago
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
Kenneth W. Regan
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
15 years 1 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski
CIT
2007
Springer
15 years 1 months ago
An Aspect Enhanced Method of NFR Modeling in Software Architecture
Existence of crosscutting concerns in software requirements often intensifies complexity of software development. Modeling and analysis of these concerns at software architecture ...
Hamid Bagheri, Seyed-Hassan Mirian-Hosseinabadi, H...