Остановите войну!
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 27 matches
- 2011
- Anton Anikin, Alexander Gornov:
An implementation of Newton's method for Keating's potential optimization problems. Stud. Inform. Univ. 9(3): 11-20 (2011) - Pasquale Avella, Maurizio Boccia, Saverio Salerno:
A computational study of dicut reformulation for the Single Source Capacitated Facility Location problem. Stud. Inform. Univ. 9(3): 21-42 (2011) - Mostafa Blidia, Ahmed Bouchou:
On sequences (γk) and (βk) in regular graphs. Stud. Inform. Univ. 9(2): 7-18 (2011) - Richard Bonichon, Pascal Cuoq:
A Mergeable Interval Map. Stud. Inform. Univ. 9(1): 5-37 (2011) - Isma Bouchemakh, Rafik Sahbi:
On a Conjecture of Erwin. Stud. Inform. Univ. 9(2): 144-151 (2011) - Mourad Boudhar, Nacira Chikhi:
Two machine Flow shop with transportation time. Stud. Inform. Univ. 9(2): 50-75 (2011) - Abdelmadjid Boukra, Sadek Bouroubi:
Selection of views to materialize in data warehouse: A cooperative approach. Stud. Inform. Univ. 9(2): 19-37 (2011) - Sadek Bouroubi, Louiza Rezkallah:
An new hybrid cryptosystem based on the satisfiability problem. Stud. Inform. Univ. 9(2): 131-143 (2011) - Mohamed Amine Boutiche:
Topology Control and Maintaining of Graph Invariants. Stud. Inform. Univ. 9(2): 38-49 (2011) - Pierre Castéran, Vincent Filou:
Tasks, Types and Tactics for Local Computation Systems. Stud. Inform. Univ. 9(1): 39-86 (2011) - Sylvain Conchon, Jean-Christophe Filliâtre, Fabrice Le Fessant, Julien Robert, Guillaume Von Tokarski:
Real-Time Monitoring of Ocaml programs. Stud. Inform. Univ. 9(1): 159-185 (2011) - Mehdi Dogguy, Stéphane Glondu, Sylvain Le Gall, Stefano Zacchiroli:
Enforcing Type-Safe Linking using Inter-Package Relationships. Stud. Inform. Univ. 9(1): 129-157 (2011) - Marya Ershova, Oleg V. Khamisov:
A modification of the ellipsoid method. Stud. Inform. Univ. 9(3): 43-64 (2011) - Eduard Kh. Gimadi:
On some Hard-to-Solve versions of the Assignment Problem. Stud. Inform. Univ. 9(3): 65-78 (2011) - Eugeny Goncharov:
A greedy heuristic approach for the Resource-Constrained Project Scheduling Problem. Stud. Inform. Univ. 9(3): 79-90 (2011) - Alexander Gornov, Irina Veyalko:
A global search algorithm based on the Shepard operator for bang-bang optimal control problem. Stud. Inform. Univ. 9(3): 91-104 (2011) - Saïd Hanafi, Claudio Sterle, Anton V. Ushakov, Igor Vasilyev:
A parallel subgradient algorithm for Lagrangean dual function of the p-median problem. Stud. Inform. Univ. 9(3): 105-124 (2011) - Stéphane Lescuyer:
First-Class Containers in Coq. Stud. Inform. Univ. 9(1): 87-127 (2011) - Radia Lessak:
On periodic bilinear processes. Stud. Inform. Univ. 9(2): 76-95 (2011) - Houda Mehri, Taoufik Djemel:
Study and Simulation of Queuing Theory in the Toll Motorway. Stud. Inform. Univ. 9(2): 96-130 (2011) - Genady Shevchenko:
The Pontryagin maximum principle as an optimality criterion for a class of nonlinear control problems. Stud. Inform. Univ. 9(3): 125-134 (2011) - Denis N. Sidorov:
Volterra Equations of the First kind with Discontinuous Kernels in the Theory of Evolving Systems Control. Stud. Inform. Univ. 9(3): 135-146 (2011) - Vladimir Srochko, Vladimir Antonik, Nadezhda Rozinova:
Improvement of Extreme Controls in the Norm Maximization Problem on the Reachable Set. Stud. Inform. Univ. 9(3): 147-160 (2011) - Ider Tseveendorj, Igor Vasilyev:
Preface: Baikal Conference on Optimization Methods and Their Applications. Stud. Inform. Univ. 9(3): 3-6 (2011) - Elvira Yaskova, Oleg V. Khamisov:
Professor Valerian P. Bulatov. Stud. Inform. Univ. 9(3): 7-10 (2011) - Maxim Zarodnyuk, Alexandre Keiko, Boris Kaganovich:
Elaboration of Attainability Region Boundaries in The Model of Extreme Intermediate States. Stud. Inform. Univ. 9(3): 161-175 (2011) - Salim Ziani, Salim Filali:
Improving the Envelope of the LMI Optimization using the Youla Parametrization. Stud. Inform. Univ. 9(2): 152-172 (2011)
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-28 17:05 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