


Остановите войну!
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 21 matches
- 2023
- Andrew Bell
, Lucius Bynum
, Nazarii Drushchak
, Tetiana Zakharchenko
, Lucas Rosenblatt
, Julia Stoyanovich
:
The Possibility of Fairness: Revisiting the Impossibility Theorem in Practice. FAccT 2023: 400-422 - Andrew Bell, Lucius Bynum, Nazarii Drushchak, Tetiana Herasymova, Lucas Rosenblatt, Julia Stoyanovich:
The Possibility of Fairness: Revisiting the Impossibility Theorem in Practice. CoRR abs/2302.06347 (2023) - 2022
- Eric Rowland
:
Lucas' Theorem Modulo p2. Am. Math. Mon. 129(9): 846-855 (2022) - 2021
- Shrey Mishra, Lucas Pluvinage, Pierre Senellart:
Towards extraction of theorems and proofs in scholarly articles. DocEng 2021: 25:1-25:4 - 2020
- Chelsea Edmonds:
Lucas's Theorem. Arch. Formal Proofs 2020 (2020) - Marthe Bonamy, Pierre Charbit
, Oscar Defrain, Gwenaël Joret, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor, Jean-Sébastien Sereni:
Revisiting a Theorem by Folkman on Graph Colouring. Electron. J. Comb. 27(1): 1 (2020) - Maxime Lucas
:
A cubical Squier's theorem. Math. Struct. Comput. Sci. 30(2): 159-172 (2020) - 2019
- Lucas Mol
, Narad Rampersad
, Jeffrey O. Shallit
, Manon Stipulanti
:
Cobham's Theorem and Automaticity. Int. J. Found. Comput. Sci. 30(8): 1363-1379 (2019) - 2018
- Lucas Mol, Narad Rampersad, Jeffrey O. Shallit, Manon Stipulanti:
Cobham's Theorem and Automaticity. CoRR abs/1809.00679 (2018) - 2015
- Frederik Harwath, Lucas Heimberg, Nicole Schweikardt:
Preservation and decomposition theorems for bounded degree structures. Log. Methods Comput. Sci. 11(4) (2015) - 2014
- Nikolai G. Nikolov
, Blagovest Sendov:
A Converse of the Gauss-Lucas Theorem. Am. Math. Mon. 121(6): 541-544 (2014) - Salvador Lucas:
Using Representation Theorems for Proving Polynomials Non-negative. AISC 2014: 21-33 - Frederik Harwath, Lucas Heimberg, Nicole Schweikardt:
Preservation and decomposition theorems for bounded degree structures. CSL-LICS 2014: 49:1-49:10 - 2013
- Michael Jason Knap, Lee H. Keel, Shankar P. Bhattacharyya:
Controller Design and the Gauss-Lucas Theorem. IEEE Trans. Autom. Control. 58(11): 2940-2944 (2013) - 2012
- Michael Jason Knap, Lee H. Keel, Shankar P. Bhattacharyya:
Controller design and Gauss-Lucas theorem. ACC 2012: 6697-6701 - 2008
- Victor J. W. Guo
, Jiang Zeng:
Multiple extensions of a finite Euler's pentagonal number theorem and the Lucas formulas. Discret. Math. 308(18): 4069-4078 (2008) - 2006
- Tyler J. Evans:
On Some Generalizations of Fermat's, Lucas's and Wilson's Theorems. Ars Comb. 79 (2006) - 2005
- Peter G. Anderson, Arthur T. Benjamin, Jeremy A. Rouse:
Combinatorial Proofs of Fermat's, Lucas's, and Wilson's Theorems. Am. Math. Mon. 112(3): 266-268 (2005) - 2004
- James V. Burke, Adrian S. Lewis, Michael L. Overton:
Variational Analysis of the Abscissa Mapping for Polynomials via the Gauss-Lucas Theorem. J. Glob. Optim. 28(3-4): 259-268 (2004) - 1990
- Kenneth S. Davis, William A. Webb:
Lucas' Theorem for Prime Powers. Eur. J. Comb. 11(3): 229-233 (1990) - 1985
- René Lavendhomme, Thierry Lucas:
A Non-Boolean Version of Feferman-Vaught's Theorem. Math. Log. Q. 31(19-20): 299-308 (1985)
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 2023-09-24 08:03 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