Uniformly growing backtrack trees

Rainer Kemp

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1995)

  • Volume: 29, Issue: 1, page 45-73
  • ISSN: 0988-3754

How to cite

top

Kemp, Rainer. "Uniformly growing backtrack trees." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 29.1 (1995): 45-73. <http://eudml.org/doc/92496>.

@article{Kemp1995,
author = {Kemp, Rainer},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {non-regularly distributed binary trees},
language = {eng},
number = {1},
pages = {45-73},
publisher = {EDP-Sciences},
title = {Uniformly growing backtrack trees},
url = {http://eudml.org/doc/92496},
volume = {29},
year = {1995},
}

TY - JOUR
AU - Kemp, Rainer
TI - Uniformly growing backtrack trees
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1995
PB - EDP-Sciences
VL - 29
IS - 1
SP - 45
EP - 73
LA - eng
KW - non-regularly distributed binary trees
UR - http://eudml.org/doc/92496
ER -

References

top
  1. 1. M. ABRAMOWITZ, I. A. STEGUN, Handbook of Mathematical Functions, Dover Publications, New York, 1970. Zbl0171.38503
  2. 2. L. COMTET, Advanced Combinatorics, D. Reidel, Dordrecht-Holland/Boston-USA, 1974. Zbl0283.05001MR460128
  3. 3. R. KEMP, Fundamentals of the Average Case Analysis of Particular Algorithms, Wiley-Teubner Series in Computer Science. Stuttgart, Teubner, Chichester, Wiley 1984. Zbl0638.68026MR786659
  4. 4. R. KEMP, The Analysis of an Additive Weight of Random Trees, J. Inf. Process. Cybern. EIK, 1987, 23, pp. 517-528. Zbl0641.68095MR935266
  5. 5. R. KEMP, The Expected Additive Weight of Trees, Acta Informatica, 1989, Vol. 26, pp. 711-740. Zbl0685.68023MR1021787
  6. 6. R. KEMP, Further Results on Leftist Trees, Random Graphs' 87, Wiley, 1990, pp. 103-130. Zbl0742.05030MR1094127
  7. 7. R. KEMP, On the Stack Size of a Class of Backtrack Trees, Teubner-Texte zur Informatik, Band 1, Teubner, 1992, pp. 269-282. MR1182576
  8. 8. D. E. KNUTH, The Art of Computer Programming, Vol. 1, (2nd. ed.), Addison Wesley, Reading Mass, 1973. Zbl0302.68010MR378456
  9. 9. P. W. PURDOM, Tree Size by Partial Backtracking, SIAM J. Comput., 1978, 7, 4, pp. 481-491. Zbl0386.68044MR508608
  10. 10. U. TRIER, Additive Weights of a Special Class of Nonuniformly Distributed Backtrack Trees, Inform. Proc. Letters, 1992, 42, pp. 67-76. Zbl0780.68068MR1170871
  11. 11. U. TRIER, On the Average Number of Registers Needed to Evaluate a Special Class of Backtrack Trees, R.A.I.R.O. Informatique théorique et Applications/Theoretical Informatics and Applications, 1993, 27, 6, pp. 541-554. Zbl0809.68104MR1258751

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.