Остановите войну!
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 34 matches
- 1982
- Harold Abelson, Andrzej Ehrenfeucht, James Fickett, Jan Mycielski:
Compositional complexity of Boolean functions. Discret. Appl. Math. 4(1): 1-10 (1982) - Martin Aigner:
Selecting the top three elements. Discret. Appl. Math. 4(4): 247-267 (1982) - Jaakko Astola:
A note on perfect Lee-codes over small alphabets. Discret. Appl. Math. 4(3): 227-228 (1982) - Davis Avis:
On the complexity of finding the convex hull of a set of points. Discret. Appl. Math. 4(2): 81-86 (1982) - Frank Markham Brown:
Segmental solutions of Boolean equations. Discret. Appl. Math. 4(2): 87-96 (1982) - Gerard J. Chang, Frank K. Hwang, Shen Lin:
Group testing with two defectives. Discret. Appl. Math. 4(2): 97-102 (1982) - Dean S. Clark:
A class of combinatorial identities. Discret. Appl. Math. 4(4): 325-327 (1982) - Charles J. Colbourn, Marlene J. Colbourn, Kevin T. Phelps, Vojtech Rödl:
Colouring steiner quadruple systems. Discret. Appl. Math. 4(2): 103-111 (1982) - Cornelius Croitoru:
An analysis of the greedy algorithm for partially ordered sets. Discret. Appl. Math. 4(2): 113-117 (1982) - Karel Culík II, Faith E. Fich, Arto Salomaa:
A homomorphic characterization of regular languages. Discret. Appl. Math. 4(2): 149-152 (1982) - Jürgen Dassow:
Grammars with valuations - a discrete model for self-organization of biopolymers. Discret. Appl. Math. 4(3): 161-174 (1982) - Andrzej Ehrenfeucht, Grzegorz Rozenberg, R. Verraedt:
Basic formulas and languages: PART II.Applications to E0L systems and forms. Discret. Appl. Math. 4(1): 11-22 (1982) - Peter C. Fishburn:
Monotonicity paradoxes in the theory of elections. Discret. Appl. Math. 4(2): 119-134 (1982) - E. Ya. Gabovich:
On spectral theory in discrete programming : References added in proof. Discret. Appl. Math. 4(4): 269-280 (1982) - Giorgio Gallo, Stefano Pallottino:
A new algorithm to find the shortest paths between all pairs of nodes. Discret. Appl. Math. 4(1): 23-35 (1982) - Georg Gati:
Maximizing a lower bound on the computational complexity. Discret. Appl. Math. 4(3): 175-180 (1982) - Fanica Gavril, Johanan Schönheim:
Characterization and algorithms of curve map graphs. Discret. Appl. Math. 4(3): 181-191 (1982) - Coriolan Ghilezan:
Les derivees partielles des fonctions pseudo-booleennes generalisees. Discret. Appl. Math. 4(1): 37-45 (1982) - Jaak Henno:
On equivalent sets of functions. Discret. Appl. Math. 4(2): 153-156 (1982) - Juha Honkala:
Unique representation in number systems and L codes. Discret. Appl. Math. 4(3): 229-232 (1982) - Juha Kortelainen:
A result concerning the trios generated by commutative slip-languages. Discret. Appl. Math. 4(3): 233-236 (1982) - Anthony Mansfield:
An algorithm for a merge recognition problem. Discret. Appl. Math. 4(3): 193-197 (1982) - T. Margush:
Distances between trees. Discret. Appl. Math. 4(4): 281-290 (1982) - Rabe von Randow:
The bank safe problem. Discret. Appl. Math. 4(4): 335-337 (1982) - Thomas D. Rogers, J. R. Pounder:
Cycle structure in discrete-density models. Discret. Appl. Math. 4(3): 199-210 (1982) - Alexander Rosa, Walter D. Wallis:
Premature sets of 1-factors or how not to schedule round robin tournaments. Discret. Appl. Math. 4(4): 291-297 (1982) - Grzegorz Rozenberg, R. Verraedt:
A note on the similarity depth. Discret. Appl. Math. 4(3): 237-241 (1982) - John F. Sallee:
A note on minimal triangulations of an n-cube. Discret. Appl. Math. 4(3): 211-215 (1982) - Hanif D. Sherali, C. M. Shetty:
A finitely convergent procedure for facial disjunctive programs. Discret. Appl. Math. 4(2): 135-148 (1982) - Arie Tamir:
On the solution of discrete bottleneck problems. Discret. Appl. Math. 4(4): 299-302 (1982)
skipping 4 more matches
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-09-03 16:51 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