New Jersey Institute of Technology - Dr. Artur Czumaj

New Jersey Institute of Technology Department of Computer Science

Artur Czumaj

Artur

Department of Computer Science
New Jersey Institute of Technology
E-Mail: aczumaj (at) acm.org

Current contact address:
          Department of Computer Science
          University of Warwick
          Coventry CV4 7AL, United Kingdom
          Phone: +44 +24 7657 3796
          Fax:      +44 +24 7657 3024
          E-Mail: czumaj (at) dcs.warwick.ac.uk
          http://www.dcs.warwick.ac.uk/~czumaj/

Research areas:
Theoretical Computer Science, especially the analysis and design of algorithms and data structures.
The main fields of research are:: Randomized algorithms and their probabilistic analysis; Graph theory, graph algorithms and computational geometry; Algorithmic aspects of game theory and economics; String/pattern matching (applications and efficient implementations) and some aspect of computational biology; Parallel and distributed algorithms and communication networks; Complexity theory; Combinatorics and discrete mathematics

Publications

Draft of a new paper »Finding a heaviest triangle is not harder than matrix multiplication« © with Andrzej Lingas, Manuscript, July 2006.
New survey on sublinear-time algorithms © (coauthored by Christian Sohler) that just appeared in Bulletin of the EATCS, 89: 23 - 47, June 2006.
Draft of a paper »Faster algorithms for finding lowest common ancestors in directed acyclic graphs«, coauthored by Miroslaw Kowaluk, and Andrzej Lingas, submitted to special issue of TCS in November 2005. (Aug 11, 2006: An error in the proof of Theorem 13 has been fixed)
Materials from the Dagstuhl seminar on Sublinear Algorithms that I (together with S. Muthu Muthukrishnan, Ronitt Rubinfeld, and Christian Sohler) organized in July 2005. (A picture from the seminar.)

Full version of the paper »Tight Bounds for Worst-Case Equilibria« (extended version of SODA'2002 paper, co-authored by B. Vöcking); this paper has been submitted to Journal of Algorithms in 2002 and accepted in 2003 ... but it's still waiting for publication.

Drafts of full versions of two papers on property testing that have been published in conference proceedings long time ago:
- Part I of ESA 2000 paper »Testing Convex Position«
- Part II of ESA 2000 paper »Testing Euclidean Minimum Spanning Trees in the Plane«

Some pictures from various conferences:
- Dagstuhl 2005 (workshop "Design and Analysis of Randomized and Approximation Algorithms," May 2005) (workshop web page)
- Dagstuhl 2005 (workshop "Computing and Markets," January 2005) (workshop web page)
- Bertinoro 2004 ("AGATE 2004, 1st Bertinoro Workshop on Algorithmic GAme ThEory," July 2004) - the fortress and the view
- Oberwolfach 2004 (workshop "Approximation Algorithms for NP-Hard Problems," June 2004)
- Braunwald (near Zurich - Andrzej R. is next to me and Alps are in the background) ... and another (group) picture
- Dagstuhl 2003 (workshop "Algorithmic Game Theory and the Internet," June 2003)
- Dagstuhl 2003 (another view)
- Oberwolfach 2000 (workshop "Efficient Algorithms," August 2000)
- RS&A conference in Poznan, August 1999 (bonfire)

Seminar in Laboratory of Algorithms (Department of Computer Science, New Jersey Institute of Technology)

My (old and out-dated) Web-page from Paderborn, in Germany, where I spent over 6 years (1993-1999)

Faculty of Mathematics, Informatics and Mechanics at the Warsaw University, place where I did my undergraduate study.
- This has been a great place to study ... see a note about how the Computer Science students won the 2003 World Championship (The 27th Annual ACM Internation Collegiate Programming Competition (World Finals))


Plan your trip Local Radar Detailed Forecast