


Остановите войну!
for scientists:
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 197 matches
- 2022
- Gilles Perrot, Stéphane Domas, Raphaël Couturier
:
How separable median filters can get better results than full 2D versions. J. Supercomput. 78(7): 10118-10148 (2022) - Razvan-Gabriel Cirstea, Bin Yang, Chenjuan Guo, Tung Kieu, Shirui Pan:
Towards Spatio-Temporal Aware Traffic Time Series Forecasting-Full Version. CoRR abs/2203.15737 (2022) - Nguyen Ho, Van Long Ho, Torben Bach Pedersen, Mai Vu, Christophe A. N. Biscio:
A Unified Approach for Multi-Scale Synchronous Correlation Search in Big Time Series - Full Version. CoRR abs/2204.09131 (2022) - Razvan-Gabriel Cirstea, Chenjuan Guo, Bin Yang, Tung Kieu, Xuanyi Dong, Shirui Pan:
Triformer: Triangular, Variable-Specific Attentions for Long Sequence Multivariate Time Series Forecasting-Full Version. CoRR abs/2204.13767 (2022) - Simon Marynissen, Jesse Heyninck, Bart Bogaerts, Marc Denecker:
On Nested Justification Systems (full version). CoRR abs/2205.04541 (2022) - Todd Wareham, Marieke Sweers:
Exploring Viable Algorithmic Options for Automatically Creating and Reconfiguring Component-based Software Systems: A Computational Complexity Approach (Full Version). CoRR abs/2205.05001 (2022) - Bernd Finkbeiner, Niklas Metzger, Yoram Moses:
Information Flow Guided Synthesis (Full Version). CoRR abs/2205.12085 (2022) - Gowri R. Chandran, Carmit Hazay, Robin Hundt, Thomas Schneider:
Comparison-Based MPC in Star Topology (Full Version). IACR Cryptol. ePrint Arch. 2022: 574 (2022) - Jincheol Ha, Seongkwang Kim, ByeongHak Lee, Jooyoung Lee, Mincheol Son:
Rubato: Noisy Ciphers for Approximate Homomorphic Encryption (Full Version). IACR Cryptol. ePrint Arch. 2022: 537 (2022) - Kosei Sakamoto, Fukang Liu, Yuto Nakano, Shinsaku Kiyomoto, Takanori Isobe:
Rocca: An Efficient AES-based Encryption Scheme for Beyond 5G (Full version). IACR Cryptol. ePrint Arch. 2022: 116 (2022) - Joachim Vandersmissen, Adrián Ranea, Bart Preneel:
A White-Box Speck Implementation using Self-Equivalence Encodings (Full Version). IACR Cryptol. ePrint Arch. 2022: 444 (2022) - 2021
- Zhen Wang, Guopeng Zhang, Qiu Wang, Kezhi Wang, Kun Yang:
Completion Time Minimization in Wireless-Powered UAV-Assisted Data Collection System (Full Version). CoRR abs/2102.00642 (2021) - Véronique Bruyère, Jean-François Raskin, Clément Tamines:
Stackelberg-Pareto Synthesis (Full Version). CoRR abs/2102.08925 (2021) - Bérénice Delcroix-Oger, Florent Hivert, Patxi Laborde-Zubieta, Jean-Christophe Aval, Adrien Boussicault:
Non-ambiguous trees: new results and generalisation (Full version). CoRR abs/2103.07294 (2021) - Bernd Finkbeiner, Gideon Geier, Noemi Passing:
Specification Decomposition for Reactive Synthesis (Full Version). CoRR abs/2103.08459 (2021) - Manuel Gieseking, Nick Würdemann:
Canonical Representations for Direct Generation of Strategies in High-level Petri Games (Full Version). CoRR abs/2103.10207 (2021) - Razvan-Gabriel Cirstea, Chenjuan Guo, Bin Yang:
Graph Attention Recurrent Neural Networks for Correlated Time Series Forecasting - Full version. CoRR abs/2103.10760 (2021) - Henderik Alex Proper, Theo P. van der Weide:
A General Theory for the Evolution of Application Models - Full version. CoRR abs/2105.11308 (2021) - Yuedan Chen, M. Tamer Özsu, Guoqing Xiao, Zhuo Tang, Kenli Li:
GSmart: An Efficient SPARQL Query Engine Using Sparse Matrix Algebra - Full Version. CoRR abs/2106.14038 (2021) - Bernd Finkbeiner, Noemi Passing:
Compositional Synthesis of Modular Systems (Full Version). CoRR abs/2106.14783 (2021) - Sarah Winter:
Decision problems for origin-close top-down tree transducers (full version). CoRR abs/2107.02591 (2021) - Xian Zhang, Xiaobing Guo, Zixuan Zeng, Wenyan Liu, Zhongxin Guo, Yang Chen, Shuo Chen, Qiufeng Yin, Mao Yang, Lidong Zhou:
Argus: A Fully Transparent Incentive System for Anti-Piracy Campaigns (Extended Version). CoRR abs/2107.06049 (2021) - Punam Biswas, Tanzima Hashem, Muhammad Aamir Cheema:
Safest Nearby Neighbor Queries in Road Networks (Full Version). CoRR abs/2107.14122 (2021) - Marten Maack, Friedhelm Meyer auf der Heide, Simon Pukrop:
Full Version - Server Cloud Scheduling. CoRR abs/2108.02109 (2021) - Ori Roth:
Study of the Subtyping Machine of Nominal Subtyping with Variance (full version). CoRR abs/2109.03950 (2021) - Axel Feldmann, Nikola Samardzic, Aleksandar Krastev, Srini Devadas, Ronald G. Dreslinski, Karim Eldefrawy, Nicholas Genise, Chris Peikert, Daniel Sánchez:
F1: A Fast and Programmable Accelerator for Fully Homomorphic Encryption (Extended Version). CoRR abs/2109.05371 (2021) - Fariha Tabassum Islam, Tanzima Hashem, Rifat Shahriyar:
A Crowd-enabled Solution for Privacy-Preserving and Personalized Safe Route Planning for Fixed or Flexible Destinations (Full Version). CoRR abs/2112.13760 (2021) - Siwei Chen, Zejun Xiang, Xiangyong Zeng, Shasha Zhang:
On the Relationships between Different Methods for Degree Evaluation (Full Version). IACR Cryptol. ePrint Arch. 2021: 175 (2021) - Wonseok Choi, ByeongHak Lee, Jooyoung Lee, Yeongmin Lee:
Toward a Fully Secure Authenticated Encryption Scheme From a Pseudorandom Permutation (Full Version). IACR Cryptol. ePrint Arch. 2021: 1168 (2021) - 2020
- Philipp Muth, Matthias Geihs, Tolga Arul
, Johannes Buchmann, Stefan Katzenbeisser:
ELSA: efficient long-term secure storage of large datasets (full version) ∗. EURASIP J. Inf. Secur. 2020: 9 (2020)
skipping 167 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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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.
Tweets on dblp homepage
Show tweets from on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
retrieved on 2022-07-06 03:52 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