ALMOST LINEAR UPPER-BOUNDS ON THE LENGTH OF GENERAL DAVENPORT-SCHINZEL SEQUENCES

被引：32

作者：

SHARIR, M ^{[1
]}

机构：

[1] TEL AVIV UNIV,SCH MATH SCI,IL-69978 TEL AVIV,ISRAEL

来源：

关键词：

D O I：

10.1007/BF02579209

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：131 / 143

页数：13

共 8 条

[1] The Hilbert construction of real numbers [J].

Ackermann, W .

[2]

Atallah M. J., 1983, 24th Annual Symposium on Foundations of Computer Science, P92, DOI 10.1109/SFCS.1983.13

[3]

Davenport H., 1965, AM J MATH, V87, P684

[4]

DAVENPORT H, 1971, ACTA ARITH, V17, P363

HART, S ;

SHARIR, M .

[6]

Roselle D., 1971, ACTA ARITH, VXVII, P355

[7]

Szemeredi E., 1974, ACTA ARITH, V25, P213

[8] EFFICIENCY OF A GOOD BUT NOT LINEAR SET UNION ALGORITHM [J].

TARJAN, RE .