default search action
Philippe Oechslin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [c10]Teklemariam Tsegay Tesfay, Jean-Pierre Hubaux, Jean-Yves Le Boudec, Philippe Oechslin:
Cyber-secure communication architecture for active power distribution networks. SAC 2014: 545-552
2000 – 2009
- 2008
- [j6]Gildas Avoine, Pascal Junod
, Philippe Oechslin:
Characterization and Improvement of Time-Memory Trade-Off Based on Perfect Tables. ACM Trans. Inf. Syst. Secur. 11(4): 17:1-17:22 (2008) - 2007
- [b1]Gildas Avoine, Pascal Junod, Philippe Oechslin:
Computer system security - Basic Concepts and Solved Exercises. Computer and communication sciences, CRC Press 2007, ISBN 978-1-4200-4620-5, pp. I-XII, 1-260 - 2005
- [c9]Gildas Avoine, Philippe Oechslin:
RFID Traceability: A Multilayer Problem. Financial Cryptography 2005: 125-140 - [c8]Gildas Avoine, Pascal Junod
Time-Memory Trade-Offs: False Alarm Detection Using Checkpoints. INDOCRYPT 2005: 183-196 - [c7]Gildas Avoine, Philippe Oechslin:
A Scalable and Provably Secure Hash-Based RFID Protocol. PerCom Workshops 2005: 110-114 - [c6]Gildas Avoine, Etienne Dysli, Philippe Oechslin:
Reducing Time Complexity in RFID Systems. Selected Areas in Cryptography 2005: 291-306 - 2003
- [c5]Philippe Oechslin:
Making a Faster Cryptanalytic Time-Memory Trade-Off. CRYPTO 2003: 617-630 - [c4]Alexandre Aellig, Philippe Oechslin:
Tracing Attacks and Restoring Integrity with Lascar. IICIS 2003: 115-124
1990 – 1999
- 1998
- [j5]Jon Crowcroft, Philippe Oechslin:
Differentiated end-to-end Internet services using a weighted proportional fair sharing TCP. Comput. Commun. Rev. 28(3): 53-69 (1998) - [j4]Werner Almesberger, Jean-Yves Le Boudec, Philippe Oechslin:
Arequipa: Using TCP/IP over ATM with quality of service is simple ... if you have ATM end-to-end. Netw. Inf. Syst. J. 1(4-5): 469-494 (1998) - [i2]Jon Crowcroft, Philippe Oechslin:
Differentiated End-to-End Internet Services using a Weighted Proportional Fair Sharing TCP. CoRR cs.NI/9808004 (1998) - 1997
- [j3]Eric Gauthier, Jean-Yves Le Boudec, Philippe Oechslin:
SMART: A Many-to-Many Multicast Protocol for ATM. IEEE J. Sel. Areas Commun. 15(3): 458-472 (1997) - [c3]Silvia Giordano, Jean-Yves Le Boudec, Philippe Oechslin, Stephan Robert:
VBR over VBR: The Homogeneous, Loss-Free Case. INFOCOM 1997: 168-176 - [i1]Werner Almesberger, Jean-Yves Le Boudec, Philippe Oechslin:
Application REQuested IP over ATM (AREQUIPA). RFC 2170: 1-10 (1997) - 1996
- [j2]Stefan Leue, Philippe Oechslin:
OpParIm: A method and tool for optimized parallel protocol implementation. J. High Speed Networks 5(2): 125-143 (1996) - [j1]Stefan Leue, Philippe Oechslin:
On parallelizing and optimizing the implementation of communication protocols. IEEE/ACM Trans. Netw. 4(1): 55-70 (1996) - 1994
- [c2]Stefan Leue, Philippe Oechslin:
Formalizations and algorithms for optimized parallel protocol implementation. ICNP 1994: 178-185 - [c1]Stefan Leue, Philippe Oechslin:
From SDL specifications to optimized parallel protocol implementations. Protocols for High-Speed Networks 1994: 308-327
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: