Vanity of Vanities, all is Vanity

So, if Mary was a lizard… This possibility is unfortunately not well documented in the original text.

As for David comment (which I just saw now), that is my point: The suckiness of the current systems is because we do not have an open source project to develop such a software. It is a bad idea to let some company like easychair to control our conference management software. As a first stage, SIGACT should release their software which is written in perl. The second stage would be to rewrite it completely in some more modern and portable language like cobol or assembly. The third stage would be world domination, naturally.

New comment on your post #610 “Why easychair sucks”
Author : D. Eppstein
But it sucks less than the other software for the task.

So many advantages, and yet it sucks.

I am sure that if an open source project for this would start, we would have a more usable software very quickly, in say 20 years or so .

Pictures from Dagstuhl – now you know where I was hiding.

New comment on your post #610 “Why easychair sucks”
Author : ein Freund
How do I love thee easychair? Let me count the ways…

While easychair is not yet pareto optimal across all coordinates when compared to SIGACT, for the vast majority of features easychair is better than SIGACT: conflict handling, proceeding generation, pc member submissions, watchlists, web interface, pdf handling, downloading of papers for offline evaluation, uptime, reliability, and what is best, an ever increasing number of features.

But it sucks less than the other software for the task.

Easychair is emerging as the standard software for conference management. Sadly, it sucks since:

1. It has only round number scores. There is no way to give a score 6.33 (which is not about the exact value – its about ordering the papers by quality in your own pile).

2. It does not normalize PC member scores. Thus, if a PC member gives low scores most of the time, his papers/reviews suffer, and vice versa. What does it mean when somebody says week accept? Compared to other PC member it might be equivalent to strong accept.
3. It does have an easy way to upload reviews by email, and even when it does, it does not work well.
4. It does not enable one to download the whole site once the discussion is over (but one can just use some webpage replication addon to firefox to do that).
5. It is not open source. It is about time that conference refereeing software would be open source.

On the positive side, it is much easier to use if you are the PC chair.

Bush & Clinton forever.

All of them must be from lake Wobegone because all of them are above average:

1. Manor Mendel and Assaf Naor.
Markov convexity and local rigidity of distorted metrics

2. Noga Alon, Robert Berke, Maike Buchin, Kevin Buchin, Peter Csorba,
Saswata Shannigrahi, Bettina Speckmann and Philipp Zumstein.
Polychromatic Colorings of Plane Graphs

3. Jinhee Chun, Matias Korman, Martin N=F6llenburg and Takeshi Tokuyama.
Consistent Digital Rays

4. Eitan Yaffe and Dan Halperin.
Approximating the Pathway Axis and the Persistence Diagram of a Collection of Balls in 3-Space

5. Naoki Katoh and Shin-ichi Tanigawa.
Fast Enumeration Algorithms for Non-crossing Geometric Graphs

6. Ken Been, Martin N?llenburg, Sheung-Hung Poon and Alexander Wolff.
Optimizing Active Ranges for Consistent Dynamic Map Labeling

7. Hans Raj Tiwary and Khaled Elbassioni.
On the Complexity of Checking Self-duality of Polytopes and its Relations to Vertex Enumeration and Graph Isomorphism

8. Victor Chepoi, Feodor Dragan, Bertrand Estellon, Michel Habib and
Yann Vaxes.
Diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs

9. Esther Arkin, Joseph Mitchell and Valentin Polishchuk. Maximum Thick
Paths in Static and Dynamic Environments

10. Julien Demouth, Olivier Devillers, Marc Glisse and Xavier Goaoc.
Helly-type theorems for approximate covering

11. Sarit Buzaglo, Ron Holzman and Rom Pinchasi.
On $k$-intersecting curves and related problems

12. Mohammad Ali Abam, Mark de Berg and Joachim Gudmundsson.
A Simple and Efficient Kinetic Spanner

13. Frederic Chazal and Steve Oudot.
Towards Persistence-Based Reconstruction in Euclidean Spaces

14. Ken Clarkson.
Tighter Bounds for Random Projections of Manifolds

15. Krzysztof Onak and Anastasios Sidiropoulos.
Circular Partitions with Applications to Visualization and Embeddings

16. Bernard Chazelle and Wolfgang Mulzer.
Markov Incremental Constructions

17. Kenneth L. Clarkson and C. Seshadhri.
Self-Improving Algorithms for Delaunay Triangulations

18. Frederic Cazals, Aditya Parameswaran and Sylvain Pion.
Robust construction of the three-dimensional flow complex

19. Herbert Edelsbrunner, John Harer and Amit Patel.
Reeb Spaces of Piecewise Linear Mappings

20. Evangelia Pyrga and Saurabh Ray.
New Existence Proofs for $\epsilon$-Nets

21. Lars Arge, Gerth Stolting Brodal and S. Srinivasa Rao.
External memory planar point location with logarithmic updates

22. Eric Berberich, Michael Kerber and Michael Sagraloff.
Exact Geometric-Topological Analysis of Algebraic Surfaces

23. Misha Belkin, Jian Sun and Yusu Wang.
Discrete Laplace Operator on Meshed Surfaces

24. Olivier Devillers, Marc Glisse and Sylvain Lazard.
Predicates for 3D visibility

25. Luca Castelli Aleardi, Eric Fusy and Thomas Lewiner.
Schnyder woods for higher genus triangulated surfaces

26. Erin Chambers, Jeff Erickson and Pratik Worah.
Testing Contractibility in Planar Rips Complexes

27. Rado Fulek, Andreas Holmsen and Janos Pach.
Intersecting convex sets by rays

28. Noga Alon, Dan Halperin, Oren Nechushtan and Micha Sharir.
The Complexity of the Outer Face in Arrangements of Random Segments

29. Maarten Loffler and Jack Snoeyink.
Delaunay triangulations of imprecise points in linear time after preprocessing

30. Erin Chambers, Eric Colin de Verdiere, Jeff Erickson, Sylvain Lazard,
Francis Lazarus and Shripad Thite.
Walking Your Dog in the Woods in Polynomial Time

31. Jean-Daniel Boissonnat, Camille Wormser and Mariette Yvinec.
Locally Uniform Anisotropic Meshing

32. Adrian Dumitrescu, Micha Sharir and Csaba Toth.
Extremal problems on triangle areas in two and three dimensions

33. Timothy M. Chan.
A (Slightly) Faster Algorithm for Klee’s Measure Problem

34. Timothy M. Chan.
Dynamic Coresets

35. Timothy M. Chan.
On Levels in Arrangements of Curves, III: Further Improvements

36. Minkyoung Cho and David Mount.
Embedding and Similarity Search for Point Sets under Translation

37. Jacob Fox and Janos Pach.

Coloring K_k-free intersection graphs of geometric objects in the plane

38. Timothy G. Abbott, Zachary Abel, David Charlton, Erik D. Demaine, Martin
L. Demaine and Scott D. Kominers.
Hinged Dissections Exist

39. Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar and David R. Wood.
Improved upper bounds on the crossing number

40. Pankaj Agarwal, Lars Arge, Thomas Mlhave and Bardia Sadri.
I/O Efficient Algorithms for Computing Contour Lines on a Terrain

41. Pankaj Agarwal, Bardia Sadri and Hai Yu.
Untangling triangulations through local explorations

42. Ileana Streinu and Louis Theran.
Combinatorial Genericity and Minimal Rigidity