Improved upper bounds for the star discrepancy of digital nets in dimension 3
Friedrich Pillichshammer (2003)
Acta Arithmetica
Similarity:
Friedrich Pillichshammer (2003)
Acta Arithmetica
Similarity:
David Ralston (2012)
Acta Arithmetica
Similarity:
(2012)
Acta Arithmetica
Similarity:
Henri Faure, Friedrich Pillichshammer (2013)
Acta Arithmetica
Similarity:
In uniform distribution theory, discrepancy is a quantitative measure for the irregularity of distribution of a sequence modulo one. At the moment the concept of digital (t,s)-sequences as introduced by Niederreiter provides the most powerful constructions of s-dimensional sequences with low discrepancy. In one dimension, recently Faure proved exact formulas for different notions of discrepancy for the subclass of NUT digital (0,1)-sequences. It is the aim of this paper to generalize...
B. Chazelle, M. Sharir, J. Matousek (1995)
Discrete & computational geometry
Similarity:
Roswitha Hofer, Gerhard Larcher (2010)
Acta Arithmetica
Similarity:
Henri Faure, Friedrich Pillichshammer, Gottlieb Pirsic, Wolfgang Ch. Schmid (2010)
Acta Arithmetica
Similarity:
L. Takács (1969)
Applicationes Mathematicae
Similarity:
Gerald Lüttgen, Walter Vogler (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
More than a decade ago, Moller and Tofts published their seminal work on relating processes, which are annotated with lower time bounds, with respect to speed. Their paper has left open many questions regarding the semantic theory for the suggested bisimulation-based faster-than preorder, the MT-preorder, which have not been addressed since. The encountered difficulties concern a general compositionality result, a complete axiom system for finite processes, a convincing intuitive...
J. Matousek (1995)
Discrete & computational geometry
Similarity:
Henri Faure, Christiane Lemieux (2012)
Acta Arithmetica
Similarity:
J. Eichenauer-Herrmann (1998)
Monatshefte für Mathematik
Similarity:
Gnewuch, Michael (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Alexander Zeifman, Anna Korotysheva, Yacov Satin, Victor Korolev, Sergey Shorgin, Rostislav Razumchik (2015)
International Journal of Applied Mathematics and Computer Science
Similarity:
Service life of many real-life systems cannot be considered infinite, and thus the systems will be eventually stopped or will break down. Some of them may be re-launched after possible maintenance under likely new initial conditions. In such systems, which are often modelled by birth and death processes, the assumption of stationarity may be too strong and performance characteristics obtained under this assumption may not make much sense. In such circumstances, timedependent analysis...
William W. L. Chen, Giancarlo Travaglini (2011)
Acta Arithmetica
Similarity:
J. Kaczorowski, A. Perelli (2012)
Acta Arithmetica
Similarity: