Author of the publication

Concrete Mathematics: A Foundation for Computer Science

, , and . Addison-Wesley, Reading, MA, Second edition, (1994)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Concrete Mathematics: A Foundation for Computer Science, , and . Addison-Wesley, Reading, MA, Second edition, (1994)Bounds on Scheduling with Limited Resources., and . SOSP, page 104-111. ACM, (1973)Operating System Review 7(4).Guessing secrets with inner product questions., , and . SODA, page 247-253. ACM/SIAM, (2002)Routing Permutations on Graphs Via Matchings., , and . SIAM J. Discret. Math., 7 (3): 513-530 (1994)On graphs with linear Ramsey numbers., , and . J. Graph Theory, 35 (3): 176-192 (2000)Some Monotonicity Properties of Partial Orders., , and . SIAM J. Algebraic Discret. Methods, 1 (3): 251-258 (1980)Bounds on multiprocessing anomalies and related packing algorithms.. AFIPS Spring Joint Computing Conference, volume 40 of AFIPS Conference Proceedings, page 205-217. AFIPS, (1972)Quantitative theorems for regular systems of equations., , and . J. Comb. Theory A, 47 (2): 246-261 (1988)Large minimal sets which force long arithmetic progressions., and . J. Comb. Theory A, 42 (2): 270-276 (1986)Iterated combinatorial density theorems., , and . J. Comb. Theory A, 54 (1): 95-111 (1990)