Mark C. Jeffrey

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▷ joint publications with coauthor community group 2

> Home > Persons > Mark C. Jeffrey

Publications

2022
[c10]
- view
  authority control:
- export record
  dblp key:
  - conf/micro/ZhaoUGJJ22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/micro/ZhaoUGJJ22
Jiechen Zhao, Iris Uwizeyimana, Karthik Ganesan, Mark C. Jeffrey, Natalie Enright Jerger:
ALTOCUMULUS: Scalable Scheduling for Nanosecond-Scale Remote Procedure Calls. MICRO 2022: 423-440
2011
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/trets/LabrecqueJS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/trets/LabrecqueJS11
Martin Labrecque, Mark C. Jeffrey, J. Gregory Steffan:
Application-specific signatures for transactional memory in soft processors. ACM Trans. Reconfigurable Technol. Syst. 4(3): 21:1-21:14 (2011)
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/spaa/JeffreyS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/spaa/JeffreyS11
Mark C. Jeffrey, J. Gregory Steffan:
Understanding bloom filter intersection for lazy address-set disambiguation. SPAA 2011: 345-354
2010
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/arc/LabrecqueJS10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/arc/LabrecqueJS10
Martin Labrecque, Mark C. Jeffrey, J. Gregory Steffan:
Application-Specific Signatures for Transactional Memory in Soft Processors. ARC 2010: 42-54

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.