R.L. Graham, D.E. Knuth and O. Patashnik, Concrete Mathematics, 2nd ed. (Addison-Wesley, Reading, 1994). Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Deriving Laws from Ordering Relations - Knuth Self-citation (Knuth) (Correct)
No context found.
Graham, R. L., Knuth, D. E., and Patashnik, O., Concrete Mathematics, 2nd ed., Addison-Wesley, Reading, Massachusetts, 1994.
A bijective proof of Riordan's theorem on powers of.. - Andrej Dujella.. (Correct)
No context found.
R.L. Graham, D.E. Knuth and O. Patashnik, Concrete Mathematics, 2nd ed. (Addison-Wesley, Reading, 1994).
On Optimizing Multi-Sequence Functionals for Competitive.. - Tom Kamphans Elmar (Correct)
No context found.
R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics. Addison-Wesley, Reading, MA, second edition, 1994.
Differential Equations, Spencer Cohomology, and Computing.. - Lambe, Seiler (Correct)
No context found.
R.L. Graham, D.E. Knuth, and O. Patashnik. Concrete Mathematics. Addison Wesley, 1989.
On Constructing Resolutions Over The Polynomial Algebra - Johansson, Lambe, Sköldberg (2000) (Correct)
No context found.
R.L. Graham, D.E. Knuth, and O. Patashnik. Concrete Mathematics. Addison Wesley, 1989.
Computing Resolutions over Finite p-Groups - Grabmeier, Lambe (2000) (1 citation) (Correct)
No context found.
R.L. Graham, D.E. Knuth, and O. Patashnik. Concrete Mathematics. AddisonWesley, Reading, Massachusetts, 1989.
The Construction of Orthonormal Wavelets Using - Symbolic Methods And (Correct)
No context found.
R.L. Graham, D.E. Knuth, and O. Patashnik. Concrete Mathematics. Addison-Wesley, 2nd edition, 1994.
Coping With Uncertainty in Map Learning - Kenneth Basye Thomas (1989) (20 citations) (Correct)
No context found.
[ Graham et Graham, Ronald L.# Knuth, Donald E.# and Oren, Patashnik 1989. Concrete Mathematics. Addison-Wesley, Reading, Massachusetts.
Differential Equations, Spencer Cohomology, and Computing.. - Lambe, Seiler (2002) (Correct)
No context found.
R.L. Graham, D.E. Knuth, and O. Patashnik. Concrete Mathematics. Addison Wesley, 1989.
Computing Resolutions over Finite p-Groups - Grabmeier, Lambe (2000) (1 citation) (Correct)
No context found.
R.L. Graham, D.E. Knuth, and O. Patashnik. Concrete Mathematics. AddisonWesley, Reading, Massachusetts, 1989.
On Constructing Resolutions over the Polynomial Algebra - Johansson, Lambe, Sköldberg (2000) (Correct)
No context found.
R.L. Graham, D.E. Knuth, and O. Patashnik. Concrete Mathematics. Addison Wesley, 1989.
Analyzing the Stochastic Complexity via Tree Polynomials - Kontkanen, Myllymäki (2005) (Correct)
No context found.
R.L. Graham, D.E. Knuth, and O. Patashnik. Concrete Mathematics (second edition). AddisonWesley, 1994.
On the Complexity of Constrained VC-Classes Joel Ratsaby - Ben Gurion University (Correct)
No context found.
R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics. Addison-Wesley, 1994.
Θ-Graceful Labelings of Partial Cubes - Bresar, Klavzar (Correct)
No context found.
R.L. Graham, D.E. Knuth, O. Patashnik, Concrete Mathematics, second ed., Addison-Wesley, Reading, MA, 1994.
Transistor Chaining with Integrated Dynamic Folding - For Leaf Cell (2001) (Correct)
No context found.
R. L. Graham, D. E. Knuth i O. Patashnik. Concrete Mathematics. Addison-Wesley, Reading, Massachusetts, 1994.
Software Methods to Improve Data Locality and Cache Behavior - Beyls (2004) (Correct)
No context found.
R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics. Addison-Wesley, 1989. 4.4.2
A Naïve Time Analysis and its Theory of Cost Equivalence - Sands (1995) (Correct)
No context found.
R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics. Addison-Wesley, 1989.
Probabilistic and Nondeterministic Unary Automata - Gramlich (2003) (Correct)
No context found.
Graham, R., Knuth, D., Patashnik, O.: Concrete Mathematics, Addison Wesley, Reading, Massachusetts, 1989.
Θ-Graceful Labelings of Partial Cubes - Bresar, Klavzar (Correct)
No context found.
R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics, 2nd Edition, Addison-Wesley, Reading, 1994.
Hanoi graphs and some classical numbers - Klavzar, al. (2005) (Correct)
No context found.
R.L. Graham, D.E. Knuth, O. Patashnik, Concrete Mathematics, second ed., Addison-Wesley, Reading, MA, 1994. 9
On the Membership of Invertible Diagonal Matrices - Bell, Potapov (2005) (Correct)
No context found.
R.Graham, D.Knuth, O.Patashnik. Concrete Mathematics. 2nd edition, AddisonWesley, 1994
From Post Systems to the Reachability Problems for Matrix.. - Potapov (2004) (Correct)
No context found.
R.Graham, D.Knuth, O.Patashnik. Concrete Mathematics. 2nd edition, AddisonWesley, 1994
A bijective proof of Riordan's theorem on powers of Fibonacci.. - Dujella (1999) (Correct)
No context found.
R.L. Graham, D.E. Knuth and O. Patashnik, Concrete Mathematics, 2nd ed. (Addison-Wesley, Reading, 1994).
Dynamic Frequency Scaling with Buffer Insertion for Mixed.. - Lu, Benini, De Micheli (2002) (1 citation) (Correct)
No context found.
R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics. New York: Addison-Wesley, 1989.
Fast Algorithms to Generate Necklaces, Unlabeled Necklaces.. - Cattell, al. (2000) (Correct)
No context found.
R. L. Graham, D. E. Knuth, and O. Patashnik, "Concrete Mathematics," AddisonWesley, Reading, MA, 1989. Z. 12. R. A. Kaye, A Gray code for set partitions, Inform. Process. Lett. 5 1976 , 171#173.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC