Остановите войну!
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 40 matches
- 2010
- Andreas Alexander Albrecht, Peter C. R. Lane, Kathleen Steinhöfel:
Analysis of Local Search Landscapes for k-SAT Instances. Math. Comput. Sci. 3(4): 465-488 (2010) - David Aspinall, Ewen Denney, Christoph Lüth:
Tactics for Hierarchical Proof. Math. Comput. Sci. 3(3): 309-330 (2010) - Serge Autexier, Petr Sojka, Masakazu Suzuki:
Foreword to the Special Issue on Authoring, Digitalization and Management of Mathematical Knowledge. Math. Comput. Sci. 3(3): 225-226 (2010) - Matthias Baumgart:
Partitioning Bispanning Graphs into Spanning Trees. Math. Comput. Sci. 3(1): 3-15 (2010) - Thierry Bouche:
Digital Mathematics Libraries: The Good, the Bad, the Ugly. Math. Comput. Sci. 3(3): 227-241 (2010) - Stanislav Bulygin, Michael Brickenstein:
Obtaining and Solving Systems of Equations in Key Variables Only for the Small Variants of AES. Math. Comput. Sci. 3(2): 185-200 (2010) - Manolis Christodoulakis, Costas S. Iliopoulos:
Foreword. Math. Comput. Sci. 3(4): 371 (2010) - Luigi Cinque, Sergio De Agostino, Luca Lombardi:
Scalability and Communication in Parallel Low-Complexity Lossless Compression. Math. Comput. Sci. 3(4): 391-406 (2010) - Arjeh M. Cohen, Hans Cuypers, R. Verrijzer:
Mathematical Context in Interactive Documents. Math. Comput. Sci. 3(3): 331-347 (2010) - Colin Cooper, Ryuhei Uehara:
Scale Free Properties of Random k-Trees. Math. Comput. Sci. 3(4): 489-496 (2010) - Elena S. Dimitrova:
Estimating the Volumes of the Cones in a Gröbner Fan. Math. Comput. Sci. 3(4): 457-463 (2010) - Sylvain Duquesne:
Traces of the Group Law on the Kummer Surface of a Curve of Genus 2 in Characteristic 2. Math. Comput. Sci. 3(2): 173-183 (2010) - Tobias Eibach, Gunnar Völkel, Enrico Pilz:
Optimising Gröbner Bases on Bivium. Math. Comput. Sci. 3(2): 159-172 (2010) - Jean-Charles Faugère, Ludovic Perret:
Foreword. Math. Comput. Sci. 3(2): 127-128 (2010) - Johannes Fischer, Volker Heun:
Finding Range Minima in the Middle: Approximations and Applications. Math. Comput. Sci. 3(1): 17-30 (2010) - Satoshi Fujita:
Loose Cover of Graphs. Math. Comput. Sci. 3(1): 31-38 (2010) - Akio Fujiyoshi, Masakazu Suzuki, Seiichi Uchida:
Grammatical Verification for Mathematical Formula Recognition Based on Context-Free Tree Grammar. Math. Comput. Sci. 3(3): 279-298 (2010) - Subhas Kumar Ghosh, Janardan Misra:
A Randomized Algorithm for 3-SAT. Math. Comput. Sci. 3(4): 421-431 (2010) - Masud Hasan, Tanaeem M. Moosa, M. Sohel Rahman:
Cache Oblivious Algorithms for the RMQ and the RMSQ Problems. Math. Comput. Sci. 3(4): 433-442 (2010) - Bastiaan Heeren, Johan Jeuring, Alex Gerdes:
Specifying Rewrite Strategies for Interactive Exercises. Math. Comput. Sci. 3(3): 349-370 (2010) - Clemens Heuberger:
Redundant τ-Adic Expansions II: Non-Optimality and Chaotic Behaviour. Math. Comput. Sci. 3(2): 141-157 (2010) - Rikio Ichishima, Akito Oshima:
On Partitional Labelings of Graphs. Math. Comput. Sci. 3(1): 39-45 (2010) - M. Oguzhan Külekci:
BLIM: A New Bit-Parallel Pattern Matching Algorithm Overcoming Computer Word Size Limitation. Math. Comput. Sci. 3(4): 407-420 (2010) - Reinhard Kutzelnigg:
An Improved Version of Cuckoo Hashing: Average Case Analysis of Construction Cost and Search Operations. Math. Comput. Sci. 3(1): 47-60 (2010) - Sof Anthony Lee:
k-Phase Oscillator Synchronization for Graph Coloring. Math. Comput. Sci. 3(1): 61-72 (2010) - Moon Sung Lee, Sang Geun Hahn:
Cryptanalysis of the GGH Cryptosystem. Math. Comput. Sci. 3(2): 201-208 (2010) - Enrique Macías-Virgós, R. de la Viesca:
Digitization Projects in Spain. Math. Comput. Sci. 3(3): 243-250 (2010) - George B. Mertzios, Walter Unger:
Preemptive Scheduling of Equal-Length Jobs in Polynomial Time. Math. Comput. Sci. 3(1): 73-84 (2010) - George B. Mertzios, Walter Unger:
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs. Math. Comput. Sci. 3(1): 85-96 (2010) - Zarko Mijajlovic, Zoran Ognjanovic, Aleksandar Pejovic:
Digitization of Mathematical Editions in Serbia. Math. Comput. Sci. 3(3): 251-263 (2010)
skipping 10 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-06-10 17:55 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