Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Stephen A. Edwards

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 John Hui

> Home > Persons > Stephen A. Edwards

Publications

2023
[c63]
- view
  authority control:
- export record
  dblp key:
  - conf/cpsweek/HuiE23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cpsweek/HuiE23
John Hui, Stephen A. Edwards:
Towards Sparse Synchronous Programming in Lua. CPS-IoT Week Workshops 2023: 361-366
[c62]
- view
  - electronic edition @ ieee.org
  - no references & citations available
- export record
  dblp key:
  - conf/memocode/HuiEE23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/memocode/HuiEE23
John Hui, Kyle J. Edwards, Stephen A. Edwards:
Timestamp Peripherals for Precise Real-Time Programming. MEMOCODE 2023: 137-147
2022
[c59]
- view
  authority control:
- export record
  dblp key:
  - conf/memocode/KrookHSEC22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/memocode/KrookHSEC22
Robert Krook, John Hui, Bo Joel Svensson, Stephen A. Edwards, Koen Claessen:
Creating a Language for Writing Real-Time Applications for the Internet of Things. MEMOCODE 2022: 1-20
2020
[c57]
- view
  authority control:
- export record
  dblp key:
  - conf/fdl/EdwardsH20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fdl/EdwardsH20
Stephen A. Edwards, John Hui:
The Sparse Synchronous Model. FDL 2020: 1-8

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.