Остановите войну!
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 50 matches
- 2002
- Jochen Alber, Jirí Fiala:
Geometric Separation and Exact Solutions for the Parameterized Independent Set Problem on Disk Graphs. IFIP TCS 2002: 26-37 - Patrick Baillot:
Checking Polynomial Time Complexity with Types. IFIP TCS 2002: 370-382 - Nikhil Bansal, Zhen Liu, Arvind Sankar:
Bin-Packing with Fragile Objects. IFIP TCS 2002: 38-46 - Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal:
Lower and Upper Bounds for Tracking Mobile Users. IFIP TCS 2002: 47-58 - Alina Beygelzimer, Mitsunori Ogihara:
On the Enumerability of the Determinant and the Rank. IFIP TCS 2002: 59-70 - Douglas M. Blough, Mauro Leoncini, Giovanni Resta, Paolo Santi:
On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks. IFIP TCS 2002: 71-82 - Beate Bollig, Stephan Waack, Philipp Woelfel:
Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. IFIP TCS 2002: 83-94 - Chiara Braghin, Agostino Cortesi, Riccardo Focardi, Steffen van Bakel:
Boundary Inference for Enforcing Security Policies in Mobile Ambients. IFIP TCS 2002: 383-395 - Vasco Brattka, Martin Ziegler:
Computability of Linear Equations. IFIP TCS 2002: 95-106 - Véronique Bruyère, Olivier Carton:
Hierarchy Among Automata on Linear Orderings. IFIP TCS 2002: 107-118 - Gruia Calinescu, Ion I. Mandoiu, Alexander Zelikovsky:
Symmetric Connectivity with Minimum Power Consumption in Radio Networks. IFIP TCS 2002: 119-130 - Zhao Chen:
A Modified Recursive Triangular Factorization for Cauchy-like Systems. IFIP TCS 2002: 131-142 - Hana Chockler, Orna Kupferman:
Coverage of Implementations by Simulating Specifications. IFIP TCS 2002: 409-421 - Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, Emo Welzl:
Algorithmic Complexity of Protein Identification: Searching in Weighted Strings. IFIP TCS 2002: 143-156 - Giovanni Conforti, Orlando Ferrara, Giorgio Ghelli:
TQL Algebra and its Implementation. IFIP TCS 2002: 422-434 - Dino Distefano, Arend Rensink, Joost-Pieter Katoen:
Model Checking Birth and Death. IFIP TCS 2002: 435-447 - Daniel J. Dougherty, Stéphane Lengrand, Pierre Lescanne:
An Improved System of Intersection Types for Explicit Substitutions. IFIP TCS 2002: 511-523 - Marie Duflot, Laurent Fribourg, Claudine Picaronny:
Randomized Dining Philosophers without Fairness Assumption. IFIP TCS 2002: 169-180 - Alon Efrat, Sariel Har-Peled:
Guarding Galleries and Terrains. IFIP TCS 2002: 181-192 - Matthew Fluet, Riccardo Pucella:
Phantom Types and Subtyping. IFIP TCS 2002: 448-460 - Leszek Gasieniec, Igor Potapov:
Gossiping with Unit Messages in Known Radio Networks. IFIP TCS 2002: 193-205 - Andrew D. Gordon:
XML Web Services: The Global Computer? IFIP TCS 2002: 355 - Jozef Gruska, Hiroshi Imai, Keiji Matsumoto:
Power of Quantum Entanglement. IFIP TCS 2002: 3-22 - Rachid Guerraoui, Petr Kouznetsov:
On the Weakest Failure Detector for Non-Blocking Atomic Commit. IFIP TCS 2002: 461-473 - Carl A. Gunter:
Micro Mobile Programs. IFIP TCS 2002: 356-369 - Nicolas Hanusse, Dimitris J. Kavvadias, Evangelos Kranakis, Danny Krizanc:
Memoryless Search Algorithms in a Network with Faulty Advice. IFIP TCS 2002: 206-216 - Lane A. Hemaspaandra, Mayur Thakur:
Lower Bounds and the Hardness of Counting Properties. IFIP TCS 2002: 217-229 - Matthew Hertz, Neil Immerman, J. Eliot B. Moss:
Framework for Analyzing Garbage Collection. IFIP TCS 2002: 230-242 - Christopher M. Homan, Mayur Thakur:
One-Way Permutations and Self-Witnessing Languages. IFIP TCS 2002: 243-254 - Martin Hyland, Gordon D. Plotkin, John Power:
Combining Computational Effects: commutativity & sum. IFIP TCS 2002: 474-484
skipping 20 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-04-25 18:49 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