David Gamarnik
Applied Filters
- David Gamarnik
- AuthorRemove filter
People
Colleagues
- David Gamarnik (72)
- Dimitris J Bertsimas (7)
- John N Tsitsiklis (7)
- Dmitriy A Katz (5)
- Gregory Bret Sorkin (5)
- Itai Ashlagi (5)
- Ross Anderson (5)
- Devavrat D Shah (4)
- Don Coppersmith (4)
- Eren C Kízíldağ (4)
- Maxim I Sviridenko (4)
- Abraham D Flaxman (3)
- Alvin E Roth (3)
- David Alan Goldberg (3)
- M Utku Ünver (3)
- Martín Zubeldía (3)
- Michael A Rees (3)
- Tayfun Sönmez (3)
- Anton J Kleywegt (2)
- Edward J Anderson (2)
Roles
Publication
Journal/Magazine Names
- Random Structures & Algorithms (8)
- ACM SIGMETRICS Performance Evaluation Review (7)
- Operations Research (6)
- Mathematics of Operations Research (4)
- Queueing Systems: Theory and Applications (4)
- Interfaces (3)
- Combinatorica (1)
- Combinatorics, Probability and Computing (1)
- Discrete Applied Mathematics (1)
- IEEE Transactions on Information Theory (1)
- Journal of Algorithms (1)
- Journal of Computer and System Sciences (1)
- Journal of Discrete Algorithms (1)
- Machine Language (1)
- Operations Research Letters (1)
- SIAM Journal on Computing (1)
Proceedings/Book Names
- SODA '10: Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms (2)
- COLT '97: Proceedings of the tenth annual conference on Computational learning theory (1)
- COLT '99: Proceedings of the twelfth annual conference on Computational learning theory (1)
- COLT' 98: Proceedings of the eleventh annual conference on Computational learning theory (1)
- ITCS '14: Proceedings of the 5th conference on Innovations in theoretical computer science (1)
- NIPS'14: Proceedings of the 27th International Conference on Neural Information Processing Systems - Volume 1 (1)
- NIPS'14: Proceedings of the 27th International Conference on Neural Information Processing Systems - Volume 2 (1)
- NIPS'18: Proceedings of the 32nd International Conference on Neural Information Processing Systems (1)
- NIPS'19: Proceedings of the 33rd International Conference on Neural Information Processing Systems (1)
- SIGMETRICS '16: Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science (1)
- SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms (1)
- SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms (1)
- SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm (1)
- SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms (1)
- SODA '09: Proceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms (1)
- SODA '15: Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms (1)
- STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (1)
- STOC '10: Proceedings of the forty-second ACM symposium on Theory of computing (1)
- STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (1)
- WINE'06: Proceedings of the Second international conference on Internet and Network Economics (1)
Publisher
- Association for Computing Machinery (15)
- INFORMS (13)
- Society for Industrial and Applied Mathematics (12)
- John Wiley & Sons, Inc. (8)
- IEEE Press (5)
- J. C. Baltzer AG, Science Publishers (4)
- Elsevier Science Publishers B. V. (3)
- Academic Press, Inc. (2)
- Curran Associates Inc. (2)
- MIT Press (2)
- Springer-Verlag (2)
- Cambridge University Press (1)
- IEEE Computer Society (1)
- Kluwer Academic Publishers (1)
- Massachusetts Institute of Technology (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.
- research-article
Stability, Memory, and Messaging Trade-Offs in Heterogeneous Service Systems
- David Gamarnik
Operations Research Center, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139;
, - John N. Tsitsiklis
Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, Massachusetts, 02139;
, - Martin Zubeldia
Industrial and Systems Engineering Department, Georgia Institute of Technology, Atlanta, Georgia 30332
Mathematics of Operations Research, Volume 47, Issue 3•August 2022, pp 1862-1874 • https://doi.org/10.1287/moor.2021.1191We consider a heterogeneous distributed service system consisting of n servers with unknown and possibly different processing rates. Jobs with unit mean arrive as a renewal process of rate proportional to n and are immediately dispatched to one of several ...
- 0Citation
MetricsTotal Citations0
- David Gamarnik
- research-article
The Random Number Partitioning Problem: Overlap Gap Property and Algorithmic Barriers
2022 IEEE International Symposium on Information Theory (ISIT)•June 2022, pp 778-783• https://doi.org/10.1109/ISIT50566.2022.9834647We focus on the problem of algorithmically finding a near-optimal solution for the (random) number partitioning problem (NPP), a problem that is of great practical and theoretical significance. The NPP possesses a striking gap between the existential and ...
- 0Citation
MetricsTotal Citations0
- research-article
Self-Regularity of Output Weights for Overparameterized Two-Layer Neural Networks
- David Gamarnik
MIT
, - Eren C. Kızıldağ
MIT
, - Ilias Zadik
NYU
2021 IEEE International Symposium on Information Theory (ISIT)•July 2021, pp 819-824• https://doi.org/10.1109/ISIT45174.2021.9517811We consider the problem of finding a two-layer neural network with sigmoid, rectified linear unit, or binary step activation functions that “fits” a training data set as accurately as possible as quantified by the training error; and study ...
- 0Citation
MetricsTotal Citations0
- David Gamarnik
- research-article
Computing the Partition Function of the Sherrington-Kirkpatrick Model is Hard on Average
2020 IEEE International Symposium on Information Theory (ISIT)•June 2020, pp 2837-2842• https://doi.org/10.1109/ISIT44484.2020.9174373We establish the average-case hardness of the algorithmic problem of exactly computing the partition function of the Sherrington-Kirkpatrick model of spin glasses with Gaussian couplings. In particular, we establish that unless P=#P, there does not exist ...
- 0Citation
MetricsTotal Citations0
- research-articlefree
Sparse high-dimensional isotonic regression
- David Gamarnik
Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA
, - Julia Gaudio
Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA
NIPS'19: Proceedings of the 33rd International Conference on Neural Information Processing Systems•December 2019, Article No.: 1153, pp 12872-12882We consider the problem of estimating an unknown coordinate-wise monotone function given noisy measurements, known as the isotonic regression problem. Often, only a small subset of the features affects the output. This motivates the sparse isotonic ...
- 0Citation
- 51
- Downloads
MetricsTotal Citations0Total Downloads51Last 12 Months44Last 6 weeks21
- David Gamarnik
- research-article
High-Dimensional Linear Regression and Phase Retrieval via PSLQ Integer Relation Algorithm
2019 IEEE International Symposium on Information Theory (ISIT)•July 2019, pp 1437-1441• https://doi.org/10.1109/ISIT.2019.8849681We study high-dimensional linear regression problem without sparsity, and address the question of efficient recovery with small number of measurements. We propose an algorithm which efficiently recovers an unknown feature vector β<sup>∗</sup>...
- 0Citation
MetricsTotal Citations0
- Articlefree
High dimensional linear regression using lattice basis reduction
- David Gamarnik
Sloan School of Management, Massachussetts Institute of Technology, Cambridge, MA
, - Ilias Zadik
Operations Research Center, Massachussetts Institute of Technology, Cambridge, MA
NIPS'18: Proceedings of the 32nd International Conference on Neural Information Processing Systems•December 2018, pp 1847-1857We consider a high dimensional inear regression problem where the goal is to efficiently recover an unknown vector β* from n noisy linear observations Y = Xβ* + W ∈ ℝn, for known X ∈ ℝn×p and unknown W ∈ ℝn. Unlike most of the literature on this model ...
- 0Citation
- 42
- Downloads
MetricsTotal Citations0Total Downloads42Last 12 Months20Last 6 weeks6
- David Gamarnik
- research-article
Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics
- Patrick Eschenfeldt
Massachusetts Institute of Technology Operations Research Center, Cambridge, Massachusetts, 02139
, - David Gamarnik
Massachusetts Institute of Technology Sloan School of Management and Operations Research Center, Cambridge, Massachusetts 02139
Mathematics of Operations Research, Volume 43, Issue 3•August 2018, pp 867-886 • https://doi.org/10.1287/moor.2017.0887We consider queueing systems with n parallel queues under a Join the Shortest Queue (JSQ) policy in the Halfin-Whitt heavy-traffic regime. We use the martingale method to prove that a scaled process counting the number of idle servers and queues of length ...
- 12Citation
MetricsTotal Citations12
- Patrick Eschenfeldt
- article
Efficient Dynamic Barter Exchange
- Ross Anderson
Google, Mountain View, California 94043
, - Itai Ashlagi
Management Science and Engineering, Stanford University, Stanford, California 94305
, - David Gamarnik
Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139
, - Yash Kanoria
Decision, Risk and Operations Division, Columbia Business School, New York, New York 10027
Operations Research, Volume 65, Issue 6•December 2017, pp 1446-1459 • https://doi.org/10.1287/opre.2017.1644We study dynamic matching policies in a stochastic marketplace for barter, with agents arriving over time. Each agent is endowed with an item and is interested in an item possessed by another agent homogeneously with probability p, independently for all ...
- 15Citation
MetricsTotal Citations15
- Ross Anderson
- article
Convergent sequences of sparse graphs: A large deviations approach
- Christian Borgs
Microsoft Research, One Memorial Dr., Cambridge,
, - Jennifer Chayes
Microsoft Research, One Memorial Dr., Cambridge,
, - David Gamarnik
MIT, Sloan School of Management, Cambridge, MA,
Random Structures & Algorithms, Volume 51, Issue 1•August 2017, pp 52-89 • https://doi.org/10.1002/rsa.20694Models based on sparse graphs are of interest to many communities: they appear as basic models in combinatorics, probability theory, optimization, statistical physics, information theory, and more applied fields of social sciences and economics. ...
- 0Citation
MetricsTotal Citations0
- Christian Borgs
- research-articlePublic AccessPublished By ACMPublished By ACM
Delay, Memory, and Messaging Tradeoffs in Distributed Service Systems
- David Gamarnik
Massachusetts Institute of Technology, Cambridge, MA, USA
, - John N. Tsitsiklis
Massachusetts Institute of Technology, Cambridge, MA, USA
, - Martin Zubeldia
Massachusetts Institute of Technology, Cambridge, MA, USA
SIGMETRICS '16: Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science•June 2016, pp 1-12• https://doi.org/10.1145/2896377.2901478We consider the following distributed service model: jobs with unit mean, exponentially distributed, and independent processing times arrive as a Poisson process of rate λ N, with 0<λ<1, and are immediately dispatched to one of several queues associated ...
Also Published in:
ACM SIGMETRICS Performance Evaluation Review: Volume 44 Issue 1, June 2016- 39Citation
- 1,056
- Downloads
MetricsTotal Citations39Total Downloads1,056Last 12 Months292Last 6 weeks30
- David Gamarnik
- other
Preface to the Special Issue on Information and Decisions in Social and Economic Networks
- Edward Anderson
University of Sydney Business School, Sydney NSW 2006, Australia
, - David Gamarnik
Operations Research Center and Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139
, - Anton Kleywegt
H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332
, - Asuman Ozdaglar
Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139
Operations Research, Volume 64, Issue 3•May-June 2016, pp 561-563 • https://doi.org/10.1287/opre.2016.1513- 0Citation
MetricsTotal Citations0
- Edward Anderson
- article
Strong spatial mixing of list coloring of graphs
- David Gamarnik
Operations Research Center and Sloan School of Management, MIT, Cambridge, Massachusetts,
, - Dmitriy Katz
T.J. Watson Research Center, IBM, Yorktown Heights, New York,
, - Sidhant Misra
Department of Electrical Engineering and Computer Science, MIT, Cambridge, Massachusetts,
Random Structures & Algorithms, Volume 46, Issue 4•July 2015, pp 599-613 • https://doi.org/10.1002/rsa.20518The property of spatial mixing and strong spatial mixing in spin systems has been of interest because of its implications on uniqueness of Gibbs measures on infinite graphs and efficient approximation of counting problems that are otherwise known to be #...
- 8Citation
MetricsTotal Citations8
- David Gamarnik
- article
The stability of the deterministic Skorokhod problem is undecidable
- David Gamarnik
Operations Research Center and Sloan School of Management, MIT, Cambridge, USA 02139
, - Dmitriy Katz
T.J. Watson Research Center, IBM, Yorktown Heights, USA 10598
Queueing Systems: Theory and Applications, Volume 79, Issue 3-4•April 2015, pp 221-249 • https://doi.org/10.1007/s11134-014-9424-8The Skorokhod problem arises in studying reflected Brownian motion (RBM) and the associated fluid model on the non-negative orthant. This problem specifically arises in the context of queueing networks in the heavy traffic regime. One of the key ...
- 0Citation
MetricsTotal Citations0
- David Gamarnik
- article
Kidney Exchange and the Alliance for Paired Donation: Operations Research Changes the Way Kidneys Are Transplanted
- Ross Anderson
Massachusetts Institute of Technology, Cambridge, Massachusetts 02142
, - Itai Ashlagi
Massachusetts Institute of Technology, Cambridge, Massachusetts 02142
, - David Gamarnik
Massachusetts Institute of Technology, Cambridge, Massachusetts 02142
, - Michael Rees
The Alliance for Paired Donation, Maumee, Ohio 43537
, - Alvin E. Roth
Stanford University, Stanford, California 94305
, - Tayfun Sönmez
Boston College, Chestnut Hill, Massachusetts 02467
, - M. Utku Ünver
Boston College, Chestnut Hill, Massachusetts 02467
Many end-stage renal disease sufferers who require a kidney transplant to prolong their lives have a relative or friend who has volunteered to donate a kidney to them, but whose kidney is incompatible with the intended recipient. This incompatibility ...
- 8Citation
MetricsTotal Citations8
- Ross Anderson
- article
Kidney Exchange and the Alliance for Paired Donation: Operations Research Changes the Way Kidneys Are Transplanted
- Ross Anderson
Massachusetts Institute of Technology, Cambridge, Massachusetts 02142
, - Itai Ashlagi
Massachusetts Institute of Technology, Cambridge, Massachusetts 02142
, - David Gamarnik
Massachusetts Institute of Technology, Cambridge, Massachusetts 02142
, - Michael Rees
The Alliance for Paired Donation, Maumee, Ohio 43537
, - Alvin E. Roth
Stanford University, Stanford, California 94305
, - Tayfun Sönmez
Boston College, Chestnut Hill, Massachusetts 02467
, - M. Utku Ünver
Boston College, Chestnut Hill, Massachusetts 02467
Many end-stage renal disease sufferers who require a kidney transplant to prolong their lives have a relative or friend who has volunteered to donate a kidney to them, but whose kidney is incompatible with the intended recipient. This incompatibility ...
- 1Citation
MetricsTotal Citations1
- Ross Anderson
- article
Kidney Exchange and the Alliance for Paired Donation: Operations Research Changes the Way Kidneys Are Transplanted
- Ross Anderson
Massachusetts Institute of Technology, Cambridge, Massachusetts 02142
, - Itai Ashlagi
Massachusetts Institute of Technology, Cambridge, Massachusetts 02142
, - David Gamarnik
Massachusetts Institute of Technology, Cambridge, Massachusetts 02142
, - Michael Rees
The Alliance for Paired Donation, Maumee, Ohio 43537
, - Alvin E. Roth
Stanford University, Stanford, California 94305
, - Tayfun Sönmez
Boston College, Chestnut Hill, Massachusetts 02467
, - M. Utku Ünver
Boston College, Chestnut Hill, Massachusetts 02467
Many end-stage renal disease sufferers who require a kidney transplant to prolong their lives have a relative or friend who has volunteered to donate a kidney to them, but whose kidney is incompatible with the intended recipient. This incompatibility ...
- 1Citation
MetricsTotal Citations1
- Ross Anderson
- research-article
A dynamic model of barter exchange
- Ross Anderson
Operations Research Center, MIT, Cambridge, MA
, - Itai Ashlagi
Sloan School of Management, MIT, Cambridge, MA
, - David Gamarnik
Operations Research Center and Sloan School of Management, MIT, Cambridge, MA
, - Yash Kanoria
Columbia University, New York, NY
SODA '15: Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms•January 2015, pp 1925-1933We consider the problem of efficient operation of a barter exchange platform for indivisible goods. We introduce a dynamic model of barter exchange where in each period one agent arrives with a single item she wants to exchange for a different item. We ...
- 10Citation
- 188
- Downloads
MetricsTotal Citations10Total Downloads188Last 12 Months7Last 6 weeks1
- Ross Anderson
- Article
Structure learning of antiferromagnetic Ising models
- Guy Bresler
Laboratory for Information and Decision Systems, Department of EECS
, - David Gamarnik
Sloan School of Management, Massachusetts Institute of Technology
, - Devavrat Shah
Laboratory for Information and Decision Systems, Department of EECS
NIPS'14: Proceedings of the 27th International Conference on Neural Information Processing Systems - Volume 2•December 2014, pp 2852-2860In this paper we investigate the computational complexity of learning the graph structure underlying a discrete undirected graphical model from i.i.d. samples. Our first result is an unconditional computational lower bound of Ω(pd/2) for learning ...
- 3Citation
MetricsTotal Citations3
- Guy Bresler
- Article
Hardness of parameter estimation in graphical models
- Guy Bresler
Laboratory for Information and Decision Systems, Department of EECS, Massachusetts Institute of Technology
, - David Gamarnik
Laboratory for Information and Decision Systems, Sloan School of Management, Massachusetts Institute of Technology
, - Devavrat Shah
Laboratory for Information and Decision Systems, Department of EECS, Massachusetts Institute of Technology
NIPS'14: Proceedings of the 27th International Conference on Neural Information Processing Systems - Volume 1•December 2014, pp 1062-1070We consider the problem of learning the canonical parameters specifying an undirected graphical model (Markov random field) from the mean parameters. For graphical models representing a minimal exponential family, the canonical parameters are uniquely ...
- 3Citation
MetricsTotal Citations3
- Guy Bresler
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