2008 |
14 | EE | Igor Devetak,
Aram Wettroth Harrow,
Andreas J. Winter:
A Resource Framework for Quantum Shannon Theory.
IEEE Transactions on Information Theory 54(10): 4587-4618 (2008) |
2006 |
13 | EE | C. Ahn,
A. C. Doherty,
Patrick M. Hayden,
Andreas J. Winter:
On the Distributed Compression of Quantum Information.
IEEE Transactions on Information Theory 52(10): 4349-4357 (2006) |
12 | EE | A. Abeyesinghe,
Patrick M. Hayden,
G. Smith,
Andreas J. Winter:
Optimal Superdense Coding of Entangled States.
IEEE Transactions on Information Theory 52(8): 3635-3641 (2006) |
2005 |
11 | EE | Charles H. Bennett,
Patrick M. Hayden,
Debbie W. Leung,
Peter W. Shor,
Andreas J. Winter:
Remote preparation of quantum states.
IEEE Transactions on Information Theory 51(1): 56-74 (2005) |
1998 |
10 | | Manfred Münch,
Andy Schürr,
Andreas J. Winter:
Integrity Constraints in the Multi-paradigm Language PROGRES.
TAGT 1998: 338-351 |
9 | | Andy Schürr,
Andreas J. Winter:
UML Packages for PROgrammed Graph REwriting Systems.
TAGT 1998: 396-409 |
8 | | Manfred Münch,
Andy Schürr,
Andreas J. Winter:
Integrity Constraints in the Multi-Paradigm Language PROGRESS.
VL 1998: 84-85 |
1997 |
7 | EE | Andy Schürr,
Andreas J. Winter:
Formal Definition and Refinement of UML's Module/Package Concept.
ECOOP Workshops 1997: 211-215 |
6 | | Andy Schürr,
Andreas J. Winter:
Formal Definition of UML's Package Concept.
UML Workshop 1997: 144-159 |
1996 |
5 | | Andy Schürr,
Andreas J. Winter,
Albert Zündorf:
Developing Tools with the PROGRES Environment.
IPSEN Book 1996: 356-369 |
4 | | Manfred Nagl,
Andy Schürr,
Andreas J. Winter:
Specification in the Large for Graph Grammars.
IPSEN Book 1996: 535-555 |
3 | | Andy Schürr,
Andreas J. Winter,
Albert Zündorf:
Spezifikation und Prototyping graphbasierter Systeme.
Inform., Forsch. Entwickl. 11(4): 191-202 (1996) |
1995 |
2 | | Andy Schürr,
Andreas J. Winter,
Albert Zündorf:
Graph Grammar Engineering with PROGRES.
ESEC 1995: 219-234 |
1 | EE | Andy Schürr,
Andreas J. Winter,
Albert Zündorf:
Visual Programming with Graph Rewriting Systems.
VL 1995: 326-333 |