sign in · help · news · about ·

BibSonomy :: author :: Eidenbenz ::

tag user group author concept BibTeX key search:all

The blue social bookmark and publication sharing system.

>
|
<

bookmarks

bookmarks per page: 5 10 20 50 100

RSS BibTeX RDF more

publications

(86)

<< < 1 | 2 | 3 > >>

Malware propagation in online social networks: nature, dynamics, and defense implications.
Guanhua Yan, Guanling Chen, Stephan Eidenbenz, and Nan Li ASIACCS, page 196-206. ACM, (2011)
to dblp by dblp on Dec 28, 2011, 12:00 AM
URL | BibTeX
Link Positions Matter: A Noncommutative Routing Metric for Wireless Mesh Networks.
Gentian Jakllari, Stephan Eidenbenz, Nicolas W. Hengartner, Srikanth V. Krishnamurthy, and Michalis Faloutsos IEEE Trans. Mob. Comput. 11(1):61-72 (2012)
to dblp by dblp on Dec 21, 2011, 12:00 AM
URL | BibTeX
On the effectiveness of structural detection and defense against P2P-based botnets.
Duc T. Ha, Guanhua Yan, Stephan Eidenbenz, and Hung Q. Ngo DSN, page 297-306. IEEE, (2009)
to dblp by dblp on Dec 20, 2011, 12:00 AM
URL | BibTeX
Blue-Watchdog: Detecting Bluetooth worm propagation in public areas.
Guanhua Yan, Leticia Cuellar, Stephan Eidenbenz, and Nicolas W. Hengartner DSN, page 317-326. IEEE, (2009)
to dblp by dblp on Dec 20, 2011, 12:00 AM
URL | BibTeX
Modeling Propagation Dynamics of Bluetooth Worms Extended Version.
Guanhua Yan, and Stephan Eidenbenz IEEE Trans. Mob. Comput. 8(3):353-368 (2009)
to dblp by dblp on Nov 3, 2011, 12:00 AM
URL | BibTeX
RatBot: Anti-enumeration Peer-to-Peer Botnets.
Guanhua Yan, Songqing Chen, and Stephan Eidenbenz ISC, volume 7001 of Lecture Notes in Computer Science, page 135-151. Springer, (2011)
to dblp by dblp on Oct 14, 2011, 12:00 AM
URL | BibTeX
An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee.
Stephan Eidenbenz, and Peter Widmayer SIAM J. Comput. 32(3):654-670 (2003)
to dblp by dblp on Sep 12, 2011, 12:00 AM
URL | BibTeX
Measurement Errors Make the Partial Digest Problem NP-Hard.
Mark Cieliebak, and Stephan Eidenbenz LATIN, volume 2976 of Lecture Notes in Computer Science, page 379-390. Springer, (2004)
to dblp by dblp on Jul 6, 2011, 12:00 AM
URL | BibTeX
Flexible Train Rostering.
Stephan Eidenbenz, Aris Pagourtzis, and Peter Widmayer ISAAC, volume 2906 of Lecture Notes in Computer Science, page 615-624. Springer, (2003)
to dblp by dblp on Jul 6, 2011, 12:00 AM
URL | BibTeX
Composing Equipotent Teams.
Mark Cieliebak, Stephan Eidenbenz, and Aris Pagourtzis FCT, volume 2751 of Lecture Notes in Computer Science, page 98-108. Springer, (2003)
to dblp by dblp on Jul 5, 2011, 12:00 AM
URL | BibTeX
Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data.
Mark Cieliebak, Stephan Eidenbenz, and Gerhard J. Woeginger COCOON, volume 2697 of Lecture Notes in Computer Science, page 519-527. Springer, (2003)
to dblp by dblp on Jul 5, 2011, 12:00 AM
URL | BibTeX
Noisy Data Make the Partial Digest Problem NP-hard.
Mark Cieliebak, Stephan Eidenbenz, and Paolo Penna WABI, volume 2812 of Lecture Notes in Computer Science, page 111-123. Springer, (2003)
to dblp by dblp on Jul 5, 2011, 12:00 AM
URL | BibTeX
Inapproximability of finding maximum hidden sets on polygons and terrains.
Stephan Eidenbenz Comput. Geom. 21(3):139-153 (2002)
to dblp by dblp on Jul 4, 2011, 12:00 AM
URL | BibTeX
Hidden communication in P2P networks Steganographic handshake and broadcast.
Raphael Eidenbenz, Thomas Locher, and Roger Wattenhofer INFOCOM, page 954-962. IEEE, (2011)
to dblp by dblp on Jul 1, 2011, 12:00 AM
URL | BibTeX
Geography-based analysis of the Internet infrastructure.
Shiva Prasad Kasiviswanathan, Stephan Eidenbenz, and Guanhua Yan INFOCOM, page 131-135. IEEE, (2011)
to dblp by dblp on Jul 1, 2011, 12:00 AM
URL | BibTeX
Designing systems for large-scale, discrete-event simulations: Experiences with the FastTrans parallel microsimulator.
Sunil Thulasidasan, Shiva Prasad Kasiviswanathan, Stephan Eidenbenz, Emanuele Galli, Susan M. Mniszewski, and Philip Romero HiPC, page 428-437. IEEE, (2009)
to dblp by dblp on Jul 1, 2011, 12:00 AM
URL | BibTeX
Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains.
Stephan Eidenbenz SWAT, volume 2368 of Lecture Notes in Computer Science, page 60-68. Springer, (2002)
to dblp by dblp on Jun 30, 2011, 12:00 AM
URL | BibTeX
Measuring the effectiveness of infrastructure-level detection of large-scale botnets.
Yuanyuan Zeng, Guanhua Yan, Stephan Eidenbenz, and Kang G. Shin IWQoS, page 1-9. IEEE, (2011)
to dblp by dblp on Jun 28, 2011, 12:00 AM
URL | BibTeX
An Approximation Algorithm for MINIMUM CONVEX COVER with Logarithmic Performance Guarantee.
Stephan Eidenbenz, and Peter Widmayer ESA, volume 2161 of Lecture Notes in Computer Science, page 333-344. Springer, (2001)
to dblp by dblp on Jun 28, 2011, 12:00 AM
URL | BibTeX
Good programming in transactional memory: Game theory meets multicore architecture.
Raphael Eidenbenz, and Roger Wattenhofer Theor. Comput. Sci. 412(32):4136-4150 (2011)
to dblp by dblp on Jun 22, 2011, 12:00 AM
URL | BibTeX

<< < 1 | 2 | 3 > >>publications per page: 5 10 20 50 100

a gripper