![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Arnie Rosenthal 3 Arnie Rosenthal: Will Database Researchers Have ANY Role in Data Security? (Panel Abstract). SIGMOD Conference 2001 2 Arnie Rosenthal: Nonserial Dynamic Programming Is Optimal. STOC 1977 : 98-105 1 Arnie Rosenthal, Anita Goldner : Smallest Augmentations to Biconnect a Graph. SIAM J. Comput. 6 (1): 55-66 (1977) ![]() DiSC'02 © 2003 Association for Computing Machinery |