Остановите войну!
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 79 matches
- 1993
- Ferri Abolhassan, Reinhard Drefenstedt, Jörg Keller, Wolfgang J. Paul, Dieter Scheerer:
On the Physical Design of PRAMs. Comput. J. 36(8): 756-762 (1993) - Wolfgang Appelt, Nik Tetteh-Lartey:
The Formal Specification of the ISO Open Document Architecture (ODA) Standard. Comput. J. 36(3): 269-279 (1993) - M. D. Atkinson:
Uniform Generation of Rooted Ordered Trees with Prescribed Degrees. Comput. J. 36(6): 593-594 (1993) - Björn Bergsten, Michel Couprie, Patrick Valduriez:
Overview of Parallel Architectures for Databases. Comput. J. 36(8): 734-740 (1993) - Neil Berrington, David De Roure, Julian A. Padget:
Guaranteeing Unpredictability. Comput. J. 36(8): 723-733 (1993) - L. Anne Breene:
Quadtrees and Hypercubes: Grid Embedding Strategies Based on Spatial Data Structure Addressing. Comput. J. 36(6): 562-569 (1993) - Christopher Burdorf, Jed Marti:
Load Balancing Strategies for Time Warp on Multi-User Workstations. Comput. J. 36(2): 168-176 (1993) - John F. Canny:
Improved Algorithms for Sign Determination and Existential Quantifier Elimination. Comput. J. 36(5): 409-418 (1993) - John F. Canny:
Computing Roadmaps of General Semi-Algebraic Sets. Comput. J. 36(5): 504-514 (1993) - Vincenzo Catania, Antonio Puliafito, Lorenzo Vita:
A Model for Performance Evaluation of Gracefully Degrading Systems. Comput. J. 36(2): 177-185 (1993) - Michael F. Challis:
Two New Techniques for Computing Extremal h-bases Ak. Comput. J. 36(2): 117-126 (1993) - Vijay Chandru:
Variable Elimination in Linear Constraints. Comput. J. 36(5): 463-472 (1993) - Henry Ker-Chang Chang, Shing Hong Chen:
A New Locally Adaptive Data Compression Scheme using Multilist Structure. Comput. J. 36(6): 570-578 (1993) - Daniel Y. Chao, David T. Wang, D. C. Douglas Hung:
Convergence Time and Memory Capacity of Higher-order Hopfield Associative Memory with Multi-valued Neurons. Comput. J. 36(6): 554-561 (1993) - Colin C. Charlton, Paul E. Dunne, Keith Halewood, Paul H. Leng:
An Algorithm to Generate Random Large Combinational Circuits. Comput. J. 36(2): 200-206 (1993) - Dominic A. Clark, Christopher J. Rawlings, Jack Shirazi, Liang-Liang Li, Kees Schuerman, Mike Reeve, André Véron:
Solving Large Combinatorial Problems in Molecular Biology Using the ElipSys Parallel Constraint Logic Programming System. Comput. J. 36(8): 690-701 (1993) - Tim B. Cooper, Jeffrey H. Kingston:
The Solution of Real Instances of the Timetabling Problem. Comput. J. 36(7): 645-653 (1993) - Felipe Cucker:
On the Complexity of Quantifier Elimination: the Structural Approach. Comput. J. 36(5): 400-408 (1993) - Zbigniew J. Czech, Bohdan S. Majewski:
A Linear Time Algorithm for Finding Minimal Perfect Hash Functions. Comput. J. 36(6): 579-587 (1993) - Devdatt P. Dubhashi:
Quantifier Elimination in p-adic Fields. Comput. J. 36(5): 419-426 (1993) - Anthony Finkelstein:
European Computing Curricula: A Guide and Comparative Analysis. Comput. J. 36(4): 299-319 (1993) - Anthony Finkelstein, Jeff Kramer, Samson Abramsky, Krysia Broda, Sophia Drossopoulou, Susan Eisenbach:
An Integrated Engineering Study Scheme in Computing. Comput. J. 36(4): 320-334 (1993) - Aviezri S. Fraenkel, Shmuel T. Klein:
Bounding the Depth of Search Trees. Comput. J. 36(7): 668-678 (1993) - Pasi Fränti, Olli Nevalainen:
A Two-Stage Modelling Method for Compressing Binary Images by Arithmetic Coding. Comput. J. 36(7): 615-622 (1993) - Uwe Geuder, Monika Härdtner, Andreas Reuter, Bernhard Wörner, Roland Zink:
GRIDS - A Parallel Programming System for Grid-Based Algorithms. Comput. J. 36(8): 702-711 (1993) - Robert R. Goldberg:
Finite State Automata from Regular Expression Trees. Comput. J. 36(7): 623-630 (1993) - Doug Goldson, Steve Reeves, Richard Bornat:
A Review of Several Programs for the Teaching of Logic. Comput. J. 36(4): 373-386 (1993) - M. J. González-López, Tomás Recio:
Path Tracking in Motion Planning. Comput. J. 36(5): 515-524 (1993) - Inman P. de Guzmán, Peter G. Harrison, E. Medina:
Pipelines for Divide-and-Conquer Functions. Comput. J. 36(3): 254-268 (1993) - Gaétan Hains, Lenore M. R. Mullin:
Parallel Functional Programming with Arrays. Comput. J. 36(3): 238-245 (1993)
skipping 49 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-05-28 10:24 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