default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSebastian Egner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2005
[j12]Marten van Dijk
, Sebastian Egner, Marcus Greferath, Alfred Wassermann:
On two doubly even self-dual binary codes of length 160 and minimum weight 24. IEEE Trans. Inf. Theory 51(1): 408-411 (2005)- [j11]Sidharth Jaggi, Peter Sanders, Philip A. Chou, Michelle Effros, Sebastian Egner, Kamal Jain, Ludo M. G. M. Tolhuizen:
Polynomial time algorithms for multicast network code construction. IEEE Trans. Inf. Theory 51(6): 1973-1982 (2005) - 2004
- [j10]Sebastian Egner, Markus Püschel:
Symmetry-based matrix factorization. J. Symb. Comput. 37(2): 157-186 (2004) - [c5]Sebastian Egner, Vladimir B. Balakirsky, Ludo Tolhuizen, Stan Baggen, Henk D. L. Hollmann:
On the entropy rate of a hidden Markov model. ISIT 2004: 12 - 2003
- [j9]Peter Sanders, Sebastian Egner, Jan H. M. Korst:
Fast Concurrent Access to Parallel Disks. Algorithmica 35(1): 21-55 (2003) - [j8]Marten van Dijk, Sebastian Egner, Ravi Motwani, Arie G. C. Koppelaar:
Simultaneous zero-tailing of parallel concatenated codes. IEEE Trans. Inf. Theory 49(9): 2236-2241 (2003) - [c4]Peter Sanders, Sebastian Egner, Ludo M. G. M. Tolhuizen:
Polynomial time algorithms for network information flow. SPAA 2003: 286-294 - 2002
- [j7]Gary L. Ebert, Sebastian Egner, Henk D. L. Hollmann, Qing Xiang:
Proof of a Conjecture of De Caen and Van Dam. Eur. J. Comb. 23(2): 201-206 (2002) - 2001
- [j6]Gary L. Ebert, Sebastian Egner, Henk D. L. Hollmann, Qing Xiang:
A Four-Class Association Scheme. J. Comb. Theory A 96(1): 180-191 (2001) - [j5]Sebastian Egner, Markus Püschel:
Automatic generation of fast discrete signal transforms. IEEE Trans. Signal Process. 49(9): 1992-2002 (2001) - 2000
- [j4]Joep Aerts, Jan H. M. Korst, Sebastian Egner:
Random duplicate storage strategies for load balancing in multimedia servers. Inf. Process. Lett. 76(1-2): 51-59 (2000) - [c3]Peter Sanders, Sebastian Egner, Jan H. M. Korst:
Fast concurrent access to parallel disks. SODA 2000: 849-858
1990 – 1999
- 1999
- [j3]Sebastian Egner, Thomas Beth:
How to Play M13? Des. Codes Cryptogr. 16(3): 243-247 (1999) - 1998
- [j2]Sebastian Egner, Torsten Minkwitz:
Sparsification of Rectangualr Matrices. J. Symb. Comput. 26(2): 135-149 (1998) - [c2]Sebastian Egner, Markus Püschel:
Solving Puzzles Related to Permutation Groups. ISSAC 1998: 186-193 - 1997
- [b1]Sebastian Egner:
Zur algorithmischen Zerlegungstheorie linearer Transformationen mit Symmetrie. Universität Karlsruhe, 1997, pp. 1-126 - [c1]Sebastian Egner, Markus Püschel, Thomas Beth:
Decomposing a Permutation into a Conjugated Tensor Product. ISSAC 1997: 101-108 - 1996
- [j1]Sebastian Egner:
Semi-numerical solution to 6/6-Stewart-platform kinematics based on symmetry. Appl. Algebra Eng. Commun. Comput. 7(6): 449-468 (1996)
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-06-10 20:24 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:
