Ingo Althöfer

	2005
24		Ingo Althöfer, Susanne Heuser: Randomised Evaluations in Single-Agent Search. ICGA Journal 28(1): 21-31 (2005)
	2004
23		Ingo Althöfer: Improved game play by multiple computer hint. Theor. Comput. Sci. 303(3): 315-324 (2004)
	2003
22		Ingo Althöfer: A 20-Choice Experiment in Go for Human+Computer. ICGA Journal 26(2): 108-114 (2003)
21		Ingo Althöfer, Johan de Koning, Jens Lieberum, Stefan Meyer-Kahlen, Thomas Rolle, Jörg Sameith: Five Visualisations of the k-best Mode. ICGA Journal 26(3): 182-189 (2003)
	2002
20		Ingo Althöfer, Raymond Georg Snatzke: Playing Games with Multiple Choice Systems. Computers and Games 2002: 142-153
	1998
19		Ingo Althöfer: 13 Jahre 3-Hirn - meine Schach-Experimente mit Mensch-Maschinen-Kombinationen: das 3-Hirn-Prinzip. Selbstverl. 1998: 1-348
	1996
18		Ingo Althöfer, Matthias Löwe: Edge search in hypergraphs. Discrete Mathematics 162(1-3): 267-271 (1996)
	1995
17		Ingo Althöfer, Imre Leader: Correlation of Boolean Functions and Pathology in Recursion Trees. SIAM J. Discrete Math. 8(4): 526-535 (1995)
16		Ingo Althöfer, Jörg Bültermann: Superlinear Period Lengths in Some Subtraction Games. Theor. Comput. Sci. 148(1): 111-119 (1995)
	1994
15		Rudolf Ahlswede, Ingo Althöfer: The Asymptotic Behavior of Diameters in the Average. J. Comb. Theory, Ser. B 61(2): 167-177 (1994)
	1993
14		Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph, José Soares: On Sparse Spanners of Weighted Graphs. Discrete & Computational Geometry 9: 81-100 (1993)
13		Ingo Althöfer, Klaus-Uwe Koschnick: On the Deterministic Complexity of Searching Local Maxima. Discrete Applied Mathematics 43(2): 111-113 (1993)
12		Ingo Althöfer, Eberhard Triesch: Edge search in graphs and hypergraphs of bounded rank. Discrete Mathematics 115(1-3): 1-9 (1993)
11		Ingo Althöfer: A Parallel Game Tree Search Algorithm with a Linear Speedup. J. Algorithms 15(2): 175-198 (1993)
	1992
10		Ingo Althöfer, Bernhard Balkenhol: A Game Tree with Distinct Leaf Values which is Easy for the Alpha-Beta Agorithm. Artif. Intell. 52(2): 183-190 (1992)
9		Ingo Althöfer, Torsten Sillke: An "average distance" inequality for large subsets of the cube. J. Comb. Theory, Ser. B 56(2): 296-301 (1992)
	1991
8		Ingo Althöfer: Data Compression Using an Intelligent Generator: The Storage of Chess Games as an Example. Artif. Intell. 52(1): 109-113 (1991)
	1990
7		Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph: Generating Sparse Spanners for Weighted Graphs. SWAT 1990: 26-37
6		Ingo Althöfer: An Incremental Negamax Algorithm. Artif. Intell. 43(1): 57-65 (1990)
5		Ingo Althöfer: Tight Lower Bounds on the Length of Word Chains. Inf. Process. Lett. 34(5): 275-276 (1990)
4		Ingo Althöfer: Average distances in undirected graphs and the removal of vertices. J. Comb. Theory, Ser. B 48(1): 140-142 (1990)
3		Ingo Althöfer: The complexity of a simple stochastic OR-tree model in which "directional search" is bad. J. Complexity 6(3): 264-277 (1990)
	1988
2		Ingo Althöfer: On Optimal Realizations of Finite Metric Spaces by Graphs. Discrete & Computational Geometry 3: 103-122 (1988)
1		Ingo Althöfer: On the Complexity of Searching Game Trees and Other Recursion Trees. J. Algorithms 9(4): 538-567 (1988)

Coauthor Index

1	Rudolf Ahlswede	[15]
2	Bernhard Balkenhol	[10]
3	Jörg Bültermann	[16]
4	Gautam Das	[7] [14]
5	David P. Dobkin	[7] [14]
6	Susanne Heuser	[24]
7	Deborah Joseph	[7] [14]
8	Johan de Koning	[21]
9	Klaus-Uwe Koschnick	[13]
10	Imre Leader	[17]
11	Jens Lieberum	[21]
12	Matthias Löwe	[18]
13	Stefan Meyer-Kahlen	[21]
14	Thomas Rolle	[21]
15	Jörg Sameith	[21]
16	Torsten Sillke	[9]
17	Raymond Georg Snatzke	[20]
18	José Soares	[14]
19	Eberhard Triesch	[12]

Colors in the list of coauthors

Last update Sat May 26 04:23:17 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page