Остановите войну!
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 32 matches
- 2016
- Muqeet Ali, Rezwana Reaz, Mohamed G. Gouda:
Nonrepudiation Protocols Without a Trusted Party. NETYS 2016: 1-15 - Maria Carpen-Amarie, Dave Dice, Gaël Thomas, Pascal Felber:
Transactional Pointers: Experiences with HTM-Based Reference Counting in C++. NETYS 2016: 102-116 - Sara El Aouad, Christophe Dupuy, Renata Teixeira, Francis R. Bach, Christophe Diot:
Exploiting Crowd Sourced Reviews to Explain Movie Recommendation. NETYS 2016: 193-201 - Raphaël P. Barazzutti, Yaroslav Hayduk, Pascal Felber, Etienne Rivière:
Exploiting Concurrency in Domain-Specific Data Structures: A Concurrent Order Book and Workload Generator for Online Trading. NETYS 2016: 16-31 - Yahya Benkaouz, Mohammed Erradi, Anne-Marie Kermarrec:
Nearest Neighbors Graph Construction: Peer Sampling to the Rescue. NETYS 2016: 48-62 - Aissam Berrahou:
Accurate Optimization Method for Allocation of Heterogeneous Resources in Embedded Systems. NETYS 2016: 63-70 - Antoine Blin, Cédric Courtaud, Julien Sopena, Julia Lawall, Gilles Muller:
Understanding the Memory Consumption of the MiBench Embedded Benchmark. NETYS 2016: 71-86 - Quentin Bramas, Sébastien Tixeuil:
Benchmarking Energy-Centric Broadcast Protocols in Wireless Sensor Networks. NETYS 2016: 87-101 - Alami Chaibrassou, Ahmed Mouhsen:
A Multi-channel Energy Efficient Cooperative MIMO Routing Protocol for Clustered WSNs. NETYS 2016: 117-130 - Maitri Chakraborty, Alessia Milani, Miguel A. Mosteiro:
Counting in Practical Anonymous Dynamic Networks is Polynomial. NETYS 2016: 131-136 - Nitin Chiluka, Anne-Marie Kermarrec, Javier Olivares:
The Out-of-core KNN Awakens: - The Light Side of Computation Force on Large Datasets. NETYS 2016: 295-310 - Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro:
Internet Computing: Using Reputation to Select Workers from a Pool. NETYS 2016: 137-153 - Carole Delporte-Gallet, Hugues Fauconnier:
Asynchronous Consensus with Bounded Memory. NETYS 2016: 154-168 - Maroua Drissi, Mohammed Oumsis, Driss Aboutajdine:
A Fuzzy AHP Approach to Network Selection Improvement in Heterogeneous Wireless Networks. NETYS 2016: 169-182 - Niklas Ekström, Seif Haridi:
A Fault-Tolerant Sequentially Consistent DSM with a Compositional Correctness Proof. NETYS 2016: 183-192 - Mouhcine Elgarej, Khalifa Mansouri, Mohamed Youssfi:
Traffic Lights Optimization with Distributed Ant Colony Optimization Based on Multi-agent System. NETYS 2016: 266-279 - Khaled Ben Hafaiedh, Gregor von Bochmann, Guy-Vincent Jourdan, Iosif-Viorel Onut:
Fault Tolerant P2P RIA Crawling. NETYS 2016: 32-47 - Asma El Hamzaoui, Hicham Bensaid, Abdeslam En-Nouaary:
A Formal Model for WebRTC Signaling Using SDL. NETYS 2016: 202-208 - Oliver Jensen, Tyler O'Meara, Mohamed G. Gouda:
Securing NFC Credit Card Payments Against Malicious Retailers. NETYS 2016: 214-228 - Ahmed Khoumsi, Mohamed Erradi, Meryeme Ayache, Wadie Krombi:
An Approach to Resolve NP-Hard Problems of Firewalls. NETYS 2016: 229-243 - Zouheir Labbi, Ahmed Maarof, Mohamed Senhadji, Mostafa Belkasmi:
Hybrid Encryption Approach Using Dynamic Key Generation and Symmetric Key Algorithm for RFID Systems. NETYS 2016: 244-249 - Sanae El Mimouni, Mohamed Bouhdadi:
An Incremental Proof-Based Process of the NetBill Electronic Commerce Protocol. NETYS 2016: 209-213 - Achour Mostéfaoui, Michel Raynal:
Time-Efficient Read/Write Register in Crash-Prone Asynchronous Message-Passing Systems. NETYS 2016: 250-265 - Suha Orhun Mutluergil, Serdar Tasiran:
A Mechanized Refinement Proof of the Chase-Lev Deque Using a Proof System. NETYS 2016: 280-294 - Rachid Oucheikh, Ismail Berrada, Outman El Hichami:
The 4-Octahedron Abstract Domain. NETYS 2016: 311-317 - Ruma R. Paul, Peter Van Roy, Vladimir Vlassov:
Reversible Phase Transitions in a Structured Overlay Network with Churn. NETYS 2016: 318-333 - Anass Rachdi, Abdeslam En-Nouaary, Mohamed Dahchour:
Verification of Common Business Rules in BPMN Process Models. NETYS 2016: 334-339 - Nada Sbihi, Mounir Ghogho:
Is Youtube Popularity Prediction a Good Way to Improve Caching Efficiency? NETYS 2016: 340-344 - Gadi Taubenfeld:
Waiting in Concurrent Algorithms. NETYS 2016: 345-360 - Fouad Yakoubi, Mohamed El Marraki:
Corona Product Complexity of Planar Graph and S-chain Graph. NETYS 2016: 361-366
skipping 2 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-25 19:07 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