Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Winskel, Glynn"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the determinacy of concurrent games on event structures with infinite winning sets
Julian Gutierrez
,
Glynn Winskel
Journal of Computer and System Sciences
80
(6), 2014, pp. 1119-1137
Graphs, rewriting and pathway reconstruction for rule-based models
Vincent Danos
,
Jerome Feret
,
Walter Fontana
,
Russell Harmer
,
Jonathan Hayman
,
Jean Krivine
,
Chris Thompson-Walsh
,
Glynn Winskel
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 276-288
Prime algebraicity
Glynn Winskel
Theoretical Computer Science
410
(41), 2009, pp. 4160-4168
The unfolding of general Petri nets
Jonathan Hayman
,
Glynn Winskel
Leibniz International Proceedings in Informatics (LIPIcs)
2
, 2008
Probabilistic event structures and domains
Daniele Varacca
,
Hagen Völzer
,
Glynn Winskel
Theoretical Computer Science
358
(2-3), 2006, pp. 173-199
Domain theory for concurrency
Mikkel Nygaard
,
Glynn Winskel
Theoretical Computer Science
316
(1-3), 2004, pp. 153-190
New-HOPLA: A higher-order process language with name generation
Glynn Winskel
,
Francesco Zappa Nardelli
Proceedings of the 18th World Computer Congress and TC1 3rd International Conference on Theoretical Computer Science - Exploring New Frontiers of Theoretical Informatics, IFIP TCS'2004 (Toulouse, France, August 22-27, 2004)
, 2004, pp. 521-534
Presheaf models for CCS-like languages
Gian Luca Cattani
,
Glynn Winskel
Theoretical Computer Science
300
(1-3), 2003, pp. 47-89
Composing strand spaces
Federico Crazzolara
,
Glynn Winskel
Lecture Notes in Computer Science
2556
, 2002, pp. 97-108
Protection in programming-language translations
Martín Abadi
Lecture Notes in Computer Science
1443
, 1998, pp. 868-883
On the complexity of deriving score functions from examples for problems in molecular biology
Tatsuya Akutsu
,
Mutsunori Yagiura
Lecture Notes in Computer Science
1443
, 1998, pp. 832-843
Deciding global partial-order properties
Rajeev Alur
,
Ken McMillan
,
Doron Peled
Lecture Notes in Computer Science
1443
, 1998, pp. 41-52
Metric semantics for true concurrent real time
Christel Baier
,
Joost-Pieter Katoen
,
Diego Latella
Lecture Notes in Computer Science
1443
, 1998, pp. 568-579
Concatenable graph processes: Relating processes and derivation traces
Paolo Baldan
,
Andrea Corradini
,
Ugo Montanari
Lecture Notes in Computer Science
1443
, 1998, pp. 283-295
The relevance of proof-irrelevance
Gilles Barthe
Lecture Notes in Computer Science
1443
, 1998, pp. 755-768
Efficient approximation algorithms for the Subset-Sums Equality problem
Cristina Bazgan
,
Miklos Santha
,
Zsolt Tuza
Lecture Notes in Computer Science
1443
, 1998, pp. 387-396
CONS-free programs with tree input
Amir M. Ben-Amram
,
Holger Petersen
Lecture Notes in Computer Science
1443
, 1998, pp. 271-282
Inversion of circulant matrices over
Z_m
Dario Bini
,
Gianna M. del Corso
,
Giovanni Manzini
,
Luciano Margara
Lecture Notes in Computer Science
1443
, 1998, pp. 719-730
On the expressiveness of real and integer arithmetic automata
Bernard Boigelot
,
Stéphane Rassart
,
Pierre Wolper
Lecture Notes in Computer Science
1443
, 1998, pp. 152-163
On existentially first-order definable languages and their relation to
NP
Bernd Borchert
,
Dietrich Kuske
,
Frank Stephan
Lecture Notes in Computer Science
1443
, 1998, pp. 17-28
Quantum counting
Gilles Brassard
,
Peter Hyer
,
Alain Tapp
Lecture Notes in Computer Science
1443
, 1998, pp. 820-831
New horizons in quantum information processing
Gilles Brassard
Lecture Notes in Computer Science
1443
, 1998, pp. 769-771
Totality, definability and Boolean circuits
Antonio Bucciarelli
,
Ivano Salvo
Lecture Notes in Computer Science
1443
, 1998, pp. 808-819
On the determinization of weighted finite automata
Adam L. Buchsbaum
,
Raffaele Giancarlo
,
Jeffery R. Westbrook
Lecture Notes in Computer Science
1443
, 1998, pp. 482-493
Computing mimicking networks
Shiva Chaudhuri
,
K.V. Subrahmanyam
,
Frank Wagner
,
Christos D. Zaroliagis
Lecture Notes in Computer Science
1443
, 1998, pp. 556-567
Seiten 1
2
3
4
5
>