Sciweavers

3378 search results - page 314 / 676
» A universe of binding and computation
Sort
View
FOCS
1999
IEEE
15 years 11 months ago
Limits on the Efficiency of One-Way Permutation-Based Hash Functions
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
Jeong Han Kim, Daniel R. Simon, Prasad Tetali
GD
1997
Springer
15 years 11 months ago
Orthogonal 3-D Graph Drawing
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, in particular Kn, with vertices drawn as boxes. It establishes asymptotic lower bounds for the volu...
Therese C. Biedl, Thomas C. Shermer, Sue Whiteside...
149
Voted
COCO
1990
Springer
50views Algorithms» more  COCO 1990»
15 years 11 months ago
Width-Bounded Reducibility and Binary Search over Complexity Classes
d Abstract) Eric Allender Christopher Wilson Department of Computer Science Department of Computer Rutgers University and Information Science New Brunswick, NJ 08903, USA Universit...
Eric Allender, Christopher B. Wilson
GRAPHITE
2007
ACM
15 years 10 months ago
Anna Ursyn
This review tells about the International Conference on Information Visualization that is held annually in London, England. Themes selected from the Conference Proceedings are foc...
Anna Ursyn
ICECCS
2007
IEEE
120views Hardware» more  ICECCS 2007»
15 years 10 months ago
Verifying the CICS File Control API with Z/Eves: An Experiment in the Verified Software Repository
Parts of the CICS transaction processing system were modelled formally in the 1980s in a collaborative project between IBM Hursley Park and Oxford University Computing Laboratory....
Leo Freitas, Konstantinos Mokos, Jim Woodcock