Остановите войну!
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 130 matches
- 2002
- Cédric Adjih, Leonidas Georgiadis, Philippe Jacquet, Wojciech Szpankowski:
Is the internet fractal? SODA 2002: 338-345 - Micah Adler, Dan Rubenstein:
Pricing multicasting in more practical network models. SODA 2002: 981-990 - Pankaj K. Agarwal, Herbert Edelsbrunner, Yusu Wang:
Computing the writhing number of a polygonal knot. SODA 2002: 791-799 - Pankaj K. Agarwal, Micha Sharir:
Pseudo-line arrangements: duality, algorithms, and applications. SODA 2002: 800-809 - Noga Alon, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan:
Guessing secrets efficiently via list decoding. SODA 2002: 254-262 - Noga Alon, Asaf Shapira:
Testing satisfiability. SODA 2002: 645-654 - Stephen Alstrup, Theis Rauhe:
Improved labeling scheme for ancestor queries. SODA 2002: 947-953 - Amihood Amir, Kenneth Ward Church, Emanuel Dar:
Separable attributes: a technique for solving the sub matrices character count problem. SODA 2002: 400-401 - Edward J. Anderson, Chris N. Potts:
On-line scheduling of a single machine to minimize total weighted completion time. SODA 2002: 548-557 - Matthew Andrews, Lisa Zhang:
Scheduling protocols for switches with large envelopes. SODA 2002: 443-452 - Aaron Archer, Éva Tardos:
Frugal path mechanisms. SODA 2002: 991-999 - Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell, Martin Skutella:
The freeze-tag problem: how to wake up a swarm of robots. SODA 2002: 568-577 - Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev:
Temporary tasks assignment resolved. SODA 2002: 116-124 - Sanjeev Arora, Bo Brinkman:
A randomized online algorithm for bandwidth utilization. SODA 2002: 535-539 - Sunil Arya, Theocharis Malamatos:
Linear-size approximate voronoi diagrams. SODA 2002: 147-155 - Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama:
Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning. SODA 2002: 896-904 - Brian Babcock, Mayur Datar, Rajeev Motwani:
Sampling from a moving window over streaming data. SODA 2002: 633-634 - Amotz Bar-Noy, Ari Freund, Shimon Landa, Joseph Naor:
Competitive on-line switching policies. SODA 2002: 525-534 - Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai:
Throughput maximization of real-time scheduling with batching. SODA 2002: 742-751 - Amotz Bar-Noy, Richard E. Ladner:
Windows scheduling problems for broadcast systems. SODA 2002: 433-442 - Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira:
Scheduling split intervals. SODA 2002: 732-741 - Ziv Bar-Yossef, Kirsten Hildrum, Felix Wu:
Incentive-compatible online auctions for digital goods. SODA 2002: 964-970 - Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar:
Reductions in streaming algorithms, with an application to counting triangles in graphs. SODA 2002: 623-632 - Jérémy Barbay, Claire Kenyon:
Adaptive intersection and t-threshold problems. SODA 2002: 390-399 - József Beck, Sachin Lodha:
Efficient proper 2-coloring of almost disjoint hypergraphs. SODA 2002: 598-605 - Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu:
A locality-preserving cache-oblivious dynamic dictionary. SODA 2002: 29-38 - Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman:
Improved algorithms for stretch scheduling. SODA 2002: 762-771 - Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan:
Slice and dice: a simple, improved approximate tiling recipe. SODA 2002: 455-464 - Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan:
Simple approximation algorithm for nonoverlapping local alignments. SODA 2002: 677-678 - Piotr Berman, Marek Karpinski:
Approximating minimum unsatisfiability of linear equations. SODA 2002: 514-516
skipping 100 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-02 12:45 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