2003 Publications
-
J. Edmonds,
D. Chinn, T. Brecht and X. Deng.
Non-clairvoyant multiprocessor scheduling of jobs with changing execution
characteristics.
In Journal of Scheduling, 6(3), pages 231-250,
2003.
-
J. Edmonds,
S. Datta, and
P. Dymond.
TCP is competitive against a limited adversary.
In ACM Symp. on Parallelism in Algorithms and Architectures,
pages 174-183,
2003.
-
J. Edmonds
and K. Pruhs,
Multicast pull scheduling: when fairness is fine.
In Algorithmica 36, pages 315-330,
2003.
-
Franck van Breugel,
Michael Mislove, Joel Ouaknine and James Worrell.
An intrinsic characterization of approximate probabilistic bisimilarity. In Proc. 6th International Conference on Foundations of Software Science and Computation Structures, pages 200-215,
2003.
-
Panagiota Fatourou, Faith Fich and
Eric Ruppert.
A tight time lower bound for space-optimal implementations of
multi-writer snapshots.
In Proceedings of the 35th ACM Symposium on Theory of Computing,
pages 259-268,
2003.
-
Faith Fich and
Eric Ruppert.
Hundreds of impossibility results for distributed computing.
In Distributed Computing, 16(2-3), pages 121-163,
2003.
-
J. Gryz, R. Miller,
J. Edmonds
and D. Liang.
Mining for empty rectangles in large data sets.
In Theoretical Computer Science, 296(3), pages 435-452,
2003.
-
George Tourlakis.
Lectures in Logic and Set Theory, Volume 1: Mathematical Logic.
Cambridge University Press, 2003.
-
George Tourlakis.
Lectures in Logic and Set Theory, Volume 2: Set Theory.
Cambridge University Press, 2003.
-
George Tourlakis and
Francisco Kibedi.
A Modal Extension of First Order Classical Logic, Part I.
In Bulletin of the Section of Logic, 32(4), pages 165-178, 2003.