Conference paper
Placement of multimedia blocks on zoned disks
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
Natural graphical representations for Boolean functions, so-called free Boolean graphs, arise in the study of Ianov schemes. Fortune, Hopcroft and Schmidt have asked if an algorithm can decide covalence of these free Boolean graphs in poly- time. We show that random polynomial time will suffice.
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
B.K. Boguraev, Mary S. Neff
HICSS 2000