Остановите войну!
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 139 matches
- 2023
- Ruizhe Zhang, Xinzhi Zhang:
A Hyperbolic Extension of Kadison-Singer Type Results. ICALP 2023: 108:1-108:14 - Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller:
Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs. ICALP 2023: 62:1-62:13 - Lijie Chen, Xin Lyu, Avishay Tal, Hongxun Wu:
New PRGs for Unbounded-Width/Adaptive-Order Read-Once Branching Programs. ICALP 2023: 39:1-39:20 - James Worrell:
The Skolem Landscape (Invited Talk). ICALP 2023: 5:1-5:2 - Shi Li:
Nearly-Linear Time LP Solvers and Rounding Algorithms for Scheduling Problems. ICALP 2023: 86:1-86:20 - Michal Wlodarczyk:
Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth. ICALP 2023: 106:1-106:20 - Ruiwen Dong:
The Identity Problem in ℤ ≀ ℤ Is Decidable. ICALP 2023: 124:1-124:20 - Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
Context-Bounded Analysis of Concurrent Programs (Invited Talk). ICALP 2023: 3:1-3:16 - Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
Checking Refinement of Asynchronous Programs Against Context-Free Specifications. ICALP 2023: 110:1-110:20 - David G. Harris, Vladimir Kolmogorov:
Parameter Estimation for Gibbs Distributions. ICALP 2023: 72:1-72:21 - Pan Peng, Yuyang Wang:
An Optimal Separation Between Two Property Testing Models for Bounded Degree Directed Graphs. ICALP 2023: 96:1-96:16 - Mohit Garg, Felix Hommelsheim, Nicole Megow:
Matching Augmentation via Simultaneous Contractions. ICALP 2023: 65:1-65:17 - Shu Liu, Chaoping Xing, Chen Yuan:
List Decoding of Rank-Metric Codes with Row-To-Column Ratio Bigger Than 1/2. ICALP 2023: 89:1-89:14 - Yu Chen, Sanjeev Khanna, Zihan Tan:
Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics. ICALP 2023: 37:1-37:16 - Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup:
Optimal Decremental Connectivity in Non-Sparse Graphs. ICALP 2023: 6:1-6:17 - Peyman Afshani, Pingan Cheng, Aniket Basu Roy, Zhewei Wei:
On Range Summary Queries. ICALP 2023: 7:1-7:17 - Ishan Agarwal, Richard Cole:
Stable Matching: Choosing Which Proposals to Make. ICALP 2023: 8:1-8:20 - Daniel Agassy, Dani Dorfman, Haim Kaplan:
Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player. ICALP 2023: 9:1-9:20 - Amirreza Akbari, Navid Eslami, Henrik Lievonen, Darya Melnyk, Joona Särkijärvi, Jukka Suomela:
Locality in Online, Dynamic, Sequential, and Distributed Graph Algorithms. ICALP 2023: 10:1-10:20 - Shyan Akmal, Ce Jin:
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity. ICALP 2023: 11:1-11:20 - Prashanth Amireddy, Ankit Garg, Neeraj Kayal, Chandan Saha, Bhargav Thankey:
Low-Depth Arithmetic Circuit Lower Bounds: Bypassing Set-Multilinearization. ICALP 2023: 12:1-12:20 - Ilan Doron Arad, Ariel Kulik, Hadas Shachnai:
An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets. ICALP 2023: 49:1-49:16 - Yossi Azar, Danny Vainstein:
Multi Layer Peeling for Linear Arrangement and Hierarchical Clustering. ICALP 2023: 13:1-13:18 - Amir Azarmehr, Soheil Behnezhad:
Robust Communication Complexity of Matching: EDCS Achieves 5/6 Approximation. ICALP 2023: 14:1-14:15 - Ishan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur:
Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions. ICALP 2023: 15:1-15:19 - Siddharth Barman, Pooja Kulkarni:
Approximation Algorithms for Envy-Free Cake Division with Connected Pieces. ICALP 2023: 16:1-16:19 - Paul Beame, Niels Kornerup:
Cumulative Memory Lower Bounds for Randomized and Quantum Computation. ICALP 2023: 17:1-17:20 - Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann:
On the Limits of Decision: the Adjacent Fragment of First-Order Logic. ICALP 2023: 111:1-111:21 - Michael Benedikt, Dmitry Chistikov, Alessio Mansutti:
The Complexity of Presburger Arithmetic with Power or Powers. ICALP 2023: 112:1-112:18 - Petra Berenbrink, Lukas Hintze, Hamed Hosseinpour, Dominik Kaaser, Malin Rau:
Dynamic Averaging Load Balancing on Arbitrary Graphs. ICALP 2023: 18:1-18:18
skipping 109 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-26 23:27 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