Asymptotic properties of certain competition systems in artificial intelligence and ecology. - Ingo Althöfer (1986)

A Prize for Symbiosis. - Ingo Althöfer (J. Int. Comput. Games Assoc., 1987)

On Optimal Realizations of Finite Metric Spaces by Graphs. - Ingo Althöfer (Discret. Comput. Geom., 1988)

Root Evaluation Errors: How they Arise and Propagate. - Ingo Althöfer (J. Int. Comput. Games Assoc., 1988)

Report on the Workshop "Computer Chess and Game Trees". - Ingo Althöfer (J. Int. Comput. Games Assoc., 1988)

Reviews. - Ingo Althöfer (J. Int. Comput. Games Assoc., 1988)

On the Complexity of Searching Game Trees and Other Recursion Trees. - Ingo Althöfer (J. Algorithms, 1988)

Retrograde Analysis and Two Computerizable Definitions of the Quality of Chess Games. - Ingo Althöfer (J. Int. Comput. Games Assoc., 1989)

A Conjecture Withdrawn. - Ingo Althöfer (J. Int. Comput. Games Assoc., 1989)

Generating Sparse Spanners for Weighted Graphs. - Ingo Althöfer; Gautam Das 001; David P. Dobkin; Deborah Joseph (SWAT, 1990)

An Incremental Negamax Algorithm. - Ingo Althöfer (Artif. Intell., 1990)

Review. - Ingo Althöfer (J. Int. Comput. Games Assoc., 1990)

Compressing Chess Games with the Help of a Fast Deterministic Chess Program. - Ingo Althöfer (J. Int. Comput. Games Assoc., 1990)

Symmetrical Chess. - David L. Dowe; Ingo Althöfer; John Roycroft (J. Int. Comput. Games Assoc., 1990)

Tight Lower Bounds on the Length of Word Chains. - Ingo Althöfer (Inf. Process. Lett., 1990)

The complexity of a simple stochastic OR-tree model in which "directional search" is bad. - Ingo Althöfer (J. Complex., 1990)

Average distances in undirected graphs and the removal of vertices. - Ingo Althöfer (J. Comb. Theory B, 1990)

Data Compression Using an Intelligent Generator: The Storage of Chess Games as an Example. - Ingo Althöfer (Artif. Intell., 1991)

Sören W. Perrey: Mathematische Methoden der Künstlichen Intelligenz: Zur Quiescence-Suche in Spielbäumen. - Ingo Althöfer (J. Int. Comput. Games Assoc., 1991)

An Additive Evaluation Function in Chess. - Ingo Althöfer (J. Int. Comput. Games Assoc., 1991)

A Game Tree with Distinct Leaf Values which is Easy for the Alpha-Beta Agorithm. - Ingo Althöfer; Bernhard Balkenhol (Artif. Intell., 1992)

On Asymmetries in Chess Programs. - Ingo Althöfer (J. Int. Comput. Games Assoc., 1992)

B. Balkenhol: K-reguläre Minimax-Bäume mit distinkten Blattwerten, die bei beliebiger Sortierung "leicht" für den alpha-beta Algorithmus sind. - Ingo Althöfer (J. Int. Comput. Games Assoc., 1992)

Move Ordering by Time Ordering. - Ingo Althöfer (J. Int. Comput. Games Assoc., 1992)

An "average distance" inequality for large subsets of the cube. - Ingo Althöfer; Torsten Sillke (J. Comb. Theory B, 1992)

On the Deterministic Complexity of Searching Local Maxima. - Ingo Althöfer; Klaus-Uwe Koschnick (Discret. Appl. Math., 1993)

On Sparse Spanners of Weighted Graphs. - Ingo Althöfer; Gautam Das 001; David P. Dobkin; Deborah Joseph; José Soares (Discret. Comput. Geom., 1993)

Edge search in graphs and hypergraphs of bounded rank. - Ingo Althöfer; Eberhard Triesch (Discret. Math., 1993)

On Telescoping Linear Evaluation Functions. - Ingo Althöfer (J. Int. Comput. Games Assoc., 1993)

A Parallel Game Tree Search Algorithm with a Linear Speedup. - Ingo Althöfer (J. Algorithms, 1993)

Weak Zugzwang: Statistics on some Chess Endgames. - Ingo Althöfer; Bernhard Walter (J. Int. Comput. Games Assoc., 1994)

The Asymptotic Behavior of Diameters in the Average. - Rudolf Ahlswede; Ingo Althöfer (J. Comb. Theory B, 1994)

Note: Small integral flows need only sparse networks. - Ingo Althöfer (Networks, 1994)

Correlation of Boolean Functions and Pathology in Recursion Trees. - Ingo Althöfer; Imre Leader (SIAM J. Discret. Math., 1995)

Superlinear Period Lengths in Some Subtraction Games. - Ingo Althöfer; Jörg Bültermann (Theor. Comput. Sci., 1995)

Edge search in hypergraphs. - Ingo Althöfer; Matthias Löwe (Discret. Math., 1996)

A Symbiosis of Man and Machine Beats Grandmaster Timoshchenko. - Ingo Althöfer (J. Int. Comput. Games Assoc., 1997)

On the K-Best Mode in Computer Chess: Measuring the Similarity of Move Proposals. - Ingo Althöfer (J. Int. Comput. Games Assoc., 1997)

13 Jahre 3-Hirn - meine Schach-Experimente mit Mensch-Maschinen-Kombinationen: das 3-Hirn-Prinzip. - Ingo Althöfer (Selbstverl., 1998)

LIST-3-HIRN vs. Grandmaster Yusupov. - Ingo Althöfer (J. Int. Comput. Games Assoc., 1998)

LIST-3-HIRN vs. Grandmaster Yusupov, A Report on a very Experimental Match Part II: Analysis. - Ingo Althöfer (J. Int. Comput. Games Assoc., 1998)

Technical Proposals on "Advanced Chess". - Ingo Althöfer (J. Int. Comput. Games Assoc., 1998)

Corrections on Dap Hartmann's Review of "13 Years of 3-Hirn". - Ingo Althöfer (J. Int. Comput. Games Assoc., 1999)

Advanced Shuffle Chess with Technical Improvements. - Ingo Althöfer (J. Int. Comput. Games Assoc., 1999)

A One-Sided Advanced Chess Match. - Ingo Althöfer (J. Int. Comput. Games Assoc., 2000)

Playing Games with Multiple Choice Systems. - Ingo Althöfer; Raymond Georg Snatzke (Computers and Games, 2002)

A 20-Choice Experiment in Go for Human+Computer. - Ingo Althöfer (J. Int. Comput. Games Assoc., 2003)

Five Visualisations of the k-best Mode. - Ingo Althöfer; Johan de Koning; Jens Lieberum; Stefan Meyer-Kahlen; Thomas Rolle; Jörg Sameith (J. Int. Comput. Games Assoc., 2003)

Improved game play by multiple computer hint. - Ingo Althöfer (Theor. Comput. Sci., 2004)

Randomised Evaluations in Single-Agent Search. - Ingo Althöfer; Susanne Heuser (J. Int. Comput. Games Assoc., 2005)

Automatic Generation and Evaluation of Recombination Games. - Ingo Althöfer (J. Int. Comput. Games Assoc., 2010)

On Board-Filling Games with Random-Turn Order and Monte Carlo Perfectness. - Ingo Althöfer (ACG, 2011)

John Tromp in the Style of David Levy: 4-0 Win in the Go Bet. - Ingo Althöfer (J. Int. Comput. Games Assoc., 2011)

On Games with Random-Turn Order and Monte Carlo Perfectness. - Ingo Althöfer (J. Int. Comput. Games Assoc., 2011)

The Origin of Dynamic Komi. - Ingo Althöfer (J. Int. Comput. Games Assoc., 2012)

Side Report: Popular Video Livestream. - Ingo Althöfer (J. Int. Comput. Games Assoc., 2012)

PAN Wins Clobber Tournament. - Ingo Althöfer (J. Int. Comput. Games Assoc., 2012)

Havannah - The Old Man and the C's. - Ingo Althöfer (J. Int. Comput. Games Assoc., 2012)

Remarks on History and Presence of Game Tree Search and Research. - Ingo Althöfer (Information Theory, Combinatorics, and Search Theory, 2013)

Anomalies of Pure Monte-Carlo Search in Monte-Carlo Perfect Games. - Ingo Althöfer; Wesley Michael Turner (Computers and Games, 2013)

Conference Report Day 1. - Ingo Althöfer (J. Int. Comput. Games Assoc., 2013)

The codecentric Go Challenge 2014: Franz-Josef Dickhut vs. CRAZY STONE. - Ingo Althöfer; Raymond Georg Snatzke (J. Int. Comput. Games Assoc., 2014)

On Some Random Walk Games with Diffusion Control. - Ingo Althöfer; Matthias Beckmann; Friedrich Salzer (ACG, 2015)

Alternating plane graphs. - Ingo Althöfer; Jan Kristian Haugland; Karl Scherer; Frank Schneider; Nico Van Cleemput (Ars Math. Contemp., 2015)

Obituary: John Nash, A Beautiful Mind has Gone. - Ingo Althöfer (J. Int. Comput. Games Assoc., 2015)

Advances in Computer Games Conference 2015: Report on Day 1. - Ingo Althöfer (J. Int. Comput. Games Assoc., 2015)

HANFRIED wins EinStein Würfelt Nicht! Tournament. - Ingo Althöfer (J. Int. Comput. Games Assoc., 2015)

Optimal Robot Play in Certain Chess Endgame Situations. - Michael Hartisch; Ingo Althöfer (J. Int. Comput. Games Assoc., 2015)

Computer-Aided Go: Chess as a Role Model. - Ingo Althöfer (Computers and Games, 2016)

An Analysis of Majority Systems with Dependent Agents in a Simple Subtraction Game. - Raphael Thiele; Ingo Althöfer (Computers and Games, 2016)

The problem of approach in differential-difference games. - Ievgen Liubarshchuk; Ingo Althöfer (Int. J. Game Theory, 2016)

Computer Chess and Chess Computers in East Germany. - Ingo Althöfer (J. Int. Comput. Games Assoc., 2020)

Analyzing a variant of Clobber: The game of San Jego. - Raphael Thiele; Ingo Althöfer (J. Int. Comput. Games Assoc., 2020)

Analysis of a Collatz Game and Other Variants of the 3n+1 Problem. - Ingo Althöfer; Michael Hartisch; Thomas Zipproth (ACG, 2023)

Ning Cai: A Tribute to a Pioneering Scholar in Information Theory. - Ingo Althöfer; Holger Boche; Christian Deppe; Ulrich Tamm; Andreas J. Winter 002; Raymond W. Yeung (Information Theory and Related Fields, 2025)