19. SODA 2008:
San Francisco,
California,
USA
Shang-Hua Teng (Ed.):
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008.
SIAM 2008 BibTeX
- Nir Ailon, Edo Liberty:
Fast dimension reduction using Rademacher series on dual BCH codes.
1-9
Electronic Edition (ACM DL) BibTeX
- Ping Li:
Estimators and tail bounds for dimension reduction in lα (0 < α ≤ 2) using stable random projections.
10-19
Electronic Edition (ACM DL) BibTeX
- Mark A. Iwen:
A deterministic sub-linear time sparse fourier algorithm via non-adaptive compressed sensing methods.
20-29
Electronic Edition (ACM DL) BibTeX
- Piotr Indyk:
Explicit constructions for compressed sensing of sparse signals.
30-33
Electronic Edition (ACM DL) BibTeX
- Aaron Bernstein, David R. Karger:
Improved distance sensitivity oracles via random sampling.
34-43
Electronic Edition (ACM DL) BibTeX
- S. Thomas McCormick, Satoru Fujishige:
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization.
44-53
Electronic Edition (ACM DL) BibTeX
- Jin-yi Cai, Pinyan Lu:
Holographic algorithms with unsymmetric signatures.
54-63
Electronic Edition (ACM DL) BibTeX
- Guy Kindler, Assaf Naor, Gideon Schechtman:
The UGC hardness threshold of the ℓp Grothendieck problem.
64-73
Electronic Edition (ACM DL) BibTeX
- Ilias Diakonikolas, Mihalis Yannakakis:
Succinct approximate convex pareto curves.
74-83
Electronic Edition (ACM DL) BibTeX
- Daniele Micciancio:
Efficient reductions among lattice problems.
84-93
Electronic Edition (ACM DL) BibTeX
- Xiaomin Chen, János Pach, Mario Szegedy, Gábor Tardos:
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles.
94-101
Electronic Edition (ACM DL) BibTeX
- Raghavan Dhandapani:
Greedy drawings of triangulations.
102-111
Electronic Edition (ACM DL) BibTeX
- Siu-Wing Cheng, Tamal K. Dey:
Maintaining deforming surface meshes.
112-121
Electronic Edition (ACM DL) BibTeX
- Arno Eigenwillig, Michael Kerber:
Exact and efficient 2D-arrangements of arbitrary algebraic curves.
122-131
Electronic Edition (ACM DL) BibTeX
- Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger:
On properties of random dissections and triangulations.
132-141
Electronic Edition (ACM DL) BibTeX
- Bonnie Berger, Rohit Singh, Jinbo Xu:
Graph algorithms for biological systems analysis.
142-151
Electronic Edition (ACM DL) BibTeX
- Julián Mestre:
Adaptive local ratio.
152-160
Electronic Edition (ACM DL) BibTeX
- Ulrich Faigle, Britta Peis:
Two-phase greedy algorithms for some classes of combinatorial linear programs.
161-166
Electronic Edition (ACM DL) BibTeX
- Ding-Zhu Du, Ronald L. Graham, Panos M. Pardalos, Peng-Jun Wan, Weili Wu, Wenbo Zhao:
Analysis of greedy approximations with nonsubmodular potential functions.
167-175
Electronic Edition (ACM DL) BibTeX
- Claire Mathieu, Warren Schudy:
Yet another algorithm for dense max cut: go greedy.
176-182
Electronic Edition (ACM DL) BibTeX
- Ignaz Rutter, Alexander Wolff:
Computing large matchings fast.
183-192
Electronic Edition (ACM DL) BibTeX
- Penny E. Haxell, Gordon T. Wilfong:
A fractional model of the border gateway protocol (BGP).
193-199
Electronic Edition (ACM DL) BibTeX
- Prahladh Harsha, Thomas P. Hayes, Hariharan Narayanan, Harald Räcke, Jaikumar Radhakrishnan:
Minimizing average latency in oblivious routing.
200-207
Electronic Edition (ACM DL) BibTeX
- Gianluca De Marco:
Distributed broadcast in unknown radio networks.
208-217
Electronic Edition (ACM DL) BibTeX
- Robert Elsässer, Thomas Sauerwald:
The power of memory in randomized broadcasting.
218-227
Electronic Edition (ACM DL) BibTeX
- Amos Fiat, Yishay Mansour, Uri Nadav:
Competitive queue management for latency sensitive packets.
228-237
Electronic Edition (ACM DL) BibTeX
- Elchanan Mossel, Allan Sly:
Rapid mixing of Gibbs sampling on graphs that are sparse on average.
238-247
Electronic Edition (ACM DL) BibTeX
- László Babai, Nikolay Nikolov, László Pyber:
Product growth and mixing in finite groups.
248-257
Electronic Edition (ACM DL) BibTeX
- Venkatesan Guruswami, Atri Rudra:
Concatenated codes can achieve list-decoding capacity.
258-267
Electronic Edition (ACM DL) BibTeX
- Mark Braverman, Elchanan Mossel:
Noisy sorting without resampling.
268-276
Electronic Edition (ACM DL) BibTeX
- Michael Zuckerman, Ariel D. Procaccia, Jeffrey S. Rosenschein:
Algorithms for the coalitional manipulation problem.
277-286
Electronic Edition (ACM DL) BibTeX
- Uriel Feige:
On allocations that maximize fairness.
287-293
Electronic Edition (ACM DL) BibTeX
- Susanne Albers:
On the value of coordination in network design.
294-303
Electronic Edition (ACM DL) BibTeX
- Matthew Cary, Abraham D. Flaxman, Jason D. Hartline, Anna R. Karlin:
Auctions for structured procurement.
304-313
Electronic Edition (ACM DL) BibTeX
- Baruch Awerbuch, Yossi Azar, Rohit Khandekar:
Fast load balancing via bounded best response.
314-322
Electronic Edition (ACM DL) BibTeX
- Yossi Azar, Kamal Jain, Vahab S. Mirrokni:
(Almost) optimal coordination mechanisms for unrelated machine scheduling.
323-332
Electronic Edition (ACM DL) BibTeX
- T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar:
Ultra-low-dimensional embeddings for doubling metrics.
333-342
Electronic Edition (ACM DL) BibTeX
- Alexandr Andoni, Piotr Indyk, Robert Krauthgamer:
Earth mover distance over high-dimensional spaces.
343-352
Electronic Edition (ACM DL) BibTeX
- Venkatesan Guruswami, James R. Lee, Alexander A. Razborov:
Almost Euclidean subspaces of lN1 via expander codes.
353-362
Electronic Edition (ACM DL) BibTeX
- Ittai Abraham, Yair Bartal, Ofer Neiman:
Embedding metric spaces in their intrinsic dimension.
363-372
Electronic Edition (ACM DL) BibTeX
- Noga Alon, Michael R. Capalbo:
Optimal universal graphs with deterministic embedding.
373-378
Electronic Edition (ACM DL) BibTeX
- Ilan Gronau, Shlomo Moran, Sagi Snir:
Fast and reliable reconstruction of phylogenetic trees with very short edges.
379-388
Electronic Edition (ACM DL) BibTeX
- Thomas Holenstein, Michael Mitzenmacher, Rina Panigrahy, Udi Wieder:
Trace reconstruction with constant deletion probability and related results.
389-398
Electronic Edition (ACM DL) BibTeX
- Krishnamurthy Viswanathan, Ram Swaminathan:
Improved string reconstruction over insertion-deletion channels.
399-408
Electronic Edition (ACM DL) BibTeX
- Ho-Lin Chen, Ashish Goel, Chris Luhrs:
Dimension augmentation and combinatorial criteria for efficient error-resistant DNA self-assembly.
409-418
Electronic Edition (ACM DL) BibTeX
- Ely Porat, Klim Efremenko:
Approximating general metric distances between a pattern and a text.
419-427
Electronic Edition (ACM DL) BibTeX
- Yuval Emek, David Peleg, Liam Roditty:
A near-linear time algorithm for computing replacement paths in planar directed graphs.
428-435
Electronic Edition (ACM DL) BibTeX
- Ran Duan, Seth Pettie:
Bounded-leg distance and reachability oracles.
436-445
Electronic Edition (ACM DL) BibTeX
- Ken-ichi Kawarabayashi, Bruce A. Reed:
A nearly linear time algorithm for the half integral disjoint paths packing.
446-454
Electronic Edition (ACM DL) BibTeX
- Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi:
Fast edge splitting and Edmonds' arborescence construction for unweighted graphs.
455-464
Electronic Edition (ACM DL) BibTeX
- Virginia Vassilevska:
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule.
465-472
Electronic Edition (ACM DL) BibTeX
- Jessica Chang, Thomas Erlebach, Renars Gailis, Samir Khuller:
Broadcast scheduling: algorithms and complexity.
473-482
Electronic Edition (ACM DL) BibTeX
- Tomás Ebenlendr, Marek Krcal, Jiri Sgall:
Graph balancing: a special case of scheduling unrelated parallel machines.
483-490
Electronic Edition (ACM DL) BibTeX
- Julien Robert, Nicolas Schabanel:
Non-clairvoyant scheduling with precedence constraints.
491-500
Electronic Edition (ACM DL) BibTeX
- Guy E. Blelloch, Rezaul Alam Chowdhury, Phillip B. Gibbons, Vijaya Ramachandran, Shimin Chen, Michael Kozuch:
Provably good multicore cache performance for divide-and-conquer algorithms.
501-510
Electronic Edition (ACM DL) BibTeX
- Brighten Godfrey:
Balls and bins with structure: balanced allocations on hypergraphs.
511-517
Electronic Edition (ACM DL) BibTeX
- Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
Arc-disjoint in-trees in directed graphs.
518-526
Electronic Edition (ACM DL) BibTeX
- Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar:
Finding one tight cycle.
527-531
Electronic Edition (ACM DL) BibTeX
- Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev:
Set connectivity problems in undirected graphs and the directed Steiner network problem.
532-541
Electronic Edition (ACM DL) BibTeX
- Nicholas J. A. Harvey:
Matroid intersection, pointer chasing, and Young's seminormal representation of Sn.
542-549
Electronic Edition (ACM DL) BibTeX
- Harold N. Gabow, Suzanne Gallagher:
Iterated rounding algorithms for the smallest k-edge connected spanning subgraph.
550-559
Electronic Edition (ACM DL) BibTeX
- Persi Diaconis:
Shuffling cards, adding numbers, and symmetric functions.
560
Electronic Edition (ACM DL) BibTeX
- Timothy M. Chan:
On the bichromatic k-set problem.
561-570
Electronic Edition (ACM DL) BibTeX
- Jie Gao, Leonidas J. Guibas, Steve Oudot, Yue Wang:
Geodesic Delaunay triangulation and witness complex in the plane.
571-580
Electronic Edition (ACM DL) BibTeX
- Adrian Dumitrescu, Csaba D. Tóth:
Minimum weight convex Steiner partitions.
581-590
Electronic Edition (ACM DL) BibTeX
- Lee-Ad Gottlieb, Liam Roditty:
Improved algorithms for fully dynamic geometric spanners and geometric routing.
591-600
Electronic Edition (ACM DL) BibTeX
- Josep Díaz, Dieter Mitsche, Xavier Pérez-Giménez:
On the connectivity of dynamic random geometric graphs.
601-610
Electronic Edition (ACM DL) BibTeX
- Aravind Srinivasan:
Improved algorithmic versions of the Lovász Local Lemma.
611-620
Electronic Edition (ACM DL) BibTeX
- Frédéric Havet, Bruce A. Reed, Jean-Sébastien Sereni:
L(2, 1)-labelling of graphs.
621-630
Electronic Edition (ACM DL) BibTeX
- Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos:
Catalan structures and dynamic programming in H-minor-free graphs.
631-640
Electronic Edition (ACM DL) BibTeX
- Isolde Adler, Martin Grohe, Stephan Kreutzer:
Computing excluded minors.
641-650
Electronic Edition (ACM DL) BibTeX
- Reid Andersen, Kevin J. Lang:
An algorithm for improving graph partitions.
651-660
Electronic Edition (ACM DL) BibTeX
- Chandra Chekuri, Nitish Korula, Martin Pál:
Improved algorithms for orienteering and related problems.
661-670
Electronic Edition (ACM DL) BibTeX
- Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy:
Approximation algorithms for labeling hierarchical taxonomies.
671-680
Electronic Edition (ACM DL) BibTeX
- Mark Huber, Jenny Law:
Fast approximation of the permanent for very dense problems.
681-689
Electronic Edition (ACM DL) BibTeX
- T.-H. Hubert Chan, Anupam Gupta:
Approximating TSP on metrics with bounded global growth.
690-699
Electronic Edition (ACM DL) BibTeX
- Nir Halman, Diego Klabjan, Chung-Lun Li, James B. Orlin, David Simchi-Levi:
Fully polynomial time approximation schemes for stochastic dynamic programs.
700-709
Electronic Edition (ACM DL) BibTeX
- Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina:
On distributing symmetric streaming computations.
710-719
Electronic Edition (ACM DL) BibTeX
- Amit Chakrabarti, T. S. Jayram, Mihai Patrascu:
Tight lower bounds for selection in randomly ordered streams.
720-729
Electronic Edition (ACM DL) BibTeX
- Funda Ergün, Hossein Jowhari:
On distance to monotonicity and longest increasing subsequence of a data stream.
730-736
Electronic Edition (ACM DL) BibTeX
- Piotr Indyk, Andrew McGregor:
Declaring independence via the sketching of sketches.
737-745
Electronic Edition (ACM DL) BibTeX
- Michael Mitzenmacher, Salil P. Vadhan:
Why simple hash functions work: exploiting the entropy in a data stream.
746-755
Electronic Edition (ACM DL) BibTeX
- Mike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick:
Maximum overhang.
756-765
Electronic Edition (ACM DL) BibTeX
- Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer:
Deterministic random walks on regular trees.
766-772
Electronic Edition (ACM DL) BibTeX
- Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald:
Quasirandom rumor spreading.
773-781
Electronic Edition (ACM DL) BibTeX
- Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski:
Universality of random graphs.
782-788
Electronic Edition (ACM DL) BibTeX
- Asaf Shapira, Raphael Yuster:
The effect of induced subgraphs on quasi-randomness.
789-798
Electronic Edition (ACM DL) BibTeX
- Marcel R. Ackermann, Johannes Blömer, Christian Sohler:
Clustering for metric and non-metric distance measures.
799-808
Electronic Edition (ACM DL) BibTeX
- Robert Krauthgamer, Tim Roughgarden:
Metric clustering via consistent labeling.
809-818
Electronic Edition (ACM DL) BibTeX
- Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan:
On clustering to minimize the sum of radii.
819-825
Electronic Edition (ACM DL) BibTeX
- Ke Chen:
A constant factor approximation algorithm for k-median clustering with outliers.
826-835
Electronic Edition (ACM DL) BibTeX
- Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote:
Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension.
836-843
Electronic Edition (ACM DL) BibTeX
- Alex Fabrikant, Christos H. Papadimitriou:
The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond.
844-853
Electronic Edition (ACM DL) BibTeX
- Ho-Lin Chen, Tim Roughgarden, Gregory Valiant:
Designing networks with good equilibria.
854-863
Electronic Edition (ACM DL) BibTeX
- Sushil Bikhchandani, Sven de Vries, James Schummer, Rakesh V. Vohra:
Ascending auctions for integral (poly)matroids with concave nondecreasing separable values.
864-873
Electronic Edition (ACM DL) BibTeX
- Peter Bro Miltersen, Troels Bjerre Sørensen:
Fast algorithms for finding proper strategies in game trees.
874-883
Electronic Edition (ACM DL) BibTeX
- Ofer Dekel, Felix A. Fischer, Ariel D. Procaccia:
Incentive compatible regression learning.
884-893
Electronic Edition (ACM DL) BibTeX
- Guy E. Blelloch:
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting.
894-903
Electronic Edition (ACM DL) BibTeX
- Timothy M. Chan, Eric Y. Chen:
In-place 2-d nearest neighbor search.
904-911
Electronic Edition (ACM DL) BibTeX
- Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin:
Distribution-sensitive point location in convex subdivisions.
912-921
Electronic Edition (ACM DL) BibTeX
- Kenneth L. Clarkson:
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm.
922-931
Electronic Edition (ACM DL) BibTeX
- Anirban Dasgupta, Petros Drineas, Boulos Harb, Ravi Kumar, Michael W. Mahoney:
Sampling algorithms and coresets for ℓp regression.
932-941
Electronic Edition (ACM DL) BibTeX
- Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr Sankowski:
Stochastic analyses for online combinatorial optimization problems.
942-951
Electronic Edition (ACM DL) BibTeX
- Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko:
Online make-to-order joint replenishment model: primal dual competitive algorithms.
952-961
Electronic Edition (ACM DL) BibTeX
- Michael E. Saks, C. Seshadhri:
Parallel monotonicity reconstruction.
962-971
Electronic Edition (ACM DL) BibTeX
- Ioannis Caragiannis:
Better bounds for online load balancing on unrelated machines.
972-981
Electronic Edition (ACM DL) BibTeX
- Gagan Goel, Aranyak Mehta:
Online budgeted matching in random input models with applications to Adwords.
982-991
Electronic Edition (ACM DL) BibTeX
- Andrei Z. Broder:
Computational advertising.
992
Electronic Edition (ACM DL) BibTeX
- Henry Lin, Christos Amanatidis, Martha Sideri, Richard M. Karp, Christos H. Papadimitriou:
Linked decompositions of networks and the power of choice in Polya urns.
993-1002
Electronic Edition (ACM DL) BibTeX
- Reid Andersen:
A local algorithm for finding dense subgraphs.
1003-1009
Electronic Edition (ACM DL) BibTeX
- Prasad Chebolu, Páll Melsted:
PageRank and the random surfer model.
1010-1018
Electronic Edition (ACM DL) BibTeX
- Arpita Ghosh, Mohammad Mahdian:
Charity auctions on social networks.
1019-1028
Electronic Edition (ACM DL) BibTeX
- Ning Chen:
On the approximability of influence in social networks.
1029-1037
Electronic Edition (ACM DL) BibTeX
- Bruce M. Kapron, David Kempe, Valerie King, Jared Saia, Vishal Sanwalani:
Fast asynchronous byzantine agreement and leader election with full information.
1038-1047
Electronic Edition (ACM DL) BibTeX
- Bhavani Shankar, Prasant Gopal, Kannan Srinathan, C. Pandu Rangan:
Unconditionally reliable message transmission in directed networks.
1048-1055
Electronic Edition (ACM DL) BibTeX
- Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Jaikumar Radhakrishnan:
A tight lower bound for parity in noisy communication networks.
1056-1065
Electronic Edition (ACM DL) BibTeX
- James Aspnes, Muli Safra, Yitong Yin:
Ranged hash functions and the price of churn.
1066-1075
Electronic Edition (ACM DL) BibTeX
- Graham Cormode, S. Muthukrishnan, Ke Yi:
Algorithms for distributed functional monitoring.
1076-1085
Electronic Edition (ACM DL) BibTeX
- Amihood Amir, Igor Nor:
Real-time indexing over fixed finite alphabets.
1086-1095
Electronic Edition (ACM DL) BibTeX
- Shay Mozes, Krzysztof Onak, Oren Weimann:
Finding an optimal tree searching strategy in linear time.
1096-1105
Electronic Edition (ACM DL) BibTeX
- Prosenjit Bose, Karim Douïeb, Stefan Langerman:
Dynamic optimality for skip lists and B-trees.
1106-1114
Electronic Edition (ACM DL) BibTeX
- Seth Pettie:
Splay trees, Davenport-Schinzel sequences, and the deque conjecture.
1115-1124
Electronic Edition (ACM DL) BibTeX
- Surender Baswana, Soumojit Sarkar:
Fully dynamic algorithm for graph spanners with poly-logarithmic update time.
1125-1134
Electronic Edition (ACM DL) BibTeX
- Mario Mense, Christian Scheideler:
SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems.
1135-1144
Electronic Edition (ACM DL) BibTeX
- Ashish Goel, Hamid Nazerzadeh:
Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities.
1145-1153
Electronic Edition (ACM DL) BibTeX
- Zoya Svitkina:
Lower-bounded facility location.
1154-1163
Electronic Edition (ACM DL) BibTeX
- Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Viswanath Nagarajan:
A plant location guide for the unsure.
1164-1173
Electronic Edition (ACM DL) BibTeX
- Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Rothvoß, Guido Schäfer:
Approximating connected facility location problems via random facility sampling and core detouring.
1174-1183
Electronic Edition (ACM DL) BibTeX
- Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii:
The hiring problem and Lake Wobegon strategies.
1184-1193
Electronic Edition (ACM DL) BibTeX
- Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky:
Weak ε-nets and interval chains.
1194-1203
Electronic Edition (ACM DL) BibTeX
- Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi:
Robust cost colorings.
1204-1212
Electronic Edition (ACM DL) BibTeX
- Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron:
Comparing the strength of query types in property testing: the case of testing k-colorability.
1213-1222
Electronic Edition (ACM DL) BibTeX
- Nayantara Bhatnagar, Sam Greenberg, Dana Randall:
Sampling stable marriages: why spouse-swapping won't work.
1223-1232
Electronic Edition (ACM DL) BibTeX
- Adrian Dumitrescu, Csaba D. Tóth:
On stars and Steiner stars.
1233-1240
Electronic Edition (ACM DL) BibTeX
- Boris Aronov, Mark de Berg, Chris Gray, Elena Mumford:
Cutting cycles of rods in space: hardness and approximation.
1241-1248
Electronic Edition (ACM DL) BibTeX
- Olivier Devillers, Jeff Erickson, Xavier Goaoc:
Empty-ellipse graphs.
1249-1257
Electronic Edition (ACM DL) BibTeX
- David Eppstein:
Recognizing partial cubes in quadratic time.
1258-1266
Electronic Edition (ACM DL) BibTeX
- Thomas Erlebach, Erik Jan van Leeuwen:
Approximating geometric coverage problems.
1267-1276
Electronic Edition (ACM DL) BibTeX
Copyright © Sat May 16 23:41:53 2009
by Michael Ley (ley@uni-trier.de)
