Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 24 matches
- 2024
- Ishaq Aden-Ali, Mikael Møller Høgsgaard, Kasper Green Larsen, Nikita Zhivotovskiy:
Majority-of-Three: The Simplest Optimal Learner? CoRR abs/2403.08831 (2024) - 2023
- Prasanth Chakka, Saurabh Joshi, Aniket Kate, Joshua Tobkin, David Yang:
Oracle Agreement: From an Honest Super Majority to Simple Majority. ICDCS 2023: 714-725 - Prasanth Chakka, Saurabh Joshi, Aniket Kate, Joshua Tobkin, David Yang:
DORA: Distributed Oracle Agreement with Simple Majority. CoRR abs/2305.03903 (2023) - Natalia Dobrokhotova-Maikova, Alexander Kozachinskiy, Vladimir V. Podolskii:
Towards Simpler Sorting Networks and Monotone Circuits for Majority. CoRR abs/2310.12270 (2023) - Natalia Dobrokhotova-Maikova, Alexander Kozachinskiy, Vladimir V. Podolskii:
Towards Simpler Sorting Networks and Monotone Circuits for Majority. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- Ran Tamir, Ariel Livshits, Yonatan Shadmi:
Simple Majority Consensus in Networks with Unreliable Communication. Entropy 24(3): 333 (2022) - 2021
- Thomas W. Cusick:
Simpler proof for nonlinearity of majority function. Discret. Appl. Math. 297: 55-59 (2021) - Francesca Busetto, Giulio Codognato, Simone Tonin:
Simple majority rule and integer programming. Math. Soc. Sci. 113: 160-163 (2021) - Ariel Livshits, Yonatan Shadmi, Ran Tamir:
Brief Announcement: Simple Majority Consensus in Networks with Unreliable Communication. DISC 2021: 59:1-59:4 - Ran Tamir, Ariel Livshits, Yonatan Shadmi:
Simple Majority Consensus in Networks with Unreliable Communication. CoRR abs/2104.04996 (2021) - 2020
- Vitaly A. Malyshev:
Optimal Majority Rule Versus Simple Majority Rule. EUMAS/AT 2020: 382-395 - Jaehyoung Park, Yonggang Kim, Gyungmin Kim, Hyuk Lim:
Simple Link-layer Diversity Combining using Majority Voting in Dense WLANs. ICTC 2020: 1469-1474 - 2016
- Raphael Thiele, Ingo Althöfer:
An Analysis of Majority Systems with Dependent Agents in a Simple Subtraction Game. Computers and Games 2016: 202-211 - 2015
- Jacek Mercik, David Ramsey:
On a Simple Game Theoretical Equivalence of Voting Majority Games with Vetoes of First and Second Degrees. ACIIDS (1) 2015: 284-294 - 2013
- Kristian Toby Spoerer, Toshihisa Okaneya, Kokolo Ikeda, Hiroyuki Iida:
Further Investigations of 3-Member Simple Majority Voting for Chess. Computers and Games 2013: 199-207 - Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, Luca Trevisan:
Simple Dynamics for Majority Consensus. CoRR abs/1310.2858 (2013) - 2011
- Stefan Bolus:
Power indices of simple games and vector-weighted majority games by means of binary decision diagrams. Eur. J. Oper. Res. 210(2): 258-272 (2011) - 2009
- Zhigang Cao, Xiaoguang Yang:
Coalition formation in weighted simple-majority games under proportional payoff allocation rules. Int. J. Autom. Comput. 6(3): 217 (2009) - 2008
- Dana Angluin, James Aspnes, David Eisenstat:
A simple population protocol for fast robust approximate majority. Distributed Comput. 21(2): 87-102 (2008) - Sonali Roy:
The exact lower bound for the Coleman index of the power of a collectivity for a special class of simple majority games. Math. Soc. Sci. 56(2): 296-300 (2008) - 2007
- Dana Angluin, James Aspnes, David Eisenstat:
A Simple Population Protocol for Fast Robust Approximate Majority. DISC 2007: 20-32 - 2006
- José Luis García-Lapresta:
A general class of simple majority decision rules based on linguistic opinions. Inf. Sci. 176(4): 352-365 (2006) - 1997
- Birsel Ayrulu, Billur Barshan, Simukai W. Utete:
Target identification with multiple logical sonars using evidential reasoning and simple majority voting. ICRA 1997: 2063-2068 - 1996
- Keiko Nagase, Eitaro Aiyoshi:
The hierarchical and social decision making procedure for bi-objective optimization problems by using the simple majority decision rule. J. Glob. Optim. 8(3): 307-322 (1996)
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-04-25 08:20 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint