Bernhard Scholz

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 Vasvi Kakkad

> Home > Persons > Bernhard Scholz

Publications

2015
[j12]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/scp/KakkadSFS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/scp/KakkadSFS15
Vasvi Kakkad, Andrew E. Santosa, Alan D. Fekete, Bernhard Scholz:
Computing end-to-end delays in stream query processing. Sci. Comput. Program. 105: 124-144 (2015)
2014
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/spe/KakkadASFS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/spe/KakkadASFS14
Vasvi Kakkad, Saeed Attar, Andrew E. Santosa, Alan D. Fekete, Bernhard Scholz:
Curracurrong: a stream programming environment for wireless sensor networks. Softw. Pract. Exp. 44(2): 175-199 (2014)
[c49]
- view
  authority control:
- export record
  dblp key:
  - conf/icde/KakkadDFS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icde/KakkadDFS14
Vasvi Kakkad, Akon Dey, Alan D. Fekete, Bernhard Scholz:
Curracurrong cloud: Stream processing in the cloud. ICDE Workshops 2014: 207-214
2012
[c43]
- view
  authority control:
- export record
  dblp key:
  - conf/mswim/KakkadSS12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mswim/KakkadSS12
Vasvi Kakkad, Andrew E. Santosa, Bernhard Scholz:
Migrating operator placement for compositional stream graphs. MSWiM 2012: 125-134

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.