DCG
2010
13 years 4 months ago
2010
We show that any simple planar n-gon can be meshed in linear time by O(n) quadrilaterals with all new angles bounded between 60 and 120 degrees. 1991 Mathematics Subject Classifica...
DCG
2010
13 years 4 months ago
2010
Given any > 0 and any planar region bounded by a simple n-gon P we construct a (1 + )-quasiconformal map between and the unit disk in time C()n. One can take C() = C + C log ...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We relate the graph isomorphism problem to the solvability of certain systems of linear equations and linear inequalities. The number of these equations and inequalities is relate...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
It is surveyed known (published) possible application of binary and n-ary quasigroups in cryptology. Mathematics Subject Classification: 20N05, 94A60. Key words and phrases: Crypto...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. In this note we reinvestigate the task of computing creative telescoping relations in differential-difference operator algebras. Our approach is based on an ansatz that e...
AML
2008
13 years 5 months ago
2008
Using GCH, we force the following: There are continuum many simple cardinal characteristics with pairwise different values. Mathematics Subject Classification (2000) 03E17
AML
2008
13 years 5 months ago
2008
This article defines a hierarchy on the hereditarily finite sets which reflects the way sets are built up from the empty set by repeated adjunction, the addition to an already exis...
CONCUR
1992
Springer
13 years 9 months ago
1992
Springer
We introduce an ACP-style discrete-time process algebra with relative timing, that features the empty process. Extensions to this algebra are described, and ample attention is pai...