Skip header Section
Skip Bibliometrics Section
Elements of discrete mathematics (McGraw-Hill computer science series)January 1977
- Author:
- C. L Liu
Abstract
No abstract available.
Cited By
Cong J Transformation from ad hoc EDA to algorithmic EDA Proceedings of the 2012 ACM international symposium on International Symposium on Physical Design, (57-62)- Cong J, Fan Y, Han G, Jagannathan A, Reinman G and Zhang Z Instruction set extension with shadow registers for configurable processors Proceedings of the 2005 ACM/SIGDA 13th international symposium on Field-programmable gate arrays, (99-106)
- Olmos I, Gonzalez J and Osorio M Mining common patterns on graphs Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I, (41-48)
- Su Y, Su S and Li J (2005). Receiver-initiated multiple access protocols for spread spectrum mobile ad hoc networks, Computer Communications, 28:10, (1251-1265), Online publication date: 1-Jun-2005.
- Chen D and Cong J Register binding and port assignment for multiplexer optimization Proceedings of the 2004 Asia and South Pacific Design Automation Conference, (68-73)
- Sasao T and Butler J A fast method to derive minimum SOPs for decomposable functions Proceedings of the 2004 Asia and South Pacific Design Automation Conference, (585-590)
- Wu J and Yang Y (2019). The Postal Network, The Journal of Supercomputing, 19:2, (143-161), Online publication date: 9-Jun-2001.
- Jilani L, Desharnais J and Mili A (2001). Defining and Applying Measures of Distance Between Specifications, IEEE Transactions on Software Engineering, 27:8, (673-703), Online publication date: 1-Aug-2001.
- Cook C, Schoenfeld D and Wainwright R Finding rural postman tours Proceedings of the 1998 ACM symposium on Applied Computing, (318-326)
- Ramaswamy S, Sapatnekar S and Banerjee P (1997). A Framework for Exploiting Task and Data Parallelism on Distributed Memory Multicomputers, IEEE Transactions on Parallel and Distributed Systems, 8:11, (1098-1116), Online publication date: 1-Nov-1997.
- Chen C and Chen J Nearly Optimal One-To-Many Parallel Routing in Star Networks Proceedings of the 11th International Symposium on Parallel Processing, (728-733)
- Hoelting C, Schoenefeld D and Wainwright R Finding investigator tours in telecommunication networks using genetic algorithms Proceedings of the 1996 ACM symposium on Applied Computing, (82-87)
- Azadmanesh M and Kieckhafer R (1996). New Hybrid Fault Models for Asynchronous Approximate Agreement, IEEE Transactions on Computers, 45:4, (439-449), Online publication date: 1-Apr-1996.
- Hwang G, Lee J and Ju D An array operation synthesis scheme to optimize Fortran 90 programs Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming, (112-122)
- Hwang G, Lee J and Ju D (1995). An array operation synthesis scheme to optimize Fortran 90 programs, ACM SIGPLAN Notices, 30:8, (112-122), Online publication date: 1-Aug-1995.
- Nishida H and Mori S (2019). An Algebraic Approach to Automatic Construction of Structural Models, IEEE Transactions on Pattern Analysis and Machine Intelligence, 15:12, (1298-1311), Online publication date: 1-Dec-1993.
- Boudriga N, Elloumi F and Mili A (2018). On the lattice of specifications, Formal Aspects of Computing, 4:6, (544-571), Online publication date: 1-Nov-1992.
- Meknavin S, Okumura M and Tanaka H A chart-based method of ID/LP parsing with generalized discrimination networks Proceedings of the 14th conference on Computational linguistics - Volume 1, (401-407)
- Chew M and Strojwas A Utilizing logic information in multi-level timing simulation Proceedings of the 28th ACM/IEEE Design Automation Conference, (215-218)
- Cong J and Liu C On the k-layer planar subset and via minimization problems Proceedings of the conference on European design automation, (459-463)
- Mili H and Rada R (2019). Merging Thesauri, IEEE Transactions on Pattern Analysis and Machine Intelligence, 10:2, (204-220), Online publication date: 1-Mar-1988.
- Khuri S Counting nodes in binary trees Proceedings of the seventeenth SIGCSE technical symposium on Computer science education, (182-185)
- Khuri S (1986). Counting nodes in binary trees, ACM SIGCSE Bulletin, 18:1, (182-185), Online publication date: 1-Feb-1986.
- Dupras M, LeMay F and Mili A Some thoughts on teaching first year programming Proceedings of the fifteenth SIGCSE technical symposium on Computer science education, (148-153)
- Dupras M, LeMay F and Mili A (1984). Some thoughts on teaching first year programming, ACM SIGCSE Bulletin, 16:1, (148-153), Online publication date: 1-Feb-1984.
- Mili A A case for teaching program verification Proceedings of the fourteenth SIGCSE technical symposium on Computer science education, (2-6)
- Mili A (1983). A case for teaching program verification, ACM SIGCSE Bulletin, 15:1, (2-6), Online publication date: 1-Feb-1983.
- Pradhan D (1983). Sequential Network Design Using Extra Inputs for Fault Detection, IEEE Transactions on Computers, 32:3, (319-323), Online publication date: 1-Mar-1983.
- Bentley J, Haken D and Saxe J (1980). A general method for solving divide-and-conquer recurrences, ACM SIGACT News, 12:3, (36-44), Online publication date: 1-Sep-1980.
Index Terms
- Elements of discrete mathematics (McGraw-Hill computer science series)
Recommendations
Silver Bullet Talks with Gary McGraw
On the third-anniversary special of The Silver Bullet Security Podcast, James McGovern interviews host Gary McGraw.