Mark N. Wegman

According to our database, Mark N. Wegman authored at least 42 papers between 1975 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Maximal Domain Independent Representations Improve Transfer Learning.

Adrian Shuai Li, Elisa Bertino, Xuan-Hong Dang, Ankush Singla, Yuhai Tu, Mark N. Wegman

CoRR, 2023

2019

L2-Nonexpansive Neural Networks.

Haifeng Qian, Mark N. Wegman

Proceedings of the 7th International Conference on Learning Representations, 2019

2017

IT troubleshooting with drift analysis in the DevOps era.

F. J. Meng, Mark N. Wegman, J. M. Xu, X. Zhang, P. Chen, G. Chafle

IBM J. Res. Dev., 2017

Distributed learning of deep feature embeddings for visual recognition tasks.

Bishwaranjan Bhattacharjee, Matthew L. Hill, H. Wu, P. S. Chandakkar, John R. Smith, Mark N. Wegman

IBM J. Res. Dev., 2017

2016

A Proximity Measure using Blink Model.

Haifeng Qian, Hui Wan, Mark N. Wegman, Luis A. Lastras, Ruchir Puri

CoRR, 2016

2013

Enterprise context: a rich source of requirements for context-oriented programming.

Sam S. Adams, Suparna Bhattacharya, Bob Friedlander, John Gerken, Doug Kimelman, Jim Kraemer, Harold Ossher, John T. Richards, David M. Ungar, Mark N. Wegman

Proceedings of the 5th International Workshop on Context-Oriented Programming, 2013

2012

Does better throughput require worse latency?

David M. Ungar, Doug Kimelman, Sam S. Adams, Mark N. Wegman

Proceedings of the 2012 ACM workshop on Relaxing synchronization for multicore and manycore scalability, 2012

2009

Ferret: Programming language support for multiple dynamic classification.

Bard Bloom, Paul T. Keyser, Ian Simmonds, Mark N. Wegman

Comput. Lang. Syst. Struct., 2009

On the lifetime of multilevel memories.

Luis Alfonso Lastras-Montaño, Michele Franceschini, Thomas Mittelholzer, John P. Karidis, Mark N. Wegman

Proceedings of the IEEE International Symposium on Information Theory, 2009

2007

Using Software Repositories to Investigate Socio-technical Congruence in Development Projects.

Giuseppe Valetto, Mary E. Helander, Kate Ehrlich, Sunita Chulani, Mark N. Wegman, Clay Williams

Proceedings of the Fourth International Workshop on Mining Software Repositories, 2007

2005

SMTP Path Analysis.

Barry Leiba, Joel Ossher, V. T. Rajan, Richard B. Segal, Mark N. Wegman

Proceedings of the CEAS 2005, 2005

2001

Graph cutting algorithms for distributed applications partitioning.

Karin Högstedt, Doug Kimelman, V. T. Rajan, Tova Roth, Mark N. Wegman

SIGMETRICS Perform. Evaluation Rev., 2001

Optimizing Component Interaction.

Mark N. Wegman, Karin Högstedt, Doug Kimelman, V. T. Rajan, Tova Roth, Nan Wang

Proceedings of The Workshop on Languages, 2001

1998

Dynamic Application Partitioning in VisualAge Generator Version 3.0.

Doug Kimelman, V. T. Rajan, Tova Roth, Mark N. Wegman, Beth Lindsey, Hayden Lindsey, Sandy Thomas

Proceedings of the Object-Oriented Technology, ECOOP'98 Workshop Reader, 1998

Partitioning and Assignment of Distributed Object Applications Incorporating Object Replication and Caching.

Doug Kimelman, V. T. Rajan, Tova Roth, Mark N. Wegman

Proceedings of the Object-Oriented Technology, ECOOP'98 Workshop Reader, 1998

Execution Patterns in Object-Oriented Visualization.

Wim De Pauw, David H. Lorenz, John M. Vlissides, Mark N. Wegman

Proceedings of the 4th USENIX Conference on Object-Oriented Technologies and Systems (COOTS), 1998

1991

Constant Propagation with Conditional Branches.

Mark N. Wegman, F. Kenneth Zadeck

ACM Trans. Program. Lang. Syst., 1991

Efficiently Computing Static Single Assignment Form and the Control Dependence Graph.

Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, F. Kenneth Zadeck

ACM Trans. Program. Lang. Syst., 1991

1990

Analysis of pointers and structures (with retrospective)

David R. Chase, Mark N. Wegman, F. Kenneth Zadeck

Proceedings of the 20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation 1979-1999, 1990

Analysis of Pointers and Structures.

David R. Chase, Mark N. Wegman, F. Kenneth Zadeck

Proceedings of the ACM SIGPLAN'90 Conference on Programming Language Design and Implementation (PLDI), 1990

1989

An Efficient Method of Computing Static Single Assignment Form.

Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, F. Kenneth Zadeck

Proceedings of the Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, 1989

1988

Global Value Numbers and Redundant Computations.

Barry K. Rosen, Mark N. Wegman, F. Kenneth Zadeck

Proceedings of the Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, 1988

Detecting Equality of Variables in Programs.

Bowen Alpern, Mark N. Wegman, F. Kenneth Zadeck

Proceedings of the Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, 1988

Learning Probabilistic Prediction Functions (Extended Abstract)

Alfredo De Santis, George Markowsky, Mark N. Wegman

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

Learning Probabilistic Prediction Functions.

Alfredo De Santis, George Markowsky, Mark N. Wegman

Proceedings of the First Annual Workshop on Computational Learning Theory, 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 accepted.

Mark N. Wegman

ACM SIGPLAN Notices, 1986

What it's like to be a POPL referee.

Mark N. Wegman

SIGACT News, 1986

1985

The Complexity of Backtrack Searches (Preliminary Version)

Larry Carter, Larry J. Stockmeyer, Mark N. Wegman

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

1984

A Program Development Tool.

Cyril N. Alberga, Allen L. Brown, George B. Leeman Jr., Martin Mikelsons, Mark N. Wegman

IBM J. Res. Dev., 1984

1983

Summarizing Graphs by Regular Expressions.

Mark N. Wegman

Proceedings of the Conference Record of the Tenth Annual ACM Symposium on Principles of Programming Languages, 1983

1982

Improvements to a program for DNA analysis: a procedure to find homologies among many sequences.

Cary Queen, Mark N. Wegman, L. J. Korn

Nucleic Acids Res., 1982

1981

New Hash Functions and Their Use in Authentication and Set Equality.

Mark N. Wegman, Larry Carter

J. Comput. Syst. Sci., 1981

1980

Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time.

Manuel Blum, Ashok K. Chandra, Mark N. Wegman

Inf. Process. Lett., 1980

Parsing for Structural Editors (Extended Abstract)

Mark N. Wegman

Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979

Universal Classes of Hash Functions.

Larry Carter, Mark N. Wegman

J. Comput. Syst. Sci., 1979

New Classes and Applications of Hash Functions

Mark N. Wegman, Larry Carter

Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978

Linear Unification.

Mike Paterson, Mark N. Wegman

J. Comput. Syst. Sci., 1978

Exact and Approximate Membership Testers

Larry Carter, Robert W. Floyd, John Gill, George Markowsky, Mark N. Wegman

Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978

Analysis of a Universal Class of Hash Functions.

George Markowsky, Larry Carter, Mark N. Wegman

Proceedings of the Mathematical Foundations of Computer Science 1978, 1978

1977

Universal Classes of Hash Functions (Extended Abstract)

Larry Carter, Mark N. Wegman

Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977

1976

A Fast and Usually Linear Algorithm for Global Flow Analysis.

Susan L. Graham, Mark N. Wegman

J. ACM, 1976

1975

A Fast and Usually Linear Algorithm for Global Flow Analysis (Abstract).

Susan L. Graham, Mark N. Wegman

Commun. ACM, 1975