Rebecca Isaacs

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 Richard Black

> Home > Persons > Rebecca Isaacs

Publications

2012
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1206-3280
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1206-3280
Aleksandr Simma, Moisés Goldszmidt, John MacCormick, Paul Barham, Richard Black, Rebecca Isaacs, Richard Mortier:
CT-NOR: Representing and Reasoning About Events in Continuous Time. CoRR abs/1206.3280 (2012)
2008
[c7]
- view
  - electronic edition @ dslpitt.org (archived)
  - no references & citations available
- export record
  dblp key:
  - conf/uai/SimmaGMBBIM08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/uai/SimmaGMBBIM08
Aleksandr Simma, Moisés Goldszmidt, John MacCormick, Paul Barham, Richard Black, Rebecca Isaacs, Richard Mortier:
CT-NOR: Representing and Reasoning About Events in Continuous Time. UAI 2008: 484-493
2006
[c6]
- view
  - electronic edition @ sigcomm.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/hotnets/BahlBBCGIKLMMMW06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/hotnets/BahlBBCGIKLMMMW06
Paramvir Bahl, Paul Barham, Richard Black, Ranveer Chandra, Moisés Goldszmidt, Rebecca Isaacs, Srikanth Kandula, Lun Li, John MacCormick, David A. Maltz, Richard Mortier, Mike Wawrzoniak, Ming Zhang:
Discovering Dependencies for Network Management. HotNets 2006

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.