Berthold Vöcking
Applied Filters
- Berthold Vöcking
- AuthorRemove filter
People
Colleagues
- Berthold Vöcking (98)
- Heiko Röglin (20)
- Heiner Ackermann (13)
- Thomas Keßelheim (13)
- Martin Hoefer (10)
- Simon Fischer (9)
- Artur Czumaj (8)
- Alexander Fanghänel (7)
- Friedhelm Meyer Auf der Heide (7)
- Piotr Krysta (7)
- René Meier (7)
- Harald Räcke (6)
- Paul W Goldberg (5)
- Vahab Seyed Mirrokni (5)
- Christian Scheideler (4)
- Matthias Englert (4)
- Patrick Briest (4)
- Bruce MacDowell Maggs (3)
- Matthias Westermann (3)
- Rene Beier (3)
Roles
Publication
Journal/Magazine Names
- SIAM Journal on Computing (8)
- Theoretical Computer Science (6)
- ACM Transactions on Algorithms (3)
- Mathematical Programming: Series A and B (3)
- Algorithmica (2)
- Combinatorics, Probability and Computing (2)
- Journal of the ACM (2)
- ACM SIGecom Exchanges (1)
- ACM Transactions on Computation Theory (1)
- ACM Transactions on Economics and Computation (1)
- ACM Transactions on Internet Technology (1)
- Distributed Computing (1)
- Journal of Algorithms (1)
- Journal of Computer and System Sciences (1)
- Journal of Scheduling (1)
- Networks (1)
Proceedings/Book Names
- ICALP'12: Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II (3)
- EC '13: Proceedings of the fourteenth ACM conference on Electronic commerce (2)
- Internet and Network Economics (2)
- SODA '04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms (2)
- WINE'07: Proceedings of the 3rd international conference on Internet and network economics (2)
- EC '08: Proceedings of the 9th ACM conference on Electronic commerce (1)
- EC '15: Proceedings of the Sixteenth ACM Conference on Economics and Computation (1)
- PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing (1)
- PODC '09: Proceedings of the 28th ACM symposium on Principles of distributed computing (1)
- PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing (1)
- SPAA '10: Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures (1)
- SPAA '11: Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures (1)
- SPAA '96: Proceedings of the eighth annual ACM symposium on Parallel Algorithms and Architectures (1)
- STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (1)
- STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (1)
- STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (1)
- STOC '08: Proceedings of the fortieth annual ACM symposium on Theory of computing (1)
- STOC '14: Proceedings of the forty-sixth annual ACM symposium on Theory of computing (1)
- STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing (1)
- STOC '97: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing (1)
Publisher
- Association for Computing Machinery (34)
- Springer-Verlag (30)
- Society for Industrial and Applied Mathematics (14)
- Elsevier Science Publishers Ltd. (6)
- IEEE Computer Society (3)
- Academic Press, Inc. (2)
- Cambridge University Press (2)
- Springer Publishing Company, Incorporated (2)
- AAAI Press (1)
- European Design and Automation Association (1)
- IEEE Press (1)
- Kluwer Academic Publishers (1)
- Wiley-Interscience (1)
Publication Date
Export Citations
Publications
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- Article
A Unified Approach to Congestion Games and Two-Sided Markets
- Heiner Ackermann
Department of Computer Science, RWTH Aachen, Germany
, - Paul W. Goldberg
Department of Computer Science, University of Liverpool, U.K.
, - Vahab S. Mirrokni
Microsoft Research, Redmond, WA, USA
, - Heiko Röglin
Department of Computer Science, RWTH Aachen, Germany
, - Berthold Vöcking
Department of Computer Science, RWTH Aachen, Germany
Internet and Network Economics•December 2007, pp 30-41• https://doi.org/10.1007/978-3-540-77105-0_7AbstractCongestion games are a well-studied model for resource sharing among uncoordinated selfish agents. Usually, one assumes that the resources in a congestion game do not have any preferences over the players that can allocate them. In typical load ...
- 0Citation
MetricsTotal Citations0
- Heiner Ackermann
- Article
Who Should Pay for Forwarding Packets?
- Heiner Ackermann
Department of Computer Science, RWTH Aachen, Germany
, - Patrick Briest
Department of Computer Science, University of Liverpool, UK
, - Alexander Fanghänel
Department of Computer Science, RWTH Aachen, Germany
, - Berthold Vöcking
Department of Computer Science, RWTH Aachen, Germany
Internet and Network Economics•December 2007, pp 208-219• https://doi.org/10.1007/978-3-540-77105-0_21AbstractWe present a game theoretic study of hybrid communication networks in which mobile devices can connect in an ad hoc fashion to a base station, possibly via a few hops using other mobile devices as intermediate nodes. The maximal number of allowed ...
- 0Citation
MetricsTotal Citations0
- Heiner Ackermann
- research-article
The smoothed number of Pareto-optimal solutions in bicriteria integer optimization
- René Beier
Max-Planck-Institut für Informatik, Saarbrücken, Germany
, - Heiko Röglin
Department of Computer Science, University of Bonn, Bonn, Germany
, - Clemens Rösner
Department of Computer Science, University of Bonn, Bonn, Germany
, - Berthold Vöcking
Department of Computer Science, RWTH Aachen University, Aachen, Germany
Mathematical Programming: Series A and B, Volume 200, Issue 1•Jun 2023, pp 319-355 • https://doi.org/10.1007/s10107-022-01885-6AbstractA well-established heuristic approach for solving bicriteria optimization problems is to enumerate the set of Pareto-optimal solutions. The heuristics following this principle are often successful in practice. Their running time, however, depends ...
- 0Citation
MetricsTotal Citations0
- René Beier
- research-articlePublished By ACMPublished By ACM
Truthfulness and stochastic dominance with monetary transfers
- Martin Hoefer
Max-Planck-Institut für Informatik and Saarland University, Saarbrücken, Germany
, - Thomas Kesselheim
Cornell University, Ithaca, NY, USA
, - Berthold Vöcking
RWTH Aachen University, Aachen, Germany
EC '13: Proceedings of the fourteenth ACM conference on Electronic commerce•June 2013, pp 567-582• https://doi.org/10.1145/2482540.2482548We consider truthfulness concepts for auctions with payments based on first- and second-order stochastic dominance. We assume bidders consider wealth in standard quasi-linear form as valuation minus payments. Additionally, they are sensitive to risk in ...
- 4Citation
- 8
- Downloads
MetricsTotal Citations4Total Downloads8
- Martin Hoefer
- research-article
Primal Beats Dual on Online Packing LPs in the Random-Order Model
SIAM Journal on Computing, Volume 47, Issue 5, pp 1939-1964 • https://doi.org/10.1137/15M1033708We study packing linear programs (LPs) in an online model where the columns are presented to the algorithm in random order. This natural problem was investigated in various recent studies motivated, e.g., by online ad allocations and yield management, ...
- 7Citation
MetricsTotal Citations7
- article
Truthful mechanism design via correlated tree rounding
- Yossi Azar
Department of Computer Science, Tel Aviv University, Tel Aviv, Israel
, - Martin Hoefer
Max-Planck-Institut für Informatik and Saarland University, Saarbrücken, Germany
, - Idan Maor
Department of Computer Science, Tel Aviv University, Tel Aviv, Israel
, - Rebecca Reiffenhäuser
Department of Computer Science, RWTH Aachen University, Aachen, Germany
, - Berthold Vöcking
Department of Computer Science, RWTH Aachen University, Aachen, Germany
Mathematical Programming: Series A and B, Volume 163, Issue 1-2•May 2017, pp 445-469 • https://doi.org/10.1007/s10107-016-1068-5A powerful algorithmic technique for truthful mechanism design is the maximal-in-distributional-range (MIDR) paradigm. Unfortunately, many such algorithms use heavy algorithmic machinery, e.g., the ellipsoid method and (approximate) solution of convex ...
- 2Citation
MetricsTotal Citations2
- Yossi Azar
- research-articlePublished By ACMPublished By ACM
Smoothed Analysis of the 2-Opt Algorithm for the General TSP
- Matthias Englert
University of Warwick, Coventry, United Kingdom
, - Heiko Röglin
University of Bonn, Bonn, Germany
, - Berthold Vöcking
RWTH Aachen University, Aachen, Germany
ACM Transactions on Algorithms, Volume 13, Issue 1•January 2017, Article No.: 10, pp 1-15 • https://doi.org/10.1145/29729532-Opt is a simple local search heuristic for the traveling salesperson problem that performs very well in experiments with respect to both running time and solution quality. In contrast to this, there are instances on which 2-Opt may need an exponential ...
- 11Citation
- 312
- Downloads
MetricsTotal Citations11Total Downloads312Last 12 Months38Last 6 weeks3
- Matthias Englert
Algorithms Unplugged
Algorithms Unplugged presents some of the most beautiful algorithmic ideas in 41 articles written in colloquial, nontechnical language. Most of the articles arose out of an initiative among German-language universities to communicate the fascination of ...
- 0Citation
MetricsTotal Citations0
- research-articlePublished By ACMPublished By ACM
Truthfulness and Stochastic Dominance with Monetary Transfers
- Martin Hoefer
Max-Planck-Institut für Informatik and Saarland University, Saarbrücken, Germany
, - Thomas Kesselheim
Max-Planck-Institut für Informatik and Saarland University, Saarbrücken, Germany
, - Berthold Vöcking
RWTH Aachen University
ACM Transactions on Economics and Computation, Volume 4, Issue 2•February 2016, Article No.: 11, pp 1-18 • https://doi.org/10.1145/2847522We consider truthfulness concepts for auctions with payments based on first- and second-order stochastic dominance. We assume bidders consider wealth in standard quasilinear form as valuation minus payments. Additionally, they are sensitive to risk in ...
- 0Citation
- 123
- Downloads
MetricsTotal Citations0Total Downloads123Last 12 Months4Last 6 weeks1
- Martin Hoefer
- research-articlePublished By ACMPublished By ACM
Truthful Mechanism Design via Correlated Tree Rounding
- Yossi Azar
Tel-Aviv University, Tel-Aviv, Israel
, - Martin Hoefer
Max-Planck-Institut für Informatik, Saarbrücken, Germany
, - Idan Maor
Tel-Aviv University, Tel-Aviv, Israel
, - Rebecca Reiffenhäuser
RWTH Aachen University, Aachen, Germany
, - Berthold Vöcking
RWTH Aachen University, Aachen, Germany
EC '15: Proceedings of the Sixteenth ACM Conference on Economics and Computation•June 2015, pp 415-432• https://doi.org/10.1145/2764468.2764503One of the most powerful algorithmic techniques for truthful mechanism design are maximal-in-distributional-range (MIDR) mechanisms. Unfortunately, many algorithms using this paradigm rely on heavy algorithmic machinery and require the ellipsoid method ...
- 2Citation
- 121
- Downloads
MetricsTotal Citations2Total Downloads121Last 12 Months3
- Yossi Azar
- research-article
Comparative study of approximation algorithms and heuristics for SINR scheduling with power control
- Lukas Belke
Department of Computer Science, RWTH Aachen University, Germany
, - Thomas Kesselheim
Department of Computer Science, Cornell University, USA
, - Arie M.C.A. Koster
Lehrstuhl II für Mathematik, RWTH Aachen University, Germany
, - Berthold Vöcking
Department of Computer Science, RWTH Aachen University, Germany
Theoretical Computer Science, Volume 553, Issue C•October, 2014, pp 64-73 • https://doi.org/10.1016/j.tcs.2014.05.014Various recent theoretical studies have achieved considerable progress in understanding combined link scheduling and power control in wireless networks with SINR constraints. These analyses were mainly focused on designing and analyzing approximation ...
- 1Citation
MetricsTotal Citations1
- Lukas Belke
- research-articlePublished By ACMPublished By ACM
Approximation Algorithms for Secondary Spectrum Auctions
- Martin Hoefer
Max-Planck-Institut für Informatik and Saarland University, Saarbrucken, Germany
, - Thomas Kesselheim
Cornell University, Ithaca, NY
, - Berthold Vöcking
RWTH Aachen University, Aachen, Germany
ACM Transactions on Internet Technology, Volume 14, Issue 2-3•October 2014, Article No.: 16, pp 1-24 • https://doi.org/10.1145/2663496We study combinatorial auctions for secondary spectrum markets, where short-term communication licenses are sold to wireless nodes. Channels can be assigned to multiple bidders according to interference constraints captured by a conflict graph. We ...
- 20Citation
- 207
- Downloads
MetricsTotal Citations20Total Downloads207Last 12 Months9
- Martin Hoefer
- research-articlePublished By ACMPublished By ACM
Primal beats dual on online packing LPs in the random-order model
- Thomas Kesselheim
Cornell University, Ithaca, NY
, - Andreas Tönnis
RWTH Aachen University, Germany
, - Klaus Radke
RWTH Aachen University, Germany
, - Berthold Vöcking
RWTH Aachen University, Germany
STOC '14: Proceedings of the forty-sixth annual ACM symposium on Theory of computing•May 2014, pp 303-312• https://doi.org/10.1145/2591796.2591810We study packing LPs in an online model where the columns are presented to the algorithm in random order. This natural problem was investigated in various recent studies motivated, e.g., by online ad allocations and yield management where rows ...
- 51Citation
- 535
- Downloads
MetricsTotal Citations51Total Downloads535Last 12 Months27Last 6 weeks2- 1
Supplementary Materialp303-sidebyside.mp4
- Thomas Kesselheim
- research-article
Optimized buffer allocation in multicore platforms
- Maximilian Odendahl
RWTH Aachen University, Aachen, Germany
, - Andrés Goens
RWTH Aachen University, Aachen, Germany
, - Rainer Leupers
RWTH Aachen University, Aachen, Germany
, - Gerd Ascheid
RWTH Aachen University, Aachen, Germany
, - Benjamin Ries
RWTH Aachen University, Aachen, Germany
, - Berthold Vöcking
RWTH Aachen University, Aachen, Germany
, - Tomas Henriksson
Huawei Technologies, Stockholm, Sweden
DATE '14: Proceedings of the conference on Design, Automation & Test in Europe•March 2014, Article No.: 324, pp 1-6With the availability of advanced MPSoC and emerging Dynamic RAM (DRAM) interface technologies, an optimal allocation of logical data buffers to physical memory cannot be handled manually anymore due to the huge design space. An allocation does not only ...
- 0Citation
- 71
- Downloads
MetricsTotal Citations0Total Downloads71Last 12 Months1
- Maximilian Odendahl
- research-articlePublished By ACMPublished By ACM
Economical Caching
- Matthias Englert
University of Warwick
, - Heiko Röglin
University of Bonn
, - Jacob Spönemann
RWTH Aachen University
, - Berthold Vöcking
RWTH Aachen University
ACM Transactions on Computation Theory, Volume 5, Issue 2•July 2013, Article No.: 4, pp 1-21 • https://doi.org/10.1145/2493246.2493247We study the management of buffers and storages in environments with unpredictably varying prices in a competitive analysis. In the economical caching problem, there is a storage with a certain capacity. For each time step, an online algorithm is given ...
- 2Citation
- 193
- Downloads
MetricsTotal Citations2Total Downloads193Last 12 Months1
- Matthias Englert
- research-articlePublished By ACMPublished By ACM
Truthfulness and stochastic dominance with monetary transfers
- Martin Hoefer
Max-Planck-Institut für Informatik and Saarland University, Saarbrücken, Germany
, - Thomas Kesselheim
Cornell University, Ithaca, NY, USA
, - Berthold Vöcking
RWTH Aachen University, Aachen, Germany
EC '13: Proceedings of the fourteenth ACM conference on Electronic commerce•June 2013, pp 567-582• https://doi.org/10.1145/2492002.2482548We consider truthfulness concepts for auctions with payments based on first- and second-order stochastic dominance. We assume bidders consider wealth in standard quasi-linear form as valuation minus payments. Additionally, they are sensitive to risk in ...
- 4Citation
- 87
- Downloads
MetricsTotal Citations4Total Downloads87Last 12 Months1
- Martin Hoefer
- article
Online capacity maximization in wireless networks
- Alexander Fanghänel
Dept. of Computer Science, RWTH Aachen University, Aachen, Germany
, - Sascha Geulen
Dept. of Computer Science, RWTH Aachen University, Aachen, Germany
, - Martin Hoefer
Dept. of Computer Science, RWTH Aachen University, Aachen, Germany
, - Berthold Vöcking
Dept. of Computer Science, RWTH Aachen University, Aachen, Germany
Journal of Scheduling, Volume 16, Issue 1•February 2013, pp 81-91 • https://doi.org/10.1007/s10951-011-0227-zIn this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points in Euclidean space of constant dimension d arrive iteratively over time. ...
- 3Citation
MetricsTotal Citations3
- Alexander Fanghänel
- Article
Randomized mechanisms for multi-unit auctions
- Berthold Vöcking
Department of Computer Science, RWTH Aachen University, Germany
ICALP'12: Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II•July 2012, pp 27-29• https://doi.org/10.1007/978-3-642-31585-5_6Combinatorial auctions are a common abstraction of many complex resource allocation problems: A large number of items (goods, resources) should be assigned to a number of agents (bidders) with different valuations on bundles of items. They are the ...
- 0Citation
MetricsTotal Citations0
- Berthold Vöcking
- Article
Online packing with gradually improving capacity estimations and applications to network lifetime maximization
- Marcel Ochel
Department of Computer Science, RWTH Aachen University, Germany
, - Klaus Radke
Department of Computer Science, RWTH Aachen University, Germany
, - Berthold Vöcking
Department of Computer Science, RWTH Aachen University, Germany
ICALP'12: Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II•July 2012, pp 648-659• https://doi.org/10.1007/978-3-642-31585-5_57We introduce a general model for online packing problems with applications to lifetime optimization of wireless sensor networks. Classical approaches for lifetime maximization make the crucial assumption that battery capacities of sensor nodes are known ...
- 0Citation
MetricsTotal Citations0
- Marcel Ochel
- Article
Online mechanism design (randomized rounding on the fly)
- Piotr Krysta
Department of Computer Science, University of Liverpool, UK
, - Berthold Vöcking
Department of Computer Science, RWTH Aachen University, Germany
ICALP'12: Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II•July 2012, pp 636-647• https://doi.org/10.1007/978-3-642-31585-5_56We study incentive compatible mechanisms for combinatorial auctions (CAs) in an online model with sequentially arriving bidders, where the arrivals' order is either random or adversarial. The bidders' valuations are given by demand oracles. Previously ...
- 21Citation
MetricsTotal Citations21
- Piotr Krysta
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. 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