Mark N. Wegman

2007
34	EE	Giuseppe Valetto, Mary E. Helander, Kate Ehrlich, Sunita Chulani, Mark N. Wegman, Clay Williams: Using Software Repositories to Investigate Socio-technical Congruence in Development Projects. MSR 2007: 25
2005
33	EE	Barry Leiba, Joel Ossher, V. T. Rajan, Richard Segal, Mark N. Wegman: SMTP Path Analysis. CEAS 2005
2001
32		Mark N. Wegman, Karin Högstedt, Doug Kimelman, V. T. Rajan, Tova Roth, Nan Wang: Optimizing Component Interaction. LCTES/OM 2001: 181-181
31	EE	Karin Högstedt, Doug Kimelman, V. T. Rajan, Tova Roth, Mark N. Wegman: Graph cutting algorithms for distributed applications partitioning. SIGMETRICS Performance Evaluation Review 28(4): 27-29 (2001)
1998
30	EE	Wim De Pauw, David H. Lorenz, John M. Vlissides, Mark N. Wegman: Execution Patterns in Object-Oriented Visualization. COOTS 1998: 219-
29	EE	Doug Kimelman, V. T. Rajan, Tova Roth, Mark N. Wegman: Partitioning and Assignment of Distributed Object Applications Incorporating Object Replication and Caching. ECOOP Workshops 1998: 313-314
28	EE	Doug Kimelman, V. T. Rajan, Tova Roth, Mark N. Wegman, Beth Lindsey, Hayden Lindsey, Sandy Thomas: Dynamic Application Partitioning in VisualAge Generator Version 3.0. ECOOP Workshops 1998: 547-548
1991
27	EE	Mark N. Wegman, F. Kenneth Zadeck: Constant Propagation with Conditional Branches. ACM Trans. Program. Lang. Syst. 13(2): 181-210 (1991)
26	EE	Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, F. Kenneth Zadeck: Efficiently Computing Static Single Assignment Form and the Control Dependence Graph. ACM Trans. Program. Lang. Syst. 13(4): 451-490 (1991)
1990
25	EE	David R. Chase, Mark N. Wegman, F. Kenneth Zadeck: Analysis of pointers and structures (with retrospective) Best of PLDI 1990: 343-359
24		David R. Chase, Mark N. Wegman, F. Kenneth Zadeck: Analysis of Pointers and Structures. PLDI 1990: 296-310
1989
23		Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, F. Kenneth Zadeck: An Efficient Method of Computing Static Single Assignment Form. POPL 1989: 25-35
1988
22	EE	Alfredo De Santis, George Markowsky, Mark N. Wegman: Learning Probabilistic Prediction Functions. COLT 1988: 312-328
21		Alfredo De Santis, George Markowsky, Mark N. Wegman: Learning Probabilistic Prediction Functions (Extended Abstract) FOCS 1988: 110-119
20		Bowen Alpern, Mark N. Wegman, F. Kenneth Zadeck: Detecting Equality of Variables in Programs. POPL 1988: 1-11
19		Barry K. Rosen, Mark N. Wegman, F. Kenneth Zadeck: Global Value Numbers and Redundant Computations. POPL 1988: 12-27
1985
18		Mark N. Wegman, F. Kenneth Zadeck: Constant Propagation with Conditional Branches. POPL 1985: 291-299
17		Larry Carter, Larry J. Stockmeyer, Mark N. Wegman: The Complexity of Backtrack Searches (Preliminary Version) STOC 1985: 449-457
1984
16		Cyril N. Alberga, Allen L. Brown, George B. Leeman Jr., Martin Mikelsons, Mark N. Wegman: A Program Development Tool. IBM Journal of Research and Development 28(1): 60-73 (1984)
1983
15		Mark N. Wegman: Summarizing Graphs by Regular Expressions. POPL 1983: 203-216
1981
14		Cyril N. Alberga, Alfred L. Brown, George B. Leeman Jr., Martin Mikelsons, Mark N. Wegman: A Program Development Tool. POPL 1981: 92-104
13		Mark N. Wegman, Larry Carter: New Hash Functions and Their Use in Authentication and Set Equality. J. Comput. Syst. Sci. 22(3): 265-279 (1981)
1980
12		Mark N. Wegman: Parsing for Structural Editors (Extended Abstract) FOCS 1980: 320-327
11		Manuel Blum, Ashok K. Chandra, Mark N. Wegman: Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time. Inf. Process. Lett. 10(2): 80-82 (1980)
1979
10		Mark N. Wegman, Larry Carter: New Classes and Applications of Hash Functions FOCS 1979: 175-182
9		Larry Carter, Mark N. Wegman: Universal Classes of Hash Functions. J. Comput. Syst. Sci. 18(2): 143-154 (1979)
1978
8		George Markowsky, Larry Carter, Mark N. Wegman: Analysis of a Universal Class of Hash Functions. MFCS 1978: 345-354
7		Larry Carter, Robert W. Floyd, John Gill, George Markowsky, Mark N. Wegman: Exact and Approximate Membership Testers STOC 1978: 59-65
6		Mike Paterson, Mark N. Wegman: Linear Unification. J. Comput. Syst. Sci. 16(2): 158-167 (1978)
1977
5		Larry Carter, Mark N. Wegman: Universal Classes of Hash Functions (Extended Abstract) STOC 1977: 106-112
1976
4		Mike Paterson, Mark N. Wegman: Linear Unification STOC 1976: 181-186
3	EE	Susan L. Graham, Mark N. Wegman: A Fast and Usually Linear Algorithm for Global Flow Analysis. J. ACM 23(1): 172-202 (1976)
1975
2		Susan L. Graham, Mark N. Wegman: A Fast and Usually Linear Algorithm for Global Flow Analysis. POPL 1975: 22-34
1		Susan L. Graham, Mark N. Wegman: A Fast and Usually Linear Algorithm for Global Flow Analysis (Abstract). Commun. ACM 18(12): 716 (1975)

Coauthor Index

1	Cyril N. Alberga	[14] [16]
2	Bowen Alpern	[20]
3	Manuel Blum	[11]
4	Alfred L. Brown (Fred Brown)	[14]
5	Allen L. Brown	[16]
6	Larry Carter	[5] [7] [8] [9] [10] [13] [17]
7	Ashok K. Chandra	[11]
8	David R. Chase	[24] [25]
9	Sunita Chulani	[34]
10	Ron Cytron (Ron K. Cytron)	[23] [26]
11	Kate Ehrlich	[34]
12	Jeanne Ferrante	[23] [26]
13	Robert W. Floyd	[7]
14	John Gill	[7]
15	Susan L. Graham	[1] [2] [3]
16	Mary E. Helander	[34]
17	Karin Högstedt	[31] [32]
18	Doug Kimelman	[28] [29] [31] [32]
19	George B. Leeman Jr.	[14] [16]
20	Barry Leiba	[33]
21	Beth Lindsey	[28]
22	Hayden Lindsey	[28]
23	David H. Lorenz	[30]
24	George Markowsky	[7] [8] [21] [22]
25	Martin Mikelsons	[14] [16]
26	Joel Ossher	[33]
27	Mike Paterson	[4] [6]
28	Wim De Pauw	[30]
29	V. T. Rajan	[28] [29] [31] [32] [33]
30	Barry K. Rosen	[19] [23] [26]
31	Tova Roth	[28] [29] [31] [32]
32	Alfredo De Santis	[21] [22]
33	Richard Segal	[33]
34	Larry J. Stockmeyer	[17]
35	Sandy Thomas	[28]
36	Giuseppe Valetto	[34]
37	John M. Vlissides	[30]
38	Nan Wang	[32]
39	Clay Williams	[34]
40	F. Kenneth Zadeck	[18] [19] [20] [23] [24] [25] [26] [27]

Colors in the list of coauthors