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 39 matches
- 2015
- Andris Ambainis, Jevgenijs Vihrovs:
Size of Sets with Small Sensitivity: A Generalization of Simon's Lemma. TAMC 2015: 122-133 - Nikhil Balaji, Samir Datta:
Bounded Treewidth and Space-Efficient Linear Algebra. TAMC 2015: 297-308 - Kaspars Balodis, Janis Iraids, Rusins Freivalds:
Structured Frequency Algorithms. TAMC 2015: 50-61 - Maciej Bendkowski, Katarzyna Grygiel, Marek Zaionc:
Asymptotic Properties of Combinatory Logic. TAMC 2015: 62-72 - Arijit Bishnu, Sameer Desai, Arijit Ghosh, Mayank Goswami, Subhabrata Paul:
Uniformity of Point Samples in Metric Spaces Using Gap Ratio. TAMC 2015: 347-358 - Anthony Bonato, Marc Lozier, Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat:
The Domination Number of On-line Social Networks and Random Geometric Graphs. TAMC 2015: 150-163 - Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Finding Effectors. TAMC 2015: 224-235 - Laurent Bulteau, Vincent Froese, Nimrod Talmon:
Multi-player Diffusion Games on Graph Classes. TAMC 2015: 200-211 - Douglas Cenzer, Christopher P. Porter:
Algorithmically Random Functions and Effective Capacities. TAMC 2015: 23-37 - Xujin Chen, Xiao-Dong Hu, Changjun Wang:
Finding Connected Dense k -Subgraphs. TAMC 2015: 248-259 - Ankush Das, Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi, Dominik Wojtczak:
On Pure Nash Equilibria in Stochastic Games. TAMC 2015: 359-371 - Ning Ding:
Some New Consequences of the Hypothesis That P Has Fixed Polynomial-Size Circuits. TAMC 2015: 75-86 - Vu C. Dinh, Lam Si Tung Ho, Viet Cuong Nguyen, Duy M. H. Nguyen, Binh T. Nguyen:
Learning from Non-iid Data: Fast Rates for the One-vs-All Multiclass Plug-in Classifiers. TAMC 2015: 375-387 - Pavel Dvorak, Dusan Knop:
Parametrized Complexity of Length-Bounded Cuts and Multi-cuts. TAMC 2015: 441-452 - Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
Deletion Operations on Deterministic Families of Automata. TAMC 2015: 388-399 - Stefano Facchini, Simon Perdrix:
Quantum Circuits for the Unitary Permutation Problem. TAMC 2015: 324-331 - Arash Farzan, Alejandro López-Ortiz, Patrick K. Nicholson, Alejandro Salinger:
Algorithms in the Ultra-Wide Word Model. TAMC 2015: 335-346 - Henning Fernau, Alejandro López-Ortiz, Jazmín Romero:
Kernelization Algorithms for Packing Problems Allowing Overlaps. TAMC 2015: 415-427 - Lance Fortnow:
Nondeterministic Separations. TAMC 2015: 10-17 - Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa:
Parameterized Complexity of Asynchronous Border Minimization. TAMC 2015: 428-440 - Sepp Hartung, Nimrod Talmon:
The Complexity of Degree Anonymization by Graph Contractions. TAMC 2015: 260-271 - Xin He, Dayu He:
Star Shaped Orthogonal Drawing. TAMC 2015: 137-149 - Dayu He, Xin He:
A Linear Time Algorithm for Determining Almost Bipartite Graphs. TAMC 2015: 164-176 - Takehiro Ito, Hirotaka Ono, Yota Otachi:
Reconfiguration of Cliques in a Graph. TAMC 2015: 212-223 - Raghav Kulkarni, Youming Qiao, Xiaoming Sun:
On the Power of Parity Queries in Boolean Decision Trees. TAMC 2015: 99-109 - Nans Lefebvre:
The First-Order Contiguity of Sparse Random Graphs with Prescribed Degrees. TAMC 2015: 177-188 - Jin-Yong Lin, Sheung-Hung Poon:
Algorithms and Hardness for Signed Domination. TAMC 2015: 453-464 - Nadine Losert:
Where Join Preservation Fails in the Bounded Turing Degrees of C.E. Sets. TAMC 2015: 38-49 - Takuya Nishida, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone:
Card-Based Protocols for Any Boolean Function. TAMC 2015: 110-121 - Mitsunori Ogihara, Kei Uchizawa:
Computational Complexity Studies of Synchronous Boolean Finite Dynamical Systems. TAMC 2015: 87-98
skipping 9 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-09-25 20:51 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