Sciweavers

Share
7 search results - page 1 / 2
» Exponential lower bounds for the number of words of uniform ...
Sort
View
IANDC
2007
66views more  IANDC 2007»
10 years 2 months ago
Exponential lower bounds for the number of words of uniform length avoiding a pattern
We study words on a finite alphabet avoiding a finite collection of patterns. Given a pattern p in which every letter that occurs in p occurs at least twice, we show that the nu...
Jason P. Bell, Teow Lim Goh
CCA
2000
Springer
10 years 7 months ago
The Uniformity Conjecture
The Exact Geometric Computing approach requires a zero test for numbers which are built up using standard operations starting with the natural numbers. The uniformity conjecture, ...
Daniel Richardson
SIAMCOMP
2002
95views more  SIAMCOMP 2002»
10 years 2 months ago
Lower Bounds for Lucas Chains
Lucas chains are a special type of addition chains satisfying an extra condition: for the representation ak = aj + ai of each element ak in the chain, the difference aj - ai must a...
Martin Kutz
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
10 years 9 months ago
On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources
Abstract. The throughput capacity of arbitrary wireless networks under the physical Signal to Interference Plus Noise Ratio (SINR) model has received a greater deal of attention in...
Chen Avin, Zvi Lotker, Yvonne Anne Pignolet
CORR
2010
Springer
51views Education» more  CORR 2010»
10 years 2 months ago
On ternary square-free circular words
Circular words are cyclically ordered finite sequences of letters. We give a computer-free proof of the following result by Currie: square-free circular words over the ternary alp...
Arseny M. Shur
books