default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark N. Wegman
Person information
- affiliation: IBM Research
- award (2006): Programming Languages Achievement Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i3]Adrian Shuai Li, Elisa Bertino, Xuan-Hong Dang, Ankush Singla, Yuhai Tu, Mark N. Wegman:
Maximal Domain Independent Representations Improve Transfer Learning. CoRR abs/2306.00262 (2023)
2010 – 2019
- 2019
- [c28]Haifeng Qian, Mark N. Wegman:
L2-Nonexpansive Neural Networks. ICLR (Poster) 2019 - 2018
- [i2]Haifeng Qian, Mark N. Wegman:
L2-Nonexpansive Neural Networks. CoRR abs/1802.07896 (2018) - 2017
- [j16]F. J. Meng, Mark N. Wegman, J. M. Xu, X. Zhang, P. Chen, G. Chafle:
IT troubleshooting with drift analysis in the DevOps era. IBM J. Res. Dev. 61(1): 6:62-6:73 (2017) - [j15]Bishwaranjan Bhattacharjee, Matthew L. Hill, H. Wu, P. S. Chandakkar, John R. Smith, Mark N. Wegman:
Distributed learning of deep feature embeddings for visual recognition tasks. IBM J. Res. Dev. 61(4-5): 4:1-4:8 (2017) - 2016
- [i1]Haifeng Qian, Hui Wan, Mark N. Wegman, Luis A. Lastras, Ruchir Puri:
A Proximity Measure using Blink Model. CoRR abs/1612.07365 (2016) - 2013
- [c27]Sam S. Adams, Suparna Bhattacharya
, Bob Friedlander, John Gerken, Doug Kimelman, Jim Kraemer, Harold Ossher, John T. Richards, David M. Ungar, Mark N. Wegman:
Enterprise context: a rich source of requirements for context-oriented programming. COP@ECOOP 2013: 3:1-3:7 - 2012
- [c26]David M. Ungar, Doug Kimelman, Sam S. Adams, Mark N. Wegman:
Does better throughput require worse latency? RACES@SPLASH 2012: 39-40
2000 – 2009
- 2009
- [j14]Bard Bloom, Paul T. Keyser, Ian Simmonds, Mark N. Wegman:
Ferret: Programming language support for multiple dynamic classification. Comput. Lang. Syst. Struct. 35(3): 306-321 (2009) - [c25]Luis Alfonso Lastras-Montaño, Michele Franceschini, Thomas Mittelholzer, John P. Karidis, Mark N. Wegman:
On the lifetime of multilevel memories. ISIT 2009: 1224-1228 - 2007
- [c24]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
- [c23]Barry Leiba, Joel Ossher, V. T. Rajan, Richard B. Segal, Mark N. Wegman:
SMTP Path Analysis. CEAS 2005 - 2001
- [j13]Karin Högstedt, Doug Kimelman, V. T. Rajan, Tova Roth, Mark N. Wegman:
Graph cutting algorithms for distributed applications partitioning. SIGMETRICS Perform. Evaluation Rev. 28(4): 27-29 (2001) - [c22]Mark N. Wegman, Karin Högstedt, Doug Kimelman, V. T. Rajan, Tova Roth, Nan Wang:
Optimizing Component Interaction. LCTES/OM 2001: 181 - 2000
- [e1]Mark N. Wegman, Thomas W. Reps:
POPL 2000, Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Boston, Massachusetts, USA, January 19-21, 2000. ACM 2000, ISBN 1-58113-125-9 [contents]
1990 – 1999
- 1998
- [c21]Wim De Pauw, David H. Lorenz, John M. Vlissides, Mark N. Wegman:
Execution Patterns in Object-Oriented Visualization. COOTS 1998: 219- - [c20]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 - [c19]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
- [j12]Mark N. Wegman, F. Kenneth Zadeck:
Constant Propagation with Conditional Branches. ACM Trans. Program. Lang. Syst. 13(2): 181-210 (1991) - [j11]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
- [c18]David R. Chase, Mark N. Wegman, F. Kenneth Zadeck:
Analysis of Pointers and Structures. PLDI 1990: 296-310 - [c17]David R. Chase, Mark N. Wegman, F. Kenneth Zadeck:
Analysis of pointers and structures (with retrospective). Best of PLDI 1990: 343-359
1980 – 1989
- 1989
- [c16]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
- [c15]Alfredo De Santis, George Markowsky, Mark N. Wegman:
Learning Probabilistic Prediction Functions. COLT 1988: 312-328 - [c14]Alfredo De Santis, George Markowsky, Mark N. Wegman:
Learning Probabilistic Prediction Functions (Extended Abstract). FOCS 1988: 110-119 - [c13]Bowen Alpern, Mark N. Wegman, F. Kenneth Zadeck:
Detecting Equality of Variables in Programs. POPL 1988: 1-11 - [c12]Barry K. Rosen, Mark N. Wegman, F. Kenneth Zadeck:
Global Value Numbers and Redundant Computations. POPL 1988: 12-27 - 1986
- [j10]Mark N. Wegman:
What it's like to be a POPL referee. SIGACT News 17(4): 50-51 (1986) - [j9]Mark N. Wegman:
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 21(5): 91-95 (1986) - 1985
- [c11]Mark N. Wegman, F. Kenneth Zadeck:
Constant Propagation with Conditional Branches. POPL 1985: 291-299 - [c10]Larry Carter, Larry J. Stockmeyer, Mark N. Wegman:
The Complexity of Backtrack Searches (Preliminary Version). STOC 1985: 449-457 - 1984
- [j8]Cyril N. Alberga, Allen L. Brown, George B. Leeman Jr., Martin Mikelsons, Mark N. Wegman:
A Program Development Tool. IBM J. Res. Dev. 28(1): 60-73 (1984) - 1983
- [c9]Mark N. Wegman:
Summarizing Graphs by Regular Expressions. POPL 1983: 203-216 - 1982
- [j7]Cary Queen, Mark N. Wegman, L. J. Korn:
Improvements to a program for DNA analysis: a procedure to find homologies among many sequences. Nucleic Acids Res. 10(1): 449-456 (1982) - 1981
- [j6]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) - [c8]Cyril N. Alberga, Allen L. Brown, George B. Leeman Jr., Martin Mikelsons, Mark N. Wegman:
A Program Development Tool. POPL 1981: 92-104 - 1980
- [j5]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) - [c7]Mark N. Wegman:
Parsing for Structural Editors (Extended Abstract). FOCS 1980: 320-327
1970 – 1979
- 1979
- [j4]Larry Carter, Mark N. Wegman:
Universal Classes of Hash Functions. J. Comput. Syst. Sci. 18(2): 143-154 (1979) - [c6]Mark N. Wegman, Larry Carter:
New Classes and Applications of Hash Functions. FOCS 1979: 175-182 - 1978
- [j3]Mike Paterson, Mark N. Wegman:
Linear Unification. J. Comput. Syst. Sci. 16(2): 158-167 (1978) - [c5]George Markowsky, Larry Carter, Mark N. Wegman:
Analysis of a Universal Class of Hash Functions. MFCS 1978: 345-354 - [c4]Larry Carter, Robert W. Floyd, John Gill, George Markowsky, Mark N. Wegman:
Exact and Approximate Membership Testers. STOC 1978: 59-65 - 1977
- [c3]Larry Carter, Mark N. Wegman:
Universal Classes of Hash Functions (Extended Abstract). STOC 1977: 106-112 - 1976
- [j2]Susan L. Graham, Mark N. Wegman:
A Fast and Usually Linear Algorithm for Global Flow Analysis. J. ACM 23(1): 172-202 (1976) - [c2]Mike Paterson, Mark N. Wegman:
Linear Unification. STOC 1976: 181-186 - 1975
- [j1]Susan L. Graham, Mark N. Wegman:
A Fast and Usually Linear Algorithm for Global Flow Analysis (Abstract). Commun. ACM 18(12): 716 (1975) - [c1]Susan L. Graham, Mark N. Wegman:
A Fast and Usually Linear Algorithm for Global Flow Analysis. POPL 1975: 22-34
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-09 01:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
