Mark N. Wegman - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 41 from 41

2019

L2-Nonexpansive Neural NetworksHaifeng Qian, Mark N. Wegman. iclr 2019: [doi]

2017

IT troubleshooting with drift analysis in the DevOps eraF. J. Meng, Mark N. Wegman, J. M. Xu, X. Zhang, P. Chen, G. Chafle. ibmrd, 61(1):6, 2017. [doi]

2013

Enterprise context: a rich source of requirements for context-oriented programmingSam S. Adams, Suparna Bhattacharya, Bob Friedlander, John Gerken, Doug Kimelman, Jim Kraemer, Harold Ossher, John T. Richards, David Ungar, Mark N. Wegman. ECOOP 2013: [doi]

2012

Does better throughput require worse latency?David M. Ungar, Doug Kimelman, Sam S. Adams, Mark N. Wegman. OOPSLA 2012: 39-40 [doi]

2009

Ferret: Programming language support for multiple dynamic classificationBard Bloom, Paul Keyser, Ian Simmonds, Mark N. Wegman. Comp. Lang., Syst. \& Struct., 35(3):306-321, 2009. [doi]

2007

Using Software Repositories to Investigate Socio-technical Congruence in Development ProjectsGiuseppe Valetto, Mary E. Helander, Kate Ehrlich, Sunita Chulani, Mark N. Wegman, Clay Williams. msr 2007: 25 [doi]

2005

SMTP Path AnalysisBarry Leiba, Joel Ossher, V. T. Rajan, Richard Segal, Mark N. Wegman. ceas 2005: [doi]

2001

Graph cutting algorithms for distributed applications partitioningKarin Högstedt, Doug Kimelman, V. T. Rajan, Tova Roth, Mark N. Wegman. sigmetrics, 28(4):27-29, 2001. [doi]

Optimizing Component InteractionMark N. Wegman, Karin Högstedt, Doug Kimelman, V. T. Rajan, Tova Roth, Nan Wang. lctrts 2001: 181-181

1998

1991

Efficiently Computing Static Single Assignment Form and the Control Dependence GraphRon Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, F. Kenneth Zadeck. TOPLAS, 13(4):451-490, 1991. [doi]

Constant Propagation with Conditional BranchesMark N. Wegman, F. Kenneth Zadeck. TOPLAS, 13(2):181-210, 1991. [doi]

1990

Analysis of Pointers and StructuresDavid R. Chase, Mark N. Wegman, F. Kenneth Zadeck. PLDI 1990: 296-310

Analysis of pointers and structures (with retrospective)David R. Chase, Mark N. Wegman, F. Kenneth Zadeck. PLDI 2004: 343-359 [doi]

1989

An Efficient Method of Computing Static Single Assignment FormRon Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, F. Kenneth Zadeck. POPL 1989: 25-35

1988

1986

What it's like to be a POPL referee; or how to write an extended abstract so that it is more likely to be acceptedMark N. Wegman. SIGPLAN, 21(5):91-95, 1986. [doi]

What it's like to be a POPL refereeMark N. Wegman. sigact, 17(4):50-51, 1986. [doi]

1985

The Complexity of Backtrack Searches (Preliminary Version)Larry Carter, Larry J. Stockmeyer, Mark N. Wegman. stoc 1985: 449-457

Constant Propagation with Conditional BranchesMark N. Wegman, F. Kenneth Zadeck. POPL 1985: 291-299

1984

A Program Development ToolCyril N. Alberga, Allen L. Brown, George B. Leeman Jr., Martin Mikelsons, Mark N. Wegman. ibmrd, 28(1):60-73, 1984.

1983

Summarizing Graphs by Regular ExpressionsMark N. Wegman. POPL 1983: 203-216

1981

A Program Development ToolCyril N. Alberga, Alfred L. Brown, George B. Leeman Jr., Martin Mikelsons, Mark N. Wegman. POPL 1981: 92-104

New Hash Functions and Their Use in Authentication and Set EqualityMark N. Wegman, Larry Carter. jcss, 22(3):265-279, 1981.

1980

Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial TimeManuel Blum, Ashok K. Chandra, Mark N. Wegman. ipl, 10(2):80-82, 1980.

Parsing for Structural Editors (Extended Abstract)Mark N. Wegman. focs 1980: 320-327

1979

Universal Classes of Hash FunctionsLarry Carter, Mark N. Wegman. jcss, 18(2):143-154, 1979.

New Classes and Applications of Hash FunctionsMark N. Wegman, Larry Carter. focs 1979: 175-182

1978

Exact and Approximate Membership TestersLarry Carter, Robert W. Floyd, John Gill, George Markowsky, Mark N. Wegman. stoc 1978: 59-65

Analysis of a Universal Class of Hash FunctionsGeorge Markowsky, Larry Carter, Mark N. Wegman. mfcs 1978: 345-354

Linear UnificationMike Paterson, Mark N. Wegman. jcss, 16(2):158-167, 1978.

1977

Universal Classes of Hash Functions (Extended Abstract)Larry Carter, Mark N. Wegman. stoc 1977: 106-112

1976

A Fast and Usually Linear Algorithm for Global Flow AnalysisSusan L. Graham, Mark N. Wegman. JACM, 23(1):172-202, 1976. [doi]

Linear UnificationMike Paterson, Mark N. Wegman. stoc 1976: 181-186 [doi]

1975

A Fast and Usually Linear Algorithm for Global Flow Analysis (Abstract)Susan L. Graham, Mark N. Wegman. CACM, 18(12):716, 1975.

A Fast and Usually Linear Algorithm for Global Flow AnalysisSusan L. Graham, Mark N. Wegman. POPL 1975: 22-34

Sign in or sign up to see more results.

runs on WebDSL