Monografie
Attackers, Packets, and Puzzles: On Denial-of-Service Prevention in Local Area Networks
- Sprache
-
Englisch
- Anmerkungen
-
Düsseldorf, Heinrich-Heine-Universität, Diss., 2012
- Identifier
-
1023761874
Thema
Hochschulschrift
Beteiligte Personen und Organisationen
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
26.01.2023, 13:53 MEZ
Objekttyp
- Monografie
Beteiligte
- Jerschow, Yves Igor
- Mauve, Martin
- Rothe, Jörg
Ähnliche Objekte (12)
Algorithms and Complexity for Fair Division, Voting, and Peer Reviewing
Opinion Mining in Newspapers for a Media Response Analysis
A Long Movement Story Cut Short - On the Compression of Trajectory Data
Adaptive Consistency Management for In-memory Storage
Ursachen- und wirkungsorientierte Analyse gesammelter Fahrprofile zur taktischen Fahrtoptimierung
Metadaten-Verwaltung in einem verteilten RAM-basierten Speicherdienst
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
Quantum key distribution with finite resources: Improving secret key rates
Approximierbarkeit und Unapproximierbarkeit der Optimierung der sozialen Wohlfahrt im Bereich der Multiagenten-Systeme
Computational Complexity in Three Areas of Computational Social Choice: Possible Winners, Unidirectional Covering Sets, and Judgment Aggregation
Position-Based Multicast Routing for Mobile Ad-Hoc Networks
Efficient Connection Establishment, Message Handling and Content Delivery in Opportunistic Networks
Algorithms and Complexity for Fair Division, Voting, and Peer Reviewing
Opinion Mining in Newspapers for a Media Response Analysis
A Long Movement Story Cut Short - On the Compression of Trajectory Data
Adaptive Consistency Management for In-memory Storage
Ursachen- und wirkungsorientierte Analyse gesammelter Fahrprofile zur taktischen Fahrtoptimierung
Metadaten-Verwaltung in einem verteilten RAM-basierten Speicherdienst
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
Quantum key distribution with finite resources: Improving secret key rates
Approximierbarkeit und Unapproximierbarkeit der Optimierung der sozialen Wohlfahrt im Bereich der Multiagenten-Systeme
Computational Complexity in Three Areas of Computational Social Choice: Possible Winners, Unidirectional Covering Sets, and Judgment Aggregation
Position-Based Multicast Routing for Mobile Ad-Hoc Networks
Efficient Connection Establishment, Message Handling and Content Delivery in Opportunistic Networks
Algorithms and Complexity for Fair Division, Voting, and Peer Reviewing
Opinion Mining in Newspapers for a Media Response Analysis
A Long Movement Story Cut Short - On the Compression of Trajectory Data
Adaptive Consistency Management for In-memory Storage
Ursachen- und wirkungsorientierte Analyse gesammelter Fahrprofile zur taktischen Fahrtoptimierung
Metadaten-Verwaltung in einem verteilten RAM-basierten Speicherdienst
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
Quantum key distribution with finite resources: Improving secret key rates
Approximierbarkeit und Unapproximierbarkeit der Optimierung der sozialen Wohlfahrt im Bereich der Multiagenten-Systeme
Computational Complexity in Three Areas of Computational Social Choice: Possible Winners, Unidirectional Covering Sets, and Judgment Aggregation
Position-Based Multicast Routing for Mobile Ad-Hoc Networks