Остановите войну!
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
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 16 matches
- 2022
- Clifford Bergman, William J. DeMeo:
Universal Algebraic Methods for Constraint Satisfaction Problems. Log. Methods Comput. Sci. 18(1) (2022) - 2019
- Clifford Anderson-Bergman:
Latent Channel Networks. CoRR abs/1906.04563 (2019) - 2018
- Clifford Anderson-Bergman, Tamara G. Kolda, Kina Kincher-Winoto:
XPCA: Extending PCA for a Combination of Discrete and Continuous Variables. CoRR abs/1808.07510 (2018) - 2017
- Clifford Anderson-Bergman:
Bayesian Regression Models for Interval-censored Data in R. R J. 9(2): 487 (2017) - 2016
- Clifford Anderson-Bergman, Yaming Yu:
Computing the log concave NPMLE for interval censored data. Stat. Comput. 26(4): 813-826 (2016) - Clifford Bergman, William J. DeMeo:
Universal Algebraic Methods for Constraint Satisfaction Problems. CoRR abs/1611.02867 (2016) - 2011
- George T. Amariucai, Clifford Bergman, Yong Guan:
An Automatic, Time-Based, Secure Pairing Protocol for Passive RFID. RFIDSec 2011: 108-126 - 2005
- Clifford Bergman, Jennifer L. Davidson:
Unitary embedding for data hiding with the SVD. Security, Steganography, and Watermarking of Multimedia Contents 2005: 619-630 - 2002
- Clifford Bergman, Giora Slutzki:
Computational Complexity of Generators and Nongenerators in Algebra. Int. J. Algebra Comput. 12(5): 719-735 (2002) - Clifford Bergman, Giora Slutzki:
Computational complexity of some problems involving congruences on algebras. Theor. Comput. Sci. 270(1-2): 591-608 (2002) - 2000
- Clifford Bergman, Giora Slutzki:
Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras. SIAM J. Comput. 30(2): 359-382 (2000) - Clifford Bergman, Giora Slutzki:
Computational Complexity of Some Problems Involving Congruences on Algebras. LICS 2000: 168-174 - 1999
- Clifford Bergman, David Juedes, Giora Slutzki:
Computational Complexity of Term-Equivalence. Int. J. Algebra Comput. 9(1): 113-128 (1999) - Clifford Bergman, Giora Slutzki:
Complexity of Some Problems in Universal Algebra. STACS 1999: 163-172 - 1998
- Clifford Bergman, Joel Berman:
Algorithms for Categorical Equivalence. Math. Struct. Comput. Sci. 8(1): 1-15 (1998) - 1990
- Clifford Bergman, Roger D. Maddux, Don Pigozzi:
Algebraic Logic and Universal Algebra in Computer Science, Conference, Ames, Iowa, USA, June 1-4, 1988, Proceedings. Lecture Notes in Computer Science 425, Springer 1990, ISBN 3-540-97288-9 [contents]
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-05-02 10:46 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