|
Search the dblp DataBase
Matthew S. Hecht:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Matthew S. Hecht, John D. Gabbe
Shadowed Management of Free Disk Pages with a Linked List. [Citation Graph (2, 7)][DBLP] ACM Trans. Database Syst., 1983, v:8, n:4, pp:503-514 [Journal]
- Virgil D. Gligor, C. Sekar Chandersekaran, Robert S. Chapman, Leslie J. Dotterer, Matthew S. Hecht, Wen-Der Jiang, Abhai Johri, Gary L. Luckenbaugh, N. Vasudevan
Design and Implementation of Secure Xenix. [Citation Graph (1, 0)][DBLP] IEEE Trans. Software Eng., 1987, v:13, n:2, pp:208-221 [Journal]
- Greg N. Frederickson, Matthew S. Hecht, Chul E. Kim
Approximation Algorithms for some Routing Problems [Citation Graph (0, 0)][DBLP] FOCS, 1976, pp:216-227 [Conf]
- Matthew S. Hecht
Topological Sorting and Flow Graphs. [Citation Graph (0, 0)][DBLP] IFIP Congress, 1974, pp:494-499 [Conf]
- Matthew S. Hecht, Jeffrey D. Ullman
Analysis of a Simple Algorithm for Global Flow Problems. [Citation Graph (0, 0)][DBLP] POPL, 1973, pp:207-217 [Conf]
- Virgil D. Gligor, E. L. Burch, C. Sekar Chandersekaran, Robert S. Chapman, Leslie J. Dotterer, Matthew S. Hecht, Wen-Der Jiang, Gary L. Luckenbaugh, N. Vasudevan
On the Design and the Implementation of Secure Xenix Workstations. [Citation Graph (0, 0)][DBLP] IEEE Symposium on Security and Privacy, 1986, pp:102-117 [Conf]
- Matthew S. Hecht, Jeffrey D. Ullman
Flow Graph Reducibility [Citation Graph (0, 0)][DBLP] STOC, 1972, pp:238-250 [Conf]
- Matthew S. Hecht, Jeffrey D. Ullman
Characterizations of Reducible Flow Graphs. [Citation Graph (0, 0)][DBLP] J. ACM, 1974, v:21, n:3, pp:367-375 [Journal]
- Greg N. Frederickson, Matthew S. Hecht, Chul E. Kim
Approximation Algorithms for Some Routing Problems. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1978, v:7, n:2, pp:178-193 [Journal]
- Matthew S. Hecht, Jeffrey D. Ullman
Flow Graph Reducibility. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1972, v:1, n:2, pp:188-202 [Journal]
- Matthew S. Hecht, Jeffrey D. Ullman
A Simple Algorithm for Global Data Flow Analysis Problems. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1975, v:4, n:4, pp:519-532 [Journal]
Search in 0.002secs, Finished in 0.003secs
|