From post

Efficient Algorithms for the Maximum Empty Rectangle Problem in Shared Memory and Other Architectures.

, и . ICPP (3), стр. 344-345. Pennsylvania State University Press, (1990)0-271-00728-1.

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

No persons found for author name Krithivasan, Kamala
add a person with the name Krithivasan, Kamala
 

Другие публикации лиц с тем же именем

Variations of the matrix models. Intern. J. Computer Math., (1977)Picture Languages with Array Rewriting Rules, , и . Information and Control, 22 (5): 447-470 (июня 1973)On the Trade-Off Between Ambiguity and Measures in Internal Contextual Grammars., , и . DCFS, стр. 216-223. University of Prince Edward Island, (2008)Hexagonal Contextual Array P Systems., , , и . Formal Models, Languages and Applications, том 66 из Series in Machine Perception and Artificial Intelligence, стр. 79-96. World Scientific, (2007)Intersection removal for simple polygons., и . Int. J. Comput. Math., 64 (3-4): 211-223 (1997)Distance realization problem in Network Tomography: A heuristic approach., и . IEEE ANTS, стр. 1-6. IEEE, (2013)Universality Results for Some Variants of P Systems., и . WMP, том 2235 из Lecture Notes in Computer Science, стр. 237-254. Springer, (2000)Treating Terminals as Function Values of Time.. FSTTCS, том 181 из Lecture Notes in Computer Science, стр. 188-201. Springer, (1984)A Min-Cost-Max-Flow Based Algorithm for Reconstructing Binary Image from Two Projections Using Similar Images., и . IWCIA, том 4958 из Lecture Notes in Computer Science, стр. 408-419. Springer, (2008)On the Trade-off Between Ambiguity and Complexity in Contextual Languages., , и . Fundam. Informaticae, 122 (4): 315-326 (2013)