default search action
Werner Schachinger
Person information
SPARQL queries
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j19]Guy Louchard, Werner Schachinger, Mark Daniel Ward:
The number of distinct adjacent pairs in geometrically distributed words: a probabilistic and combinatorial analysis. Discret. Math. Theor. Comput. Sci. 25(2) (2023) - 2020
- [j18]Immanuel M. Bomze, Werner Schachinger:
Constructing Patterns of (Many) ESSs Under Support Size Control. Dyn. Games Appl. 10(3): 618-640 (2020)
2010 – 2019
- 2019
- [j17]Immanuel M. Bomze, Panayotis Mertikopoulos, Werner Schachinger, Mathias Staudigl:
Hessian Barrier Algorithms for Linearly Constrained Optimization Problems. SIAM J. Optim. 29(3): 2100-2127 (2019) - 2018
- [j16]Immanuel M. Bomze, Werner Schachinger, Reinhard Ullrich:
The Complexity of Simple Models - A Study of Worst and Typical Hard Cases for the Standard Quadratic Optimization Problem. Math. Oper. Res. 43(2): 651-674 (2018) - [i1]Immanuel M. Bomze, Panayotis Mertikopoulos, Werner Schachinger, Mathias Staudigl:
Hessian barrier algorithms for linearly constrained optimization problems. CoRR abs/1809.09449 (2018) - 2015
- [j15]Immanuel M. Bomze, Werner Schachinger, Reinhard Ullrich:
New Lower Bounds and Asymptotics for the cp-Rank. SIAM J. Matrix Anal. Appl. 36(1): 20-37 (2015) - 2013
- [j14]Naomi Shaked-Monderer, Immanuel M. Bomze, Florian Jarre, Werner Schachinger:
On the cp-Rank and Minimal cp Factorizations of a Completely Positive Matrix. SIAM J. Matrix Anal. Appl. 34(2): 355-368 (2013) - 2012
- [j13]Immanuel M. Bomze, Werner Schachinger, Gabriele Uchida:
Think co(mpletely)positive ! Matrix properties, examples and a clustered bibliography on copositive optimization. J. Glob. Optim. 52(3): 423-445 (2012) - 2011
- [j12]Paul Tseng, Immanuel M. Bomze, Werner Schachinger:
A first-order interior-point method for linearly constrained smooth optimization. Math. Program. 127(2): 399-424 (2011) - 2010
- [j11]Immanuel M. Bomze, Werner Schachinger:
Multi-Standard Quadratic Optimization: interior point methods and cone programming reformulation. Comput. Optim. Appl. 45(2): 237-256 (2010) - [j10]Bernardetta Addis, Werner Schachinger:
Morse potential energy minimization: Improved bounds for optimal configurations. Comput. Optim. Appl. 47(1): 129-131 (2010)
2000 – 2009
- 2009
- [j9]Werner Schachinger, Immanuel M. Bomze:
A Conic Duality Frank-Wolfe-Type Theorem via Exact Penalization in Quadratic Optimization. Math. Oper. Res. 34(1): 83-91 (2009) - [j8]Bernardetta Addis, Werner Schachinger:
Improved bounds for interatomic distance in Morse clusters. Oper. Res. Lett. 37(4): 290-294 (2009) - 2007
- [j7]Werner Schachinger, Bernardetta Addis, Immanuel M. Bomze, Fabio Schoen:
New results for molecular formation under pairwise potential minimization. Comput. Optim. Appl. 38(3): 329-349 (2007) - 2004
- [j6]Werner Schachinger:
Concentration of Size and Path Length of Tries. Comb. Probab. Comput. 13(4-5): 763-793 (2004) - [j5]Werner Schachinger:
Distributional Results for Costs of Partial Match Queries in Asymmetric K-Dimensional Tries. SIAM J. Comput. 33(4): 952-983 (2004) - 2001
- [j4]Werner Schachinger:
Asymptotic normality of recursive algorithms via martingale difference arrays. Discret. Math. Theor. Comput. Sci. 4(2): 363-398 (2001) - 2000
- [j3]Werner Schachinger:
Limiting distributions for the costs of partial match retrievals in multidimensional tries. Random Struct. Algorithms 17(3-4): 428-459 (2000)
1990 – 1999
- 1995
- [j2]Werner Schachinger:
The Variance of Partial Match Retrieval in a Multidimensional Symmetric Trie. Random Struct. Algorithms 7(1): 81-96 (1995) - [j1]Werner Schachinger:
On the Variance of a Class of Inductive Valuations of Data Structures for Digital Search. Theor. Comput. Sci. 144(1&2): 251-275 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint