Ingo Althöfer

Available identifiers

zbMath Open althofer.ingoDBLP38/2620WikidataQ35168428 ScholiaQ35168428MaRDI QIDQ328542

List of research outcomes

Publication	Date of Publication	Type
Number theory and number games. Seven selected topics	2024-10-22	Paper
Generating sparse spanners for weighted graphs	2022-12-09	Paper
Computer-aided Go: Chess as a role model	2018-10-26	Paper
An analysis of majority systems with dependent agents in a simple subtraction game	2018-10-26	Paper
The problem of approach in differential-difference games	2016-10-20	Paper
A Condorcet jury theorem for couples	2016-07-06	Paper
Anomalies of Pure Monte-Carlo Search in Monte-Carlo Perfect Games	2015-09-29	Paper
On taxed matrix games and changes in the expected transfer	2014-09-30	Paper
Zahlentheorie und Zahlenspiele	2014-05-15	Paper
Remarks on History and Presence of Game Tree Search and Research	2013-04-09	Paper
Improved game play by multiple computer hints	2004-10-27	Paper
https://portal.mardi4nfdi.de/entity/Q4946039	2001-01-30	Paper
Two-best solutions under distance constraints: The model and exemplary results for matroids	1999-10-11	Paper
\(k\)-best solutions under distance constraints in valuated \(\Delta\)-matroids	1999-06-28	Paper
Edge search in hypergraphs	1997-06-10	Paper
Superlinear period lengths in some subtraction games	1997-02-28	Paper
Correlation of Boolean Functions and Pathology in Recursion Trees	1996-07-02	Paper
The asymptotic behaviour of diameters in the average	1995-05-17	Paper
Note: Small integral flows need only sparse networks	1995-02-19	Paper
On sparse approximations to randomized strategies and convex combinations	1994-05-09	Paper
A Parallel Game Tree Search Algorithm With A Linear Speedup	1994-02-09	Paper
On the deterministic complexity of searching local maxima	1993-08-17	Paper
Edge search in graphs and hypergraphs of bounded rank	1993-06-20	Paper
A game tree with distinct leaf values which is easy for the alpha-beta algorithm	1992-09-26	Paper
On the convergence of ``threshold accepting	1992-06-26	Paper
An ``average distance inequality for large subsets of the cube	1992-01-01	Paper
The complexity of a simple stochastic OR-tree model in which ``directional search is bad	1990-01-01	Paper
Tight lower bounds on the length of word chains	1990-01-01	Paper
Average distances in undirected graphs and the removal of vertices	1990-01-01	Paper
An incremental negamax algorithm	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3476284	1990-01-01	Paper
Asymptotic properties of level-regular decision trees with randomly evaluated leaves	1989-01-01	Paper
On optimal realizations of finite metric spaces by graphs	1988-01-01	Paper
Nim games with arbitrary periodic moving orders	1988-01-01	Paper
On the complexity of searching game trees and other recursion trees	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3757726	1986-01-01	Paper

Research outcomes over time

This page was built for person: Ingo Althöfer