89-005   Ingo Althöfer, Klaus-Uwe Koschnick
         On the Convergence of "Threshold Accepting"


89-024   Ingo Althöfer
         Spanners of Graphs with Arbitrary Edge Lengths


90-053   Ingo Althöfer, Imre Leader
         A Correlation Inequality for Two-valued Functions of
         Two-valued Random Variables


90-069   Ingo Althöfer, Eberhard Triesch
         Edge Search in Graphs and Hypergraphs of Bounded Rank


90-097   Ingo Althöfer, Bernhard Balkenhol
         A Game Tree with Distinct Leaf Values which is Easy
         for the Alpha-Beta Algorithm


91-006   Ingo Althöfer, Torsten Sillke
         An "Average Distance" Inequality for Subsets of the Cube



91-099   Rudolf Ahlswede, Ingo Althöfer
         The Asymptotic Behaviour of Diameters in the Average


93-003   Ingo Althöfer           
         Small Integral Flows Need Only Sparse Networks   



93-004   Ingo Althöfer                                 
         On Sparse Approximations to Randomized 
         Strategies and Convex Combinations
         revision: June 1993



93-069   Ingo Althöfer                                 
         Edge search in graphs and hypergraphs of bounded
         rank: average search length in the weighted case


E93-001  Ingo Althöfer  Sören  Perrey 
         Selective Search in Game Trees - An Algorithm 
         and Some Observations in a Stochastic Model



E93-003  Ingo Althöfer, Jörg Bültermann              
         Superlinear Period Lenghts in some Subtraction Games



94-060   Ingo Althöfer, Matthias Löwe                
         Edge Search in Graphs and Hypergraphs





 

Hauptseite

 

main site


 



For any questions and problems with this web site please email to
cdeppe@Mathematik.Uni-Bielefeld.DE. 
Last change: 12/10/1998