840 search results - page 41 / 168 » The Complexity of the Extended GCD Problem |
SPAA
2009
ACM
14 years 5 months ago
2009
ACM
Cache-oblivious algorithms have the advantage of achieving good sequential cache complexity across all levels of a multi-level cache hierarchy, regardless of the specifics (cache...
ESOP
2001
Springer
14 years 9 days ago
2001
Springer
Equality constraints (unification constraints) have widespread use in program analysis, most notably in static polymorphic type systems. Conditional equality constraints extend eq...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
We study the problem of computing zigzag persistence of a sequence of homology groups and study a particular sequence derived from the levelsets of a real-valued function on a top...
CAINE
2008
13 years 9 months ago
2008
This paper describes an algorithm that pieces together 2D fragments of an object. Matching fragments of an object is useful for solving puzzles or reassembling archaeological frag...
ICDCN
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. The current paper considers the routing problem in dynamic trees under the fixed-port model, in which an adversary chooses the port numbers assigned to each node. We pre...