Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrei Constantinescu 0001
Person information
- affiliation: ETH Zurich, Zurich, Switzerland
Other persons with the same name
- Andrei Constantinescu 0002 — École Polytechnique, Palaiseau, France
- Andrei Constantinescu 0003 — Dalle Molle Institute for Perceptual Articial Intelligencem, Martigny, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Giannis Tyrovolas, Andrei Constantinescu, Edith Elkind:
Unravelling Expressive Delegations: Complexity and Normative Analysis. AAAI 2024: 9918-9925- [i10]Andrei Constantinescu, Diana Ghinea, Jakub Sliwinski, Roger Wattenhofer:
Unifying Partial Synchrony. CoRR abs/2405.10249 (2024) - 2023
- [c6]Andrei Constantinescu, Roger Wattenhofer:
Computing the Best Policy that Survives a Vote. AAMAS 2023: 2058-2066 - [c5]Andrei Constantinescu, Diana Ghinea, Lioba Heimbach, Zilin Wang, Roger Wattenhofer:
A Fair and Resilient Decentralized Clock Network for Transaction Ordering. OPODIS 2023: 8:1-8:20 - [c4]Damien Berriaud
, Andrei Constantinescu, Roger Wattenhofer:
Stable Dinner Party Seating Arrangements. WINE 2023: 3-20 - [c3]Andrei Constantinescu, Roger Wattenhofer:
Recovering Single-Crossing Preferences from Approval Ballots. WINE 2023: 188-206 - [i9]Andrei Constantinescu, Roger Wattenhofer:
Computing the Best Policy That Survives a Vote. CoRR abs/2303.00660 (2023) - [i8]Andrei Constantinescu, Diana Ghinea, Lioba Heimbach, Zilin Wang, Roger Wattenhofer:
A Fair and Resilient Decentralized Clock Network for Transaction Ordering. CoRR abs/2305.05206 (2023) - [i7]Damien Berriaud, Andrei Constantinescu, Roger Wattenhofer:
Stable Dinner Party Seating Arrangements. CoRR abs/2305.09549 (2023) - [i6]Andrei Constantinescu, Roger Wattenhofer:
Recovering Single-Crossing Preferences From Approval Ballots. CoRR abs/2310.03736 (2023) - [i5]Andrei Constantinescu, Pascal Lenzner, Rebecca Reiffenhäuser, Daniel Schmand, Giovanna Varricchio:
Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games. CoRR abs/2311.02067 (2023) - [i4]Giannis Tyrovolas, Andrei Constantinescu, Edith Elkind:
Unravelling Expressive Delegations: Complexity and Normative Analysis. CoRR abs/2312.11932 (2023) - [i3]Andrei Constantinescu, Diana Ghinea, Roger Wattenhofer, Floris Westermann:
Meeting in a Convex World: Convex Consensus with Asynchronous Fallback. IACR Cryptol. ePrint Arch. 2023: 1364 (2023) - 2022
- [c2]Andrei Constantinescu, Roger Wattenhofer:
Voting in Two-Crossing Elections. IJCAI 2022: 208-214 - [i2]Andrei Constantinescu, Roger Wattenhofer:
Voting in Two-Crossing Elections. CoRR abs/2205.00474 (2022) - 2021
- [c1]Andrei Costin Constantinescu, Edith Elkind:
Proportional Representation under Single-Crossing Preferences Revisited. AAAI 2021: 5286-5293 - 2020
- [i1]Andrei Costin Constantinescu, Edith Elkind:
Proportional Representation under Single-Crossing Preferences Revisited. CoRR abs/2010.08637 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-13 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
