DIMACS Challenge Participants

Here is a list of current Challenge participants and the projects they are working on.

• Arne Andersson Lund University, Sweden Arne.Andersson@dna.lth.se . Look at hashing schemes for dictionaries.
• Andrew Goldberg, NEC avg@research.nj.nec.com . Monotone priority queues. For those interested in priority queue applications, Andrew's SPLIB programs for shortest path algorithms are available by sending mail to ftp-request@theory.stanford.edu and putting "send splib.tar" on the subject line.
• Arne Lokketangen, Molde College, Norway Arne.Lokketangen@hiMolde.no . Priority queues to support candidate list management in local neighborhood search heuristics.
• Michael Lykke and Jyrki Katajainen, Diku, Denmark vrtra@diku.dk Experiments using dictionairies with multiplicative hash functions, with chaining and hybrid methods.
• Boris Mirkin, DIMACS Long-Term Visitor mirkin@dimacs.rutgers.edu Multidimensional Point Sets to support research on mathematical clustering.
• Craig Silverstein, Stanford csilver@slinky.stanford.edu Implement and test the two-level hash scheme proposed by Fredman, Komlos, and Szemerdi, modified by Tarjan et al. Find modifications that are fast in practice, look at time/space tradeoffs. Craig has constructed a collection of input files containing Dictionary operation traces with library call numbers for keys.
• Darko Stefanovic, Univ. Massachusetts stefanov@cs.umass.edu Extensions of dictionaries for object management in OOP languages. He provides several test input files containing traces of Dictionary operations for object management applications.
• Konsstantin Shvachko, et al., Progam Systems Institute, Pereslavl-Zelessky, Russia shv@infos.botik.ru A new type of balanced tree, to support dynamic dictionaries with variable key lengths. They have a web page containing papers and related information about the tree (in Russian, with an English abstract).
• Steve Tate (and student), University of North Texas srt@cs.unt.edu Implement and evaluate distributed shared priority queues.
• Xaiodong Zhou, Rutgers University xdzhou@paul.rutgers.edu Implement multidimensional point sets.
• Vijaya Ramachandran (and students), University of Texas at Austin vlr@cs.utexas.edu Data structures for incremental graph biconnectivity.
• Roberto Battiti, Universita' di Trento, Italy battiti@science.unitn.it Partially persistent red-black treas for hashing to support local search heuristics.
• Sabine Hanke, Universitaet Freiburg, Germany hanke@informatick.uni-frieburg.de Implement and evaluate a new scheme for relaxed balanced Z-stratified trees.
• Mikkel Thorup and Arne Andersson, University of Copenhagen, Denmark mthorup@diku.dk Implementing amortized monotone priority queues that are simple and fast in practice.
• Martin Dietzfelbinger and Martin Huene huene@noether.informatik.uni-dortmund.de A persistent dictionary implementation based on dynamic perfect hashing. Evaluate hash functions with fast evaluation time.