---

Current Courses:

  CSCI 2490: C++ Programming

  CSCI 3202: Computer Organization and Architecture

  CSCI 3330: Comparative Languages

 

 

Office Hours:

  MW: 1:30 – 3:00 pm

  TR:   1:30 – 2:30 pm

  Other times by appointment

---

Research Areas

	General Processing on Graphics Hardware Projects focus on using programmable graphics cards to perform general (non-graphics) computing.  Modern graphics hardware is effectively a high-performance parallel processing platform.  It is still specialized for rendering tasks, so algorithms have to be designed with architecture restrictions and parallelization in mind.  I have implemented the Warshall-Floyd all-pairs shortest paths algorithm for graphs and the triangle-inequality distance-bound smoothing algorithm for use in prediction of protein 3D structure.  More information...
	Interactive Computer Graphics My interest is in interactive computer graphics techniques.  Projects so far include visibility-based walk-through framework, fast color-conformation, depth-dependent blending of levels of detail, parallel tessellation of implicit surfaces.   More information...
	Mixed Reality Mixed Reality presents to the user a combination of the real surroundings and computer generated objects.  I was a researcher and graphics development lead on MR MOUT and Time Portal projects at the Media Convergence Laboratory, where we used video see-through head-mounted displays, 6DOF tracking, interactive surround audio, and special effects devices.  Research for Time Portal was supported by a grant from Canon, Inc., MR MOUT was sponsored by US Army RDECOM.  Systems were displayed at Siggraph 2003, I/ITSEC 2003, and other venues.   More information...
	Graph Theory and Algorithms I am interested in graph-theoretic algorithms and their application.  My research so far includes encoding algorithms for labeled trees, expected diameter/radius of random labeled trees, computing constrained minimum spanning trees, graceful labeling, and one-factorization of uniform hypergraphs.  I am also investigating the properties of graphs defined by molecules' inter-atomic distance bounds, obtained from Nuclear Magnetic Resonance (NMR) experiments.   More information...
	Parallel and High Performance Computing

---

 

Refereed Publications:

Other Publications, Presentations, and Technical Reports:

• P. Micikevicius.  Parallel Computing on Graphics Hardware.  Colby College Computer Science colloquium, 2005. (PPT)

• N. Deo, P. Micikevicius.  One-Factorization-Based Collective Communication on a Cluster of Workstations.  34^th Southeastern International Conference on Combinatorics, Graph Theory, and Computing.  Boca Raton, Florida, March 3-7, 2003.

• C. Stapleton, C. Hughes, M. Moshell, P. Micikevicius, M. Altman.  Applying Mixed Reality to Entertainment.  IEEE Computer, vol. 35(12), pp. 122-124, 2002. (PDF)

• C. E. Hughes, C. B. Stapleton, J. M. Moshell, P. Micikevicius, P. Garrity, P. Dumanoir.  Challenges and Opportunities Simulating Future Combat Systems via Mixed Reality.  23^rd Army Science Conference (ASC 2002), Orlando, FL, December 2-5, 2002.

• P. Micikevicius, C. Hughes, M. Moshell.  Interactive Forest Walk-through.  Computer Science Technical Report CS-TR-02, 2002.  (PDF)

• N. Deo, P. Micikevicius.  Parallel Algorithms for Computing Prüfer-Like Codes of Labeled Trees.  Computer Science Technical Report CS-TR-01-06, 2001. (PDF)

• N. Deo, P. Micikevicius.  Prüfer-Like Tree Codes: Their Properties and Parallel Computation.  Invited talk, FH80 Conference, Illinois Institute of Technology, Illinois, November 2, 2001.

• F. Suraweera, N. Deo, P. Micikevicius.  Prüfer-like Codes from Graceful Trees.  The Fifteenth Mid-West Conference on Combinatorics, Cryptography and Computing, University of Las Vegas, Nevada, October 18-20, 2001.

• P. Micikevicius.  Coarse-grained Parallel Tessellation of Implicit Surfaces.  Computer Science Technical Report CS-TR-02, 2001.