Results 1  10
of
17,501
Veering triangulations admit strict angle structures, Geom
 Topol
"... Agol recently introduced the concept of a veering taut triangulation, which is a taut triangulation with some extra combinatorial structure. We define the weaker notion of a “veering triangulation ” and use it to show that all veering triangulations admit strict angle structures. We also answer a qu ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Agol recently introduced the concept of a veering taut triangulation, which is a taut triangulation with some extra combinatorial structure. We define the weaker notion of a “veering triangulation ” and use it to show that all veering triangulations admit strict angle structures. We also answer a
Triangulations of hyperbolic 3manifolds admitting strict angle structures
 Journal of Topology
"... It is conjectured that every cusped hyperbolic 3manifold has a decomposition into positive volume ideal hyperbolic tetrahedra (a “geometric ” triangulation of the manifold). Under a mild homology assumption on the manifold we construct topological ideal triangulations which admit a strict angle str ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
structure, which is a necessary condition for the triangulation to be geometric. In particular, every knot or link complement in the 3sphere has such a triangulation. We also give an example of a triangulation without a strict angle structure, where the obstruction is related to the homology hypothesis
The Lorel Query Language for Semistructured Data
 International Journal on Digital Libraries
, 1997
"... We present the Lorel language, designed for querying semistructured data. Semistructured data is becoming more and more prevalent, e.g., in structured documents such as HTML and when performing simple integration of data from multiple sources. Traditional data models and query languages are inapprop ..."
Abstract

Cited by 731 (29 self)
 Add to MetaCart
We present the Lorel language, designed for querying semistructured data. Semistructured data is becoming more and more prevalent, e.g., in structured documents such as HTML and when performing simple integration of data from multiple sources. Traditional data models and query languages
Scheduling Multithreaded Computations by Work Stealing
, 1994
"... This paper studies the problem of efficiently scheduling fully strict (i.e., wellstructured) multithreaded computations on parallel computers. A popular and practical method of scheduling this kind of dynamic MIMDstyle computation is “work stealing," in which processors needing work steal com ..."
Abstract

Cited by 568 (34 self)
 Add to MetaCart
This paper studies the problem of efficiently scheduling fully strict (i.e., wellstructured) multithreaded computations on parallel computers. A popular and practical method of scheduling this kind of dynamic MIMDstyle computation is “work stealing," in which processors needing work steal
Cilk: An Efficient Multithreaded Runtime System
, 1995
"... Cilk (pronounced “silk”) is a Cbased runtime system for multithreaded parallel programming. In this paper, we document the efficiency of the Cilk workstealing scheduler, both empirically and analytically. We show that on real and synthetic applications, the “work” and “critical path ” of a Cilk co ..."
Abstract

Cited by 763 (33 self)
 Add to MetaCart
computation can be used to accurately model performance. Consequently, a Cilk programmer can focus on reducing the work and critical path of his computation, insulated from load balancing and other rtmtime scheduling issues. We also prove that for the class of “fully strict ” (wellstructured) programs
The embryonic cell lineage of the nematode Caenorhabditis elegans
 Dev. Biol
, 1983
"... The number of nongonadal nuclei in the freeliving soil nematode Caenorhabditis elegans increases from about 550 in the newly hatched larva to about 810 in the mature hermaphrodite and to about 970 in the mature male. The pattern of cell divisions which leads to this increase is essentially invarian ..."
Abstract

Cited by 540 (19 self)
 Add to MetaCart
invariant among individuals; rigidly determined cell lineages generate a fixed number of progeny cells of strictly specified fates. These lineages range in length from one to eight sequential divisions and lead to significant developmental changes in the neuronal, muscular, hypodermal, and digestive systems
The role of knowledge in discourse comprehension: A constructionintegration model
 Psychological Review
, 1988
"... In contrast to expectationbased, predictive views of discourse comprehension, a model is developed in which the initial processing is strictly bottomup. Word meanings are activated, propositions are formed, and inferences and elaborations are produced without regard to the discourse context. Howev ..."
Abstract

Cited by 476 (7 self)
 Add to MetaCart
In contrast to expectationbased, predictive views of discourse comprehension, a model is developed in which the initial processing is strictly bottomup. Word meanings are activated, propositions are formed, and inferences and elaborations are produced without regard to the discourse context
The DLV System for Knowledge Representation and Reasoning
 ACM Transactions on Computational Logic
, 2002
"... Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class ΣP 2 (NPNP). Thus, under widely believ ..."
Abstract

Cited by 456 (102 self)
 Add to MetaCart
Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class ΣP 2 (NPNP). Thus, under widely
Skip Lists: A Probabilistic Alternative to Balanced Trees
, 1990
"... Skip lists are data structures thla t use probabilistic balancing rather than strictly enforced balancing. As a result, the algorithms for insertion and deletion in skip lists are much simpler and significantly faster than equivalent algorithms for balanced trees. ..."
Abstract

Cited by 412 (1 self)
 Add to MetaCart
Skip lists are data structures thla t use probabilistic balancing rather than strictly enforced balancing. As a result, the algorithms for insertion and deletion in skip lists are much simpler and significantly faster than equivalent algorithms for balanced trees.
NonDeterministic Exponential Time has TwoProver Interactive Protocols
"... We determine the exact power of twoprover interactive proof systems introduced by BenOr, Goldwasser, Kilian, and Wigderson (1988). In this system, two allpowerful noncommunicating provers convince a randomizing polynomial time verifier in polynomial time that the input z belongs to the language ..."
Abstract

Cited by 416 (37 self)
 Add to MetaCart
are strictly stronger than without, since NEXP # NP. In particular, for the first time, provably polynomial time intractable languages turn out to admit “efficient proof systems’’ since NEXP # P. We show that to prove membership in languages in EXP, the honest provers need the power of EXP only. A consequence
Results 1  10
of
17,501