Nicholas Delillo, PHD

Nicholas Delillo, PHD

EMAIL ONLY

Department :

Email : nicholas.delillo@manhattan.edu

Phone : 718-862-7375

Office : RLC 201

Education

PHD, New York University
MA, Fordham University
BS, Manhattan College

Professional Experience

  • Instructor in Mathematics, Manhattan College, September, 1963.
  • Assistant Professor of Mathematics, Manhattan College, September, 1968.
  • Associate Professor of Mathematics, Manhattan College, September, 1973.
  • Professor of Mathematics and Computer Science, Manhattan College, September, 1984.
  • Adjunct Professor of Mathematics, Herbert H. Lehman College, CUNY,  1972-1983.
  • Adjunct Professor of Computer Science, Iona College, 1982-present.
  • Adjunct Professor of Mathematics, Pace University, 1979-present.
  • Adjunct Professor of Computer Science, Pace University, 2001-present.

Publications & Professional Activities

  • (1)  “A Formal Characterization of Ordinal Numbers,” Notre Dame Journal of Formal Logic, XIV,3,July 1973, 397-400.
  • (2)  “A Note on Turing Machine Regularity and Primitive Recursion,” Notre Dame Journal of Formal Logic, XIX,2,April 1978, 289-294.
  • (3)  “Models of an Extension of the Theory ORD,” Notre Dame Journal of Formal Logic,XX,4,October 1979, 729-734.
  • (4)  Book: “Advanced Calculus With Applications,” ISBN 0-02-328220-7, Macmillan Publishing Co., Inc., 1982, 836 pages.
  • (5)  Book: “Computability with Pascal,” (with John S. Mallozzi),  ISBN 0-13-16443-2, Prentice-Hall, Inc., 1984, 193 pages.
  • (6)  “A Combinatorial Algorithm for Minimizing the Number of States of a Deterministic Finite-State Automaton,” Proceedings of the 1989 ACM Seventeenth Annual Computer Science Conference, Louisville, KY, ACM Press, 411.
  • (7)  Book: “A First Course in Computer Science with Ada,” ISBN 0-256-12538-4, Richard D. Irwin, Inc., 1993, 678 pages.
  • (8)  “A Combinatorial Algorithm for Minimizing the Number of States of a Deterministic Finite-State Automaton,” (with Richard D. Mancuso and Harry P. Negro) Technical Report Number 67, November 1993, School of Computer Science and Information Systems, Pace University, 23 pages. (Monograph)
  • (9) “An Object-Oriented Implementation of Local Area Networks,” Proceedings of the Eleventh Annual Eastern Small College Computing Conference, Iona College, New Rochelle, New York, October 20-21, 1995, 86-98. (refereed)
  • (10) “An Object-Oriented Implementation of the Graph ADT and Topological Sort,” (with Raymond B. Jennings III) Technical Report Number 102, Late August 1996, School of Computer Science and Information Systems, Pace University,43 pages. (Monograph)
  • (11) “An Object-Oriented Implementation of Graph Abstract Data Types: Recent Results,” Graph Theory Notes of New York, XXXIV (1998), 11-14 (refereed).
  • (12) “An Implementation of a Big Integer ADT,” Technical Report Number 125, March 1998, School of Computer Science and Information Systems, Pace University, pages. (Monograph)
  • (13) “An Implementation of Big Integers Using STL,” Proceedings of the Fourteenth Annual Eastern Small College  Computing Conference, Marist College, Poughkeepsie, New York, October 23-24, 1998, 81-101. (refereed)
  • (14)“A Local Network Simulator Using STL,” (with Kai Yu).  Technical Report Number 138, April 1999, School of Computer Science and Information Systems, Pace University, 5 pages (Monograph)
  • (15) “A Practical Application of the Vector Container Type,” Technical Report Number 141, July 1999, School of Computer Science and Information Systems, Pace University, 4 pages (Monograph).
  • (16) “Collecting Assessment Data,” (with John Beidler) 1999 Frontiers in Education Conference, San Juan, Puerto Rico, November 10-13, 1999. (refereed)
  • (17) “A  Simulator for a Priority Queue of Processes Using STL,” (with Sean M. Tynan) Technical Report Number 160, February 2001, School of Computer Science and Information Systems, Pace University, 10 pages (Monograph).
  • (18)  Book: “Object-Oriented Design in C++ Using the Standard Template Library,” ISBN 0-534-37782-3, Brooks/Cole Publishing Company, Inc., 2002, 460 pages.
  • (19)  “Implementing Hashing Using Separate Chaining in Java,” (with Timothy M. Dietrich) Technical Report Number 185, January 2003, School of Computer Science and Information Systems, Pace University, 12 pages (Monograph).
  • (20) Book: “Object-Oriented Design in C++ Using the Standard Template Library,” (Chinese Edition), ISBN 7-302-06007-X, Brooks/Cole Publishing Company, Inc., 2003, 377 pages.
  • (21)  Book:  “Object-Oriented Design in Java Using java.util,” ISBN 0-534-37784-X, Brooks/Cole Publishing Co., Inc., 2004, 462 pages.
  • (22) “Implementation of Graphs Using java.util, Part One: Preliminary Concepts,” Technical Report Number 224, March 2006, School of Computer Science and      Information Systems, Pace University,  29 pages (Monograph).
  • (23) “Implementation of Graphs Using java.util, Part Two: Weighted Graphs, Spanning Trees, and Shortest Paths,” Technical Report Number 225, April 2006, School of Computer Science and Information Systems, Pace University,  30 pages (Monograph)
  • (24) Book: “Data Structures Using Java 5.0,” ISBN 1-58874-594-5, Stipes Publishing L.L.C., 2006, 637 pages.
  • (25) “Implementation of Rotation in AVL Trees Using java.util,”(with Randall H. Swan)  Technical Report Number 248, March 2008, School of Computer Science and Information Systems, Pace University, 15 pages (Monograph).
  • (26) “Simulations of Finite-State Automata Using Java 6.0, Part One: Preliminaries,” Technical Report Number 256, Februaur 2009, Ivan G. Seidenberg School of Computer Science and Information Systems, Pace University, 12 pages (Monograph)
  • (27) “Simulations of Finite-State Automata Using Java 6.0, Part Two: Advanced Topics,” Technical Report Number 260, March 2009, Seidenberg School of       Computer Science and Information Systems, Pace University, 5 Pages (Monograph)
  • (28) “Simulations of Finite-State Automata Using Java 6.0, Part Three: Generalizations,” Ivan G. Seidenberg School of Computer Science and Information Systems, Pace University, June 2009, 10 Pages (Monograph)  
  • (29)“Simulations of Finite-State Automata Using the Standard Template Library: Variations on a Theme Using C++,” Technical Report Number 266, September  2009, Seidenberg School of Computer Science and Information Systems, Pace University, 17 pages (Monograph)  

Courses Taught/Teaching

CMPT 238      Data Structure
CMPT 335      Discrete Structures
MATH 100      Pre-Calculus Mathematics
MATH 105      Linear Math Analysis
MATH 106      Calculus Business Decisions
MATH 201      Calculus III
MATH 203      Differential Equations