Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Martin Theobald

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 Amal Tawakuli

> Home > Persons > Martin Theobald

Publications

2022
[j12]
- view
  authority control:
- export record
  dblp key:
  - journals/jpdc/VenugopalTTCT22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jpdc/VenugopalTTCT22
Vinu Ellampallil Venugopal, Martin Theobald, Damien Tassetti, Samira Chaychi, Amal Tawakuli:
Targeting a light-weight and multi-channel approach for distributed stream processing. J. Parallel Distributed Comput. 167: 77-96 (2022)
2020
[c73]
- view
  authority control:
- export record
  dblp key:
  - conf/sbac-pad/VenugopalTCT20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sbac-pad/VenugopalTCT20
Vinu E. Venugopal, Martin Theobald, Samira Chaychi, Amal Tawakuli:
AIR: A Light-Weight Yet High-Performance Dataflow Engine based on Asynchronous Iterative Routing. SBAC-PAD 2020: 51-58
[i9]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2001-00164
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2001-00164
Vinu E. Venugopal, Martin Theobald, Samira Chaychi, Amal Tawakuli:
AIR: A Light-Weight Yet High-Performance Dataflow Engine based on Asynchronous Iterative Routing. CoRR abs/2001.00164 (2020)

a service of

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.