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: Keywords=conflict resolution
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Expansion-based QBF solving versus Q-resolution
Mikolás̑ Janota
,
Joao Marques-Silva
Theoretical Computer Science
577
, 2015, pp. 25-42
Comparisons of air traffic control implementations on an associative processor with a MIMD and consequences for parallel computing
Man (Mike) Yuan
,
Johnnie W. Baker
,
Will C. Meilander
Journal Parallel Distributed Computing
73
(2), 2013, pp. 256-272
A privacy preserving authorisation system for the cloud
David W. Chadwick
,
Kaniz Fatema
Journal of Computer and System Sciences
78
(5), 2012, pp. 1359-1373
Good programming in transactional memory: Game theory meets multicore architecture
Raphael Eidenbenz
,
Roger Wattenhofer
Theoretical Computer Science
412
(32), 2011, pp. 4136-4150
Collaborative signal processing for target tracking in distributed wireless sensor networks
Xue Wang
,
Sheng Wang
Journal Parallel Distributed Computing
67
(5), 2007, pp. 501-515
Graph-based specification of access control policies
Manuel Koch
,
L.V. Mancini
,
Francesco Parisi-Presicce
Journal of Computer and System Sciences
71
(1), 2005, pp. 1-33
Bounded-connect noncanonical discriminating-reverse parsers
Jacques Farré
,
J. Fortes Gálvez
Theoretical Computer Science
313
(1), 2004, pp. 73-91
A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
A.G. Greenberg
,
S. Winograd
Journal of the ACM
32
(3), 1985, pp. 589-596
On a class of multistage interconnection networks
Chuan-Lin Wu
,
Tse-Yun Feng
IEEE Transactions on Computers
C-29
(8), 1980, August, pp. 694-702