Sebastian Berndt

Author’s Email
Author’s Website

Applied Filters

Sebastian Berndt
AuthorRemove filter

Clear all

People

Colleagues

Thomas R Eisenbarth (6)
Klaus Jansen (5)
Maciej Liškiewicz (4)
Jan Wichelmann (3)
Claudius Pott (2)
Kilian Grage (2)
Matthias Lutter (2)
Okan Seker (2)
Pascal Bemmann (2)
Rüdiger Reischuk (2)
Asaf Levin (1)
Kim Manuel Klein (1)
Leah Epstein (1)
Marten Maack (1)
Matthias Mnich (1)
Nicole Megow (1)
Rongmao Chen (1)
Sebastian Faust (1)
Tibor Jager (1)

Publication

Journal/Magazine Names

Information and Computation (1)
Journal of Computer and System Sciences (1)
Mathematical Programming: Series A and B (1)
Operations Research Letters (1)

Proceedings/Book Names

AAAI'17: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (1)
Advances in Cryptology – CRYPTO 2023 (1)
Algorithms and Data Structures (1)
Applied Cryptography and Network Security (1)
Applied Cryptography and Network Security (1)
Approximation and Online Algorithms (1)
ASIA CCS '22: Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security (1)
CCS '17: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (1)
CCS '20: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security (1)
CCS '21: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security (1)
Connecting with Computability (1)
Detection of Intrusions and Malware, and Vulnerability Assessment (1)
IH&MMSec '16: Proceedings of the 4th ACM Workshop on Information Hiding and Multimedia Security (1)
SOFSEM 2021: Theory and Practice of Computer Science (1)
SOFSEM 2024: Theory and Practice of Computer Science (1)

Content Type

Research Article (8)
Rapid Communication (1)

Publisher

Springer-Verlag (10)
Association for Computing Machinery (5)
Academic Press, Inc. (2)
AAAI Press (1)
Elsevier Science Publishers B. V. (1)

Publication Date

Upon changing this filter the page will automatically refresh

Past 5 years
Past 2 years
Past year

Export Citations

Select Citation format

Please download or close your previous search result export first before starting a new bulk export.
Preview is not available.
By clicking download,a status dialog will open to start the export process. The process may takea few minutes but once it finishes a file will be downloadable from your browser. You may continue to browse the DL while the export process is in progress.
Download
- Download citation
- Copy citation

Publications

19 Results for: Author: Sebastian BerndtEdit SearchSave SearchFailed to save your search, try again laterSearch has been saved (My Saved Searches)

Save this search

Please login to be able to save your searches and receive alerts for new content matching your search criteria.

Searched The ACM Guide to Computing Literature (3,800,517 records)|Limit your search to The ACM Full-Text Collection (770,264 records)

Results

Showing 1 - 19of19 Results

Filters

Select All

Export Citations Save to Binder

Save to Binder

Create a New Binder

Name

per page:

Sort by: Latest

Recency
Earliest
Most Downloaded
Most Cited

Article
Subversion-Resilient Signatures Without Random Oracles
- Pascal Bemmann
  https://ror.org/00613ak93Bergische Universität Wuppertal, Wuppertal, Germany
  ,
- Sebastian Berndt
  https://ror.org/00t3r8h32Universität zu Lübeck, Lübeck, Germany
  ,
- Rongmao Chen
  https://ror.org/05d2yfz11National University of Defense Technology, Changsha, China
Applied Cryptography and Network Security•March 2024, pp 351-375• https://doi.org/10.1007/978-3-031-54770-6_14
Abstract
In the aftermath of the Snowden revelations in 2013, concerns about the integrity and security of cryptographic systems have grown significantly. As adversaries with substantial resources might attempt to subvert cryptographic algorithms and ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
New Support Size Bounds and Proximity Bounds for Integer Linear Programming
- Sebastian Berndt
  https://ror.org/00t3r8h32University of Lübeck, Institute for Theoretical Computer Science, Lübeck, Germany
  ,
- Matthias Mnich
  Hamburg University of Technology, Institute for Algorithms and Complexity, Hamburg, Germany
  ,
- Tobias Stamm
  Hamburg University of Technology, Institute for Algorithms and Complexity, Hamburg, Germany
SOFSEM 2024: Theory and Practice of Computer Science•February 2024, pp 82-95• https://doi.org/10.1007/978-3-031-52113-3_6
Abstract
Integer linear programming (ILP) is a fundamental research paradigm in algorithms. Many modern algorithms to solve structured ILPs efficiently follow one of two main approaches. The first one is to prove a small upper bound on the support size of ...
$\sqrt{}$
$_{}$ $_{}$ $_{}$ $_{}$ $_{}$ $_{}$ $_{}$ $_{}$
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Combined Fault and Leakage Resilience: Composability, Constructions and Compiler
- Sebastian Berndt
  Institute for Theoretical Computer Science, University of Lübeck, Lübeck, Germany
  ,
- Thomas Eisenbarth
  Institute for IT Security, University of Lübeck, Lübeck, Germany
  ,
- Sebastian Faust
  TU Darmstadt, Darmstadt, Germany
  ,
- Marc Gourjon
  Hamburg University of Technology, Hamburg, Germany
  NXP Semiconductors, Hamburg, Germany
  ,
- Maximilian Orlt
  TU Darmstadt, Darmstadt, Germany
  ,
- Okan Seker
  NXP Semiconductors, Hamburg, Germany
Advances in Cryptology – CRYPTO 2023•August 2023, pp 377-409• https://doi.org/10.1007/978-3-031-38548-3_13
Abstract
Real-world cryptographic implementations nowadays are not only attacked via classical cryptanalysis but also via implementation attacks, including passive attacks (observing side-channel information about the inner computation) and active attacks (...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Subversion-Resilient Authenticated Encryption Without Random Oracles
- Pascal Bemmann
  https://ror.org/00613ak93Bergische Universität Wuppertal, Wuppertal, Germany
  ,
- Sebastian Berndt
  https://ror.org/00t3r8h32Universität zu Lübeck, Lübeck, Germany
  ,
- Denis Diemert
  https://ror.org/00613ak93Bergische Universität Wuppertal, Wuppertal, Germany
  ,
- Thomas Eisenbarth
  https://ror.org/00t3r8h32Universität zu Lübeck, Lübeck, Germany
  ,
- Tibor Jager
  https://ror.org/00613ak93Bergische Universität Wuppertal, Wuppertal, Germany
Applied Cryptography and Network Security•June 2023, pp 460-483• https://doi.org/10.1007/978-3-031-33491-7_17
Abstract
In 2013, the Snowden revelations have shown subversion of cryptographic implementations to be a relevant threat. Since then, the academic community has been pushing the development of models and constructions to defend against adversaries able to ...
1Citation
Metrics
Total Citations1
Export Citations
Save to Binder
research-article
Online bin covering with limited migration
- Sebastian Berndt
  Institute for Theoretical Computer Science, University of Lübeck, Lübeck, Germany
  ,
- Leah Epstein
  Department of Mathematics, University of Haifa, Mount Carmel, Haifa, Israel
  ,
- Klaus Jansen
  Department of Computer Science, Kiel University, Kiel, Germany
  ,
- Asaf Levin
  Faculty of Data and Decision Sciences, The Technion, Haifa, Israel
  ,
- Marten Maack
  Heinz Nixdorf Institute & Department of Computer Science, Paderborn University, Paderborn, Germany
  ,
- Lars Rohwedder
  School of Business and Economics, Maastricht University, Maastricht, the Netherlands
Journal of Computer and System Sciences, Volume 134, Issue C•Jun 2023, pp 42-72 • https://doi.org/10.1016/j.jcss.2023.01.001
Abstract
Semi-online models where decisions may be revoked in a limited way have been studied extensively in the last years. A well-studied measure of the amount of decisions that can be revoked is the (constant) migration factor. When an ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Learning residual alternating automata
- Sebastian Berndt
  Institut für Theoretische Informatik, Universität zu Lübeck, Ratzeburger Allee 160, 23562 Lübeck, Germany
  ,
- Maciej Liśkiewicz
  Institut für Theoretische Informatik, Universität zu Lübeck, Ratzeburger Allee 160, 23562 Lübeck, Germany
  ,
- Matthias Lutter
  Institut für Theoretische Informatik, Universität zu Lübeck, Ratzeburger Allee 160, 23562 Lübeck, Germany
  ,
- Rüdiger Reischuk
  Institut für Theoretische Informatik, Universität zu Lübeck, Ratzeburger Allee 160, 23562 Lübeck, Germany
Information and Computation, Volume 289, Issue PA•Nov 2022 • https://doi.org/10.1016/j.ic.2022.104981
Abstract
Residuality plays an essential role for learning finite automata. While residual deterministic and nondeterministic automata have been understood quite well, fundamental questions concerning alternating automata (AFA) remain open. ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Published By ACM
Published By ACM
ASAP: Algorithm Substitution Attacks on Cryptographic Protocols
- Sebastian Berndt
  University of Lübeck, Lübeck, Germany
  ,
- Jan Wichelmann
  University of Lübeck, Lübeck, Germany
  ,
- Claudius Pott
  University of Lübeck, Lübeck, Germany
  ,
- Tim-Henrik Traving
  University of Lübeck, Lübeck, Germany
  ,
- Thomas Eisenbarth
  University of Lübeck, Lübeck, Germany
ASIA CCS '22: Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security•May 2022, pp 712-726• https://doi.org/10.1145/3488932.3517387

The security of digital communication relies on few cryptographic protocols that are used to protect internet traffic, from web sessions to instant messaging. These protocols and the cryptographic primitives they rely on have been extensively studied ...
4Citation
175
Downloads
Metrics
Total Citations4
Total Downloads175
Last 12 Months35
Last 6 weeks5
1
Supplementary Material
ASIA-CCS22-fp419.mp4
Export Citations
Save to Binder
Get Access
rapid-communication
Online load balancing with general reassignment cost
- Sebastian Berndt
  Institute for IT Security, University of Lübeck, Germany
  ,
- Franziska Eberle
  Department of Mathematics, The London School of Economics and Political Science, UK
  ,
- Nicole Megow
  Faculty of Mathematics and Computer Science, University of Bremen, Germany
Operations Research Letters, Volume 50, Issue 3•May 2022, pp 322-328 • https://doi.org/10.1016/j.orl.2022.03.007
Abstract
We investigate a semi-online variant of load balancing with restricted assignment. In this problem, we are given n jobs, which need to be processed by m machines with the goal to minimize the maximum machine load. Since strong lower ...
2Citation
Metrics
Total Citations2
Export Citations
Save to Binder
research-article
Published By ACM
Published By ACM
Util::Lookup: Exploiting Key Decoding in Cryptographic Libraries
- Florian Sieck
  University of Lübeck, Lübeck, Germany
  ,
- Sebastian Berndt
  University of Lübeck, Lübeck, Germany
  ,
- Jan Wichelmann
  University of Lübeck, Lübeck, Germany
  ,
- Thomas Eisenbarth
  University of Lübeck, Lübeck, Germany
CCS '21: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security•November 2021, pp 2456-2473• https://doi.org/10.1145/3460120.3484783

Implementations of cryptographic libraries have been scrutinized for secret-dependent execution behavior exploitable by microarchitectural side-channel attacks. To prevent unintended leakages, most libraries moved to constant-time implementations of ...
5Citation
282
Downloads
Metrics
Total Citations5
Total Downloads282
Last 12 Months56
Last 6 weeks14
1
Supplementary Material
CCS21-fp410.mp4
Export Citations
Save to Binder
Get Access
Article
Help, My Signal has Bad Device!: Breaking the Signal Messenger’s Post-Compromise Security Through a Malicious Device
- Jan Wichelmann
  University of Lübeck, Lübeck, Germany
  ,
- Sebastian Berndt
  University of Lübeck, Lübeck, Germany
  ,
- Claudius Pott
  University of Lübeck, Lübeck, Germany
  ,
- Thomas Eisenbarth
  University of Lübeck, Lübeck, Germany
Detection of Intrusions and Malware, and Vulnerability Assessment•July 2021, pp 88-105• https://doi.org/10.1007/978-3-030-80825-9_5
Abstract
In response to ongoing discussions about data usage by companies and governments, and its implications for privacy, there is a growing demand for secure communication techniques. While during their advent, most messenger apps focused on features ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Robust Online Algorithms for Dynamic Choosing Problems
- Sebastian Berndt
  University of Lübeck, 23562, Lübeck, Germany
  ,
- Kilian Grage
  Kiel University, 24118, Kiel, Germany
  ,
- Klaus Jansen
  Kiel University, 24118, Kiel, Germany
  ,
- Lukas Johannsen
  Kiel University, 24118, Kiel, Germany
  ,
- Maria Kosche
  Göttingen University, 37073, Göttingen, Germany
Connecting with Computability•July 2021, pp 38-49• https://doi.org/10.1007/978-3-030-80049-9_4
Abstract
Semi-online algorithms that are allowed to perform a bounded amount of repacking achieve guaranteed good worst-case behaviour in a more realistic setting. Most of the previous works focused on minimization problems that aim to minimize some costs. ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs
- Sebastian Berndt
  Institute of IT Security, University of Lübeck, Lübeck, Germany
  ,
- Klaus Jansen
  Department of Computer Science, Kiel University, Kiel, Germany
  ,
- Alexandra Lassota
  Department of Computer Science, Kiel University, Kiel, Germany
SOFSEM 2021: Theory and Practice of Computer Science•January 2021, pp 349-360• https://doi.org/10.1007/978-3-030-67731-2_25
Abstract
We consider Integer Linear Programs (ILPs), where each variable corresponds to an integral point within a polytope $P \subseteq R^{d}$ , i. e., ILPs of the form $min {c^{⊤} x ∣ \sum_{p \in P \cap Z^{d}} x_{p} p = b, x \in Z_{\geq 0}^{| P \cap Z^{d} |}}$ . The distance between an optimal fractional solution and an optimal ... $^{}$ $^{}_{}$ $^{}$ $^{}$ $^{}$ $^{}_{}^{}$
$^{}$
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Published By ACM
Published By ACM
SNI-in-the-head: Protecting MPC-in-the-head Protocols against Side-channel Analysis
- Okan Seker
  University of Lübeck, Lübeck, Germany
  ,
- Sebastian Berndt
  University of Lübeck, Lübeck, Germany
  ,
- Luca Wilke
  University of Lübeck, Lübeck, Germany
  ,
- Thomas Eisenbarth
  University of Lübeck, Lübeck, Germany
CCS '20: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security•October 2020, pp 1033-1049• https://doi.org/10.1145/3372297.3417889

MPC-in-the-head based protocols have recently gained much popularity and are at the brink of seeing widespread usage. With widespread use come the spectres of implementation issues and implementation attacks such as side-channel attacks. We show that ...
3Citation
325
Downloads
Metrics
Total Citations3
Total Downloads325
Last 12 Months48
Last 6 weeks11
1
Supplementary Material
Copy of CCS2020_fpc488_OkanSeker - Brian Hollendyke.mov
Export Citations
Save to Binder
Get Access
research-article
Fully dynamic bin packing revisited
- Sebastian Berndt
  Kiel University, Kiel, Germany
  ,
- Klaus Jansen
  Kiel University, Kiel, Germany
  ,
- Kim-Manuel Klein
  EPFL, Lausanne, Switzerland
Mathematical Programming: Series A and B, Volume 179, Issue 1-2•Jan 2020, pp 109-155 • https://doi.org/10.1007/s10107-018-1325-x
Abstract
We consider the fully dynamic bin packing problem, where items arrive and depart in an online fashion and repacking of previously packed items is allowed. The goal is, of course, to minimize both the number of bins used as well as the amount of ... $^{}$
10Citation
Metrics
Total Citations10
Export Citations
Save to Binder
Article
Robust Online Algorithms for Certain Dynamic Packing Problems
- Sebastian Berndt
  Department of Computer Science, Kiel University, Kiel, Germany
  ,
- Valentin Dreismann
  University of Warwick, Coventry, UK
  ,
- Kilian Grage
  Department of Computer Science, Kiel University, Kiel, Germany
  ,
- Klaus Jansen
  Department of Computer Science, Kiel University, Kiel, Germany
  ,
- Ingmar Knof
  Department of Computer Science, Kiel University, Kiel, Germany
Approximation and Online Algorithms•September 2019, pp 43-59• https://doi.org/10.1007/978-3-030-39479-0_4
Abstract
Online algorithms that allow a small amount of migration or recourse have been intensively studied in the last years. They are essential in the design of competitive algorithms for dynamic problems, where objects can also depart from the instance. ...
2Citation
Metrics
Total Citations2
Export Citations
Save to Binder
Article
Positive-Instance Driven Dynamic Programming for Graph Searching
- Max Bannach
  Institute for Theoretical Computer Science, Universität zu Lübeck, Lübeck, Germany
  ,
- Sebastian Berndt
  Department of Computer Science, Kiel University, Kiel, Germany
Algorithms and Data Structures•August 2019, pp 43-56• https://doi.org/10.1007/978-3-030-24766-9_4
Abstract
Research on the similarity of a graph to being a tree – called the treewidth of the graph – has seen an enormous rise within the last decade, but a practically fast algorithm for this task has been discovered only recently by Tamaki (ESA 2017). It ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Published By ACM
Published By ACM
Algorithm Substitution Attacks from a Steganographic Perspective
- Sebastian Berndt
  University of Lübeck, Lübeck, Germany
  ,
- Maciej Liśkiewicz
  University of Lübeck, Lübeck, Germany
CCS '17: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security•October 2017, pp 1649-1660• https://doi.org/10.1145/3133956.3133981

The goal of an algorithm substitution attack (ASA), also called a subversion attack (SA), is to replace an honest implementation of a cryptographic tool by a subverted one which allows to leak private information while generating output indistinguishable ...
22Citation
324
Downloads
Metrics
Total Citations22
Total Downloads324
Last 12 Months18
Last 6 weeks3
1
Supplementary Material
maciejliskiewicz-algorithmsubstitution.mp4
Export Citations
Save to Binder
Get Access
Article
Learning residual alternating automata
- Sebastian Berndt
  Institute for Theoretical Computer Science, University of Lübeck, Lübeck, Germany
  ,
- Maciej Liśkiewicz
  Institute for Theoretical Computer Science, University of Lübeck, Lübeck, Germany
  ,
- Matthias Lutter
  Institute for Theoretical Computer Science, University of Lübeck, Lübeck, Germany
  ,
- Rüdiger Reischuk
  Institute for Theoretical Computer Science, University of Lübeck, Lübeck, Germany
AAAI'17: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence•February 2017, pp 1749-1755

Residuality plays an essential role for learning finite automata. While residual deterministic and non-deterministic automata have been understood quite well, fundamental questions concerning alternating automata (AFA) remain open. Recently, Angluin, ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Published By ACM
Published By ACM
Provable Secure Universal Steganography of Optimal Rate: Provably Secure Steganography does not Necessarily Imply One-Way Functions
- Sebastian Berndt
  University of Lübeck, Lübeck, Germany
  ,
- Maciej Liśkiewicz
  University of Lübeck, Lübeck, Germany
IH&MMSec '16: Proceedings of the 4th ACM Workshop on Information Hiding and Multimedia Security•June 2016, pp 81-92• https://doi.org/10.1145/2909827.2930796

We present the first complexity-theoretic secure steganographic protocol which, for any communication channel, is provably secure, reliable, and has nearly optimal bandwidth. Our system is unconditionally secure, i.e. our proof does not rely on any ...
5Citation
205
Downloads
Metrics
Total Citations5
Total Downloads205
Last 12 Months12
Export Citations
Save to Binder
Get Access

Author Profile Pages

Description: The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM bibliographic database, the Guide. Coverage of ACM publications is comprehensive from the 1950's. Coverage of other publishers generally starts in the mid 1980's. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community.
Please see the following 2007 Turing Award winners' profiles as examples:
History: Disambiguation of author names is of course required for precise identification of all the works, and only those works, by a unique individual. Of equal importance to ACM, author name normalization is also one critical prerequisite to building accurate citation and download statistics. For the past several years, ACM has worked to normalize author names, expand reference capture, and gather detailed usage statistics, all intended to provide the community with a robust set of publication metrics. The Author Profile Pages reveal the first result of these efforts.
Normalization: ACM uses normalization algorithms to weigh several types of evidence for merging and splitting names.
These include:
- co-authors: if we have two names and cannot disambiguate them based on name alone, then we see if they have a co-author in common. If so, this weighs towards the two names being the same person.
- affiliations: names in common with same affiliation weighs toward the two names being the same person.
- publication title: names in common whose works are published in same journal weighs toward the two names being the same person.
- keywords: names in common whose works address the same subject matter as determined from title and keywords, weigh toward being the same person.
The more conservative the merging algorithms, the more bits of evidence are required before a merge is made, resulting in greater precision but lower recall of works for a given Author Profile. Many bibliographic records have only author initials. Many names lack affiliations. With very common family names, typical in Asia, more liberal algorithms result in mistaken merges.

Automatic normalization of author names is not exact. Hence it is clear that manual intervention based on human knowledge is required to perfect algorithmic results. ACM is meeting this challenge, continuing to work to improve the automated merges by tweaking the weighting of the evidence in light of experience.
Bibliometrics: In 1926, Alfred Lotka formulated his power law (known as Lotka's Law) describing the frequency of publication by authors in a given field. According to this bibliometric law of scientific productivity, only a very small percentage (~6%) of authors in a field will produce more than 10 articles while the majority (perhaps 60%) will have but a single article published. With ACM's first cut at author name normalization in place, the distribution of our authors with 1, 2, 3..n publications does not match Lotka's Law precisely, but neither is the distribution curve far off. For a definition of ACM's first set of publication statistics, see Bibliometrics
Future Direction: The initial release of the Author Edit Screen is open to anyone in the community with an ACM account, but it is limited to personal information. An author's photograph, a Home Page URL, and an email may be added, deleted or edited. Changes are reviewed before they are made available on the live site.
ACM will expand this edit facility to accommodate more types of data and facilitate ease of community participation with appropriate safeguards. In particular, authors or members of the community will be able to indicate works in their profile that do not belong there and merge others that do belong but are currently missing.

A direct search interface for Author Profiles will be built.

An institutional view of works emerging from their faculty and researchers will be provided along with a relevant set of metrics.

It is possible, too, that the Author Profile page may evolve to allow interested authors to upload unpublished professional materials to an area available for search and free educational use, but distinct from the ACM Digital Library proper. It is hard to predict what shape such an area for user-generated content may take, but it carries interesting potential for input from the community.

Bibliometrics

The ACM DL is a comprehensive repository of publications from the entire field of computing.

It is ACM's intention to make the derivation of any publication statistics it generates clear to the user.

Average citations per article = The total Citation Count divided by the total Publication Count.
Citation Count = cumulative total number of times all authored works by this author were cited by other works within ACM's bibliographic database. Almost all reference lists in articles published by ACM have been captured. References lists from other publishers are less well-represented in the database. Unresolved references are not included in the Citation Count. The Citation Count is citations TO any type of work, but the references counted are only FROM journal and proceedings articles. Reference lists from books, dissertations, and technical reports have not generally been captured in the database. (Citation Counts for individual works are displayed with the individual record listed on the Author Page.)
Publication Count = all works of any genre within the universe of ACM's bibliographic database of computing literature of which this person was an author. Works where the person has role as editor, advisor, chair, etc. are listed on the page but are not part of the Publication Count.
Publication Years = the span from the earliest year of publication on a work by this author to the most recent year of publication of a work by this author captured within the ACM bibliographic database of computing literature (The ACM Guide to Computing Literature, also known as "the Guide".
Available for download = the total number of works by this author whose full texts may be downloaded from an ACM full-text article server. Downloads from external full-text sources linked to from within the ACM bibliographic space are not counted as 'available for download'.
Average downloads per article = The total number of cumulative downloads divided by the number of articles (including multimedia objects) available for download from ACM's servers.
Downloads (cumulative) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server since the downloads were first counted in May 2003. The counts displayed are updated monthly and are therefore 0-31 days behind the current date. Robotic activity is scrubbed from the download statistics.
Downloads (12 months) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 12-month period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (12-month download counts for individual works are displayed with the individual record.)
Downloads (6 weeks) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 6-week period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (6-week download counts for individual works are displayed with the individual record.)

ACM Author-Izer Service

Summary Description

ACM Author-Izer is a unique service that enables ACM authors to generate and post links on both their homepage and institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge.

Downloads from these sites are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to definitive version of ACM articles should reduce user confusion over article versioning.

ACM Author-Izer also extends ACM’s reputation as an innovative “Green Path” publisher, making ACM one of the first publishers of scholarly works to offer this model to its authors.

To access ACM Author-Izer, authors need to establish a free ACM web account. Should authors change institutions or sites, they can utilize the new ACM service to disable old links and re-authorize new links for free downloads from a different site.

How ACM Author-Izer Works

Authors may post ACM Author-Izer links in their own bibliographies maintained on their website and their own institution’s repository. The links take visitors to your page directly to the definitive version of individual articles inside the ACM Digital Library to download these articles for free.

The Service can be applied to all the articles you have ever published with ACM.

Depending on your previous activities within the ACM DL, you may need to take up to three steps to use ACM Author-Izer.

For authors who do not have a free ACM Web Account:

Go to the ACM DL http://dl.acm.org/ and click SIGN UP. Once your account is established, proceed to next step.

For authors who have an ACM web account, but have not edited their ACM Author Profile page:

Sign in to your ACM web account and go to your Author Profile page. Click "Add personal information" and add photograph, homepage address, etc. Click ADD AUTHOR INFORMATION to submit change. Once you receive email notification that your changes were accepted, you may utilize ACM Author-izer.

For authors who have an account and have already edited their Profile Page:

Sign in to your ACM web account, go to your Author Profile page in the Digital Library, look for the ACM Author-izer link below each ACM published article, and begin the authorization process. If you have published many ACM articles, you may find a batch Authorization process useful. It is labeled: "Export as: ACM Author-Izer Service"

ACM Author-Izer also provides code snippets for authors to display download and citation statistics for each “authorized” article on their personal pages. Downloads from these pages are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to the definitive version of ACM articles should reduce user confusion over article versioning.

Note: You still retain the right to post your author-prepared preprint versions on your home pages and in your institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library. But any download of your preprint versions will not be counted in ACM usage statistics. If you use these AUTHOR-IZER links instead, usage by visitors to your page will be recorded in the ACM Digital Library and displayed on your page.

FAQ

Q. What is ACM Author-Izer?
A. ACM Author-Izer is a unique, link-based, self-archiving service that enables ACM authors to generate and post links on either their home page or institutional repository for visitors to download the definitive version of their articles for free.
Q. What articles are eligible for ACM Author-Izer?
A. ACM Author-Izer can be applied to all the articles authors have ever published with ACM. It is also available to authors who will have articles published in ACM publications in the future.

Q. Are there any restrictions on authors to use this service?
A. No. An author does not need to subscribe to the ACM Digital Library nor even be a member of ACM.

Q. What are the requirements to use this service?
A. To access ACM Author-Izer, authors need to have a free ACM web account, must have an ACM Author Profile page in the Digital Library, and must take ownership of their Author Profile page.

Q. What is an ACM Author Profile Page?
A. The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM Digital Library. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community. Please visit the ACM Author Profile documentation page for more background information on these pages.

Q. How do I find my Author Profile page and take ownership?
A. You will need to take the following steps:
- Create a free ACM Web Account
- Sign-In to the ACM Digital Library
- Find your Author Profile Page by searching the ACM Digital Library for your name
- Find the result you authored (where your author name is a clickable link)
- Click on your name to go to the Author Profile Page
- Click the "Add Personal Information" link on the Author Profile Page
- Wait for ACM review and approval; generally less than 24 hours

Q. Why does my photo not appear?
A. Make sure that the image you submit is in .jpg or .gif format and that the file name does not contain special characters

Q. What if I cannot find the Add Personal Information function on my author page?
A. The ACM account linked to your profile page is different than the one you are logged into. Please logout and login to the account associated with your Author Profile Page.

Q. What happens if an author changes the location of his bibliography or moves to a new institution?
A. Should authors change institutions or sites, they can utilize ACM Author-Izer to disable old links and re-authorize new links for free downloads from a new location.

Q. What happens if an author provides a URL that redirects to the author’s personal bibliography page?
A. The service will not provide a free download from the ACM Digital Library. Instead the person who uses that link will simply go to the Citation Page for that article in the ACM Digital Library where the article may be accessed under the usual subscription rules.

However, if the author provides the target page URL, any link that redirects to that target page will enable a free download from the Service.

Q. What happens if the author’s bibliography lives on a page with several aliases?
A. Only one alias will work, whichever one is registered as the page containing the author’s bibliography. ACM has no technical solution to this problem at this time.

Q. Why should authors use ACM Author-Izer?
A. ACM Author-Izer lets visitors to authors’ personal home pages download articles for no charge from the ACM Digital Library. It allows authors to dynamically display real-time download and citation statistics for each “authorized” article on their personal site.

Q. Does ACM Author-Izer provide benefits for authors?
A. Downloads of definitive articles via Author-Izer links on the authors’ personal web page are captured in official ACM statistics to more accurately reflect usage and impact measurements.

Authors who do not use ACM Author-Izer links will not have downloads from their local, personal bibliographies counted. They do, however, retain the existing right to post author-prepared preprint versions on their home pages or institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library.

Q. How does ACM Author-Izer benefit the computing community?
A. ACM Author-Izer expands the visibility and dissemination of the definitive version of ACM articles. It is based on ACM’s strong belief that the computing community should have the widest possible access to the definitive versions of scholarly literature. By linking authors’ personal bibliography with the ACM Digital Library, user confusion over article versioning should be reduced over time.

In making ACM Author-Izer a free service to both authors and visitors to their websites, ACM is emphasizing its continuing commitment to the interests of its authors and to the computing community in ways that are consistent with its existing subscription-based access model.

Q. How do authors access ACM Author-Izer?
A. See How to Use

Q. Why can’t I find my most recent publication in my ACM Author Profile Page?
A. There is a time delay between publication and the process which associates that publication with an Author Profile Page. Right now, that process usually takes 4-8 weeks.

Q. How does ACM Author-Izer expand ACM’s “Green Path” Access Policies?
A. ACM Author-Izer extends the rights and permissions that authors retain even after copyright transfer to ACM, which has been among the “greenest” publishers. ACM enables its author community to retain a wide range of rights related to copyright and reuse of materials. They include:
- Posting rights that ensure free access to their work outside the ACM Digital Library and print publications
- Rights to reuse any portion of their work in new works that they may create
- Copyright to artistic images in ACM’s graphics-oriented publications that authors may want to exploit in commercial contexts
- All patent rights, which remain with the original owner

Sebastian Berndt