Eric J. Schwabe

Spring 2012 Courses:

CSC 202 Discrete Structures for Computer Science
(Section 901, Loop Campus, Monday 5:45pm-9:00pm and Section 910, Online Learning -- first class meeting March 26th)
Required text: Discrete Mathematics with Applications (fourth edition), Susanna S. Epp, ISBN 0495391328 or 978-0945391326
CSC 351/451 Database Design
    (Section 801, Loop Campus, Tuesdays 5:45pm-9:00pm and Section 810, Online Learning -- first class meeting March 27th)
    Required text: Database Design Using Entity-Relationship Diagrams (second edition), Sikha Bagui and Richard Earp, ISBN 1493861765 or 978-1439861769

Course syllabi are available here. Additional course information will be available here for enrolled students by the day of the first class meeting.

Efficient Data Mappings for Parity-Declustered Data Layouts. Theoretical Computer Science, Vol. 325, No 3., pp. 391-407, October 2004. (with I. M. Sutherland.)

Balancing Load versus Decreasing Communication: Parameterizing the Tradeoff. Journal of Parallel and Distributed Computing, Vol. 61, No. 5, pp. 567-580, May 2001. (with V. E. Taylor, B. K. Holmer, and M. R. Hribar.)

Flexible Usage of Redundancy in Disk Arrays. Theory of Computing Systems, Vol. 32, pp. 561-587, August 1999. (with I. M. Sutherland.)

Efficient Algorithms for Dynamic Allocation of Distributed Memory. Algorithmica, Vol. 24, pp. 139-171, March 1999. (with F. T. Leighton.)

Real-Time Emulations of Bounded-Degree Networks. Information Processing Letters, Vol. 66, No. 5, pp. 269-276, June 1998. (with B. M. Maggs.)

Evaluating Approximately Balanced Parity-Declustered Data Layouts for Disk Arrays. Parallel Computing, Vol. 23, No. 4-5, pp. 501-523, May 1997. (with I. M. Sutherland and B. K. Holmer.)

Improved Parity-Declustered Layouts for Disk Arrays. Journal of Computer and System Sciences, Vol. 53, No. 3, pp. 328-343, December 1996. (with I. M. Sutherland.)

Mailing Address:
College of CDM
DePaul University
243 South Wabash Avenue
Chicago, IL 60604

Phone: (312) 362-5943