![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Henrik Brosenne
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
- [c6]Saleh Al-shadly, Omar Alfandi
, Henrik Brosenne, Dieter Hogrefe:
Security Verification of Trust-Based Authentication Handover in IP Networks. ICCCN 2011: 1-6
2000 – 2009
- 2008
- [c5]Patryk Chamuczynski, Omar Alfandi
, Constantin Werner, Henrik Brosenne, Dieter Hogrefe:
Performance Study of PANA Pre-authentication for Interdomain Handover. ICNS 2008: 79-83 - [c4]Omar Alfandi
, Henrik Brosenne, Constantin Werner, Dieter Hogrefe:
Fast Re-Authentication for Inter-Domain Handover using Context Transfer. ICOIN 2008: 1-5 - [c3]Patryk Chamuczynski, Omar Alfandi
, Henrik Brosenne, Constantin Werner, Dieter Hogrefe:
Enabling Pervasiveness by Seamless Inter-domain Handover: Performance Study of PANA Pre-authentication. PerCom 2008: 372-376 - 2007
- [j3]Henrik Brosenne, Carsten Damm
, Matthias Homeister, Stephan Waack:
On approximation by XOR-OBDDs. Inf. Process. Lett. 102(1): 17-21 (2007) - 2006
- [b1]Henrik Brosenne:
Obere und untere Schranken für eingeschränkte Parity-Branchingprogramme. University of Göttingen, 2006 - [j2]Henrik Brosenne, Matthias Homeister, Stephan Waack:
Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance. Inf. Process. Lett. 98(1): 6-10 (2006) - 2003
- [c2]Henrik Brosenne, Matthias Homeister, Stephan Waack:
Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs. MFCS 2003: 290-299 - 2002
- [j1]Henrik Brosenne, Matthias Homeister, Stephan Waack:
Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs. RAIRO Theor. Informatics Appl. 36(3): 229-247 (2002) - 2001
- [c1]Henrik Brosenne, Matthias Homeister, Stephan Waack:
Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds. MFCS 2001: 212-223
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint