Mark N. Wegman

Affiliations:
  • IBM Research


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

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 1996, "For contributions to compiler technology and to the design, implementation, and analysis of algorithms.".

IEEE Fellow

IEEE Fellow 2004, "For contributions to the design, implementation, and analysis of algorithms and compiler technology.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Maximal Domain Independent Representations Improve Transfer Learning.
CoRR, 2023

2019
L2-Nonexpansive Neural Networks.
Proceedings of the 7th International Conference on Learning Representations, 2019

2017
IT troubleshooting with drift analysis in the DevOps era.
IBM J. Res. Dev., 2017

Distributed learning of deep feature embeddings for visual recognition tasks.
IBM J. Res. Dev., 2017

2016
A Proximity Measure using Blink Model.
CoRR, 2016

2013
Enterprise context: a rich source of requirements for context-oriented programming.
Proceedings of the 5th International Workshop on Context-Oriented Programming, 2013

2012
Does better throughput require worse latency?
Proceedings of the 2012 ACM workshop on Relaxing synchronization for multicore and manycore scalability, 2012

2009
Ferret: Programming language support for multiple dynamic classification.
Comput. Lang. Syst. Struct., 2009

On the lifetime of multilevel memories.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2007
Using Software Repositories to Investigate Socio-technical Congruence in Development Projects.
Proceedings of the Fourth International Workshop on Mining Software Repositories, 2007

2005
SMTP Path Analysis.
Proceedings of the CEAS 2005, 2005

2001
Graph cutting algorithms for distributed applications partitioning.
SIGMETRICS Perform. Evaluation Rev., 2001

Optimizing Component Interaction.
Proceedings of The Workshop on Languages, 2001

1998
Dynamic Application Partitioning in VisualAge Generator Version 3.0.
Proceedings of the Object-Oriented Technology, ECOOP'98 Workshop Reader, 1998

Partitioning and Assignment of Distributed Object Applications Incorporating Object Replication and Caching.
Proceedings of the Object-Oriented Technology, ECOOP'98 Workshop Reader, 1998

Execution Patterns in Object-Oriented Visualization.
Proceedings of the 4th USENIX Conference on Object-Oriented Technologies and Systems (COOTS), 1998

1991
Constant Propagation with Conditional Branches.
ACM Trans. Program. Lang. Syst., 1991

Efficiently Computing Static Single Assignment Form and the Control Dependence Graph.
ACM Trans. Program. Lang. Syst., 1991

1990
Analysis of pointers and structures (with retrospective)
Proceedings of the 20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation 1979-1999, 1990

Analysis of Pointers and Structures.
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.
Proceedings of the Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, 1989

1988
Global Value Numbers and Redundant Computations.
Proceedings of the Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, 1988

Detecting Equality of Variables in Programs.
Proceedings of the Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, 1988

Learning Probabilistic Prediction Functions (Extended Abstract)
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

Learning Probabilistic Prediction Functions.
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.
ACM SIGPLAN Notices, 1986

What it's like to be a POPL referee.
SIGACT News, 1986

1985
The Complexity of Backtrack Searches (Preliminary Version)
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

1984
A Program Development Tool.
IBM J. Res. Dev., 1984

1983
Summarizing Graphs by Regular Expressions.
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.
Nucleic Acids Res., 1982

1981
New Hash Functions and Their Use in Authentication and Set Equality.
J. Comput. Syst. Sci., 1981

1980
Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time.
Inf. Process. Lett., 1980

Parsing for Structural Editors (Extended Abstract)
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979
Universal Classes of Hash Functions.
J. Comput. Syst. Sci., 1979

New Classes and Applications of Hash Functions
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978
Linear Unification.
J. Comput. Syst. Sci., 1978

Exact and Approximate Membership Testers
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978

Analysis of a Universal Class of Hash Functions.
Proceedings of the Mathematical Foundations of Computer Science 1978, 1978

1977
Universal Classes of Hash Functions (Extended Abstract)
Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977

1976
A Fast and Usually Linear Algorithm for Global Flow Analysis.
J. ACM, 1976

1975
A Fast and Usually Linear Algorithm for Global Flow Analysis (Abstract).
Commun. ACM, 1975


  Loading...