W. Schachinger. On the variance of a class of inductive valuations of data structures for digital search.

Theoretical Computer Science 144 (1995), no. 1, 251 – 275.

W. Schachinger. The variance of a partial match retrieval in a multidimensional
symmetric trie.

Random Structures and Algorithms 7 (1995), no. 1, 81 – 95.

W. Schachermayer and W. Schachinger. Is there a predictable criterion for mutual
singularity of two probability measures on a filtered space?

Teor. Veroyatnost. i Primenen. 44 (1999), no. 1, 101 – 110.

Translation in: Theory of Probability and its Applications 44 (2000), no. 1, 51 – 59.

W. Schachinger. Limiting distributions for the costs of partial match retrievals
in multidimensional tries.

Random Structures and Algorithms 17 (2000), no. 3 – 4, 428 – 459.

P. Grandits and W. Schachinger. Leland's approach to option pricing: The evolution
of a discontinuity.

Mathematical Finance 11 (2001), no. 3, 347 – 355.

W. Schachinger. Asymptotic normality of recursive algorithms via martingale
difference arrays.

Discrete Mathematics and Theoretical Computer Science 4 (2001), no. 2, 363 – 397.

W. Schachinger. Concentration of size and path length of tries.

Combinatorics, Probability and Computing 13 (2004), no. 4 – 5, 763 – 793.

W. Schachinger. Distributional results for costs of partial match queries in
asymmetric K-dimensional tries.

SIAM J. Comput. 33 (2004), no. 4, 952 – 983.

W. Schachinger. An AEP-like property of the trie data structure.

Proceedings of the 38th Annual Conference on Information Sciences and Systems -
CISS 2004, 570 – 575, Princeton University, Princeton, NJ, March 2004.

W. Schachinger, B. Addis, I. Bomze and F. Schoen. New results for molecular
formation under pairwise potential minimization.

Comput. Optim. Appl. 38 (2007), no. 3, 329 – 349.

W. Schachinger and I. Bomze. A Conic Frank-Wolfe Type Theorem via Exact
Penalization in Quadratic Optimization.

Mathematics of OR 34 (2009), no.1, 83 – 91.

B. Addis and W. Schachinger. Improved bounds for interatomic distance in Morse
clusters.

OR Letters 37 (2009), 290 – 294.

I. Bomze and W. Schachinger. Multi-Standard Quadratic optimization problems:
interior point methods and cone programming reformulation.

Comput. Optim. Appl. 45 (2010), no. 2, 237 – 256.

B. Addis and W. Schachinger. Morse potential energy minimization: Improved bounds
for optimal configurations.

Comput. Optim. Appl. 47 (2010), no. 1, 129 – 131.

P. Tseng, I. Bomze and W. Schachinger. A First-Order Interior-Point Method for
Linearly Constrained Smooth Optimization.

Mathematical Programming 127 (2011), no. 2, 399 – 424.

I. Bomze, W. Schachinger and G. Uchida. Think co(mpletely )positive! Matrix properties,
examples and a clustered bibliography on copositive optimization.

J. Global Optim. 52 (2012), no. 3, 423 – 445.

N. Shaked-Monderer, I. Bomze, F. Jarre and W. Schachinger.
On the cp-rank and minimal cp factorizations of a completely positive matrix.

SIAM Journal on Matrix Analysis and Applications 34 (2013), no. 2, 355 – 368.

I. M. Bomze, W. Schachinger and R. Ullrich.
From seven to eleven: completely positive matrices with high cp-rank.

Linear Algebra and its Applications 459 (2014), 208 - 221.

N. Shaked-Monderer, A. Berman, I. Bomze, F. Jarre and W. Schachinger.
New results on the cp rank and related properties of co(mpletely )positive matrices.

Linear and Multilinear Algebra 63 (2015), 384 - 396.

I. M. Bomze, W. Schachinger and R. Ullrich.
New lower bounds and asymptotics for the cp-rank.

SIAM Journal on Matrix Analysis and Applications 36 (2015), no. 1, 20 - 37.

I. M. Bomze, W. Schachinger and R. Ullrich.
The complexity of simple models - a study of worst and typical hard cases for the Standard Quadratic Optimization Problem.

Mathematics of Operations Research, Published Online: October 3, 2017.