default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFundamenta Informaticae, Volume 163
Volume 163, Number 1, 2018
- Sara Brunetti
, Paolo Dulio, Andrea Frosini, Grzegorz Rozenberg:
Preface. - Henri Der Sarkissian, Nicola Viganò, Kees Joost Batenburg:
A Data Consistent Variational Segmentation Approach Suitable for Real-time Tomography. 1-20 - Enrica Duchi, Veronica Guerrini, Simone Rinaldi:
A Generating Tree for Permutations Avoiding the Pattern 122+3. 21-39 - Fabien Feschet, Jean-Jacques Lemaire:
Super-resolution in Clinical Conditions: Deep Brain Stimulation Case Study. 41-62 - Matteo Mancini, Mara Cercignani:
Network Models in Neuroimaging: A Survey of Multimodal Applications. 63-91 - Paolo Dulio, Paolo Finotelli, Andrea Frosini, Elisa Pergola, Alice Presenti:
Graph Model Simulation of Human Brain's Functional Activity at Resting State by Means of the FD Model. 93-109
Volume 163, Number 2, 2018
- Rana Faisal Munir, Sergi Nadal, Oscar Romero, Alberto Abelló, Petar Jovanovic, Maik Thiele, Wolfgang Lehner:
Intermediate Results Materialization Selection and Format for Data-Intensive Flows. 111-138 - Stefano Aguzzoli, Stefania Boffa, Davide Ciucci, Brunella Gerla:
Finite IUML-algebras, Finite Forests and Orthopairs. 139-163 - Jakub Michaliszyn, Jan Otop, Piotr Witkowski:
Satisfiability versus Finite Satisfiability in Elementary Modal Logics. 165-188 - Camelia Schiopu, Eleonor Ciurea:
Maximum Flows in Planar Dynamic Networks with Lower Bounds. 189-204 - Lyuyang Tong, Minggang Dong, Bing Ai, Chao Jing:
A Simple Butterfly Particle Swarm Optimization Algorithm with the Fitness-based Adaptive Inertia Weight and the Opposition-based Learning Average Elite Strategy. 205-223
Volume 163, Number 3, 2018
- Panagiotis Charalampopoulos, Maxime Crochemore, Solon P. Pissis:
Preface. i
- Szymon Grabowski, Tomasz Kociumaka, Jakub Radoszewski:
On Abelian Longest Common Factor with and without RLE. 225-244 - Arnab Ganguly, Manish Patil, Rahul Shah, Sharma V. Thankachan:
A Linear Space Data Structure for Range LCP Queries. 245-251 - Mai Alzamel, Jia Gao, Costas S. Iliopoulos, Chang Liu:
Efficient Computation of Palindromes in Sequences with Uncertainties. 253-266 - Sahar Hooshmand, Neda Tavakoli, Paniz Abedin, Sharma V. Thankachan:
On Computing Average Common Substring Over Run Length Encoded Sequences. 267-273 - Neerja Mhaskar, W. F. Smyth:
Frequency Covers for Strings. 275-289 - Supaporn Chairungsee:
Efficient Approaches to Compute Longest Previous Non-overlapping Factor Array. 291-304
Volume 163, Number 4, 2018
- Christopher J. Henry, Aqeel A. Syed:
A Descriptive Tolerance Nearness Measure for Performing Graph Comparison. 305-324 - Behrouz Kheirfam, Afsaneh Nasrollahi:
A Full-Newton Step Interior-point Method Based on a Class of Specific Algebra Transformation. 325-337 - Paul D. Manuel, Sandi Klavzar:
The Graph Theory General Position Problem on Some Interconnection Networks. 339-350 - Sumit Mishra, Samrat Mondal, Sriparna Saha:
Towards Obtaining Upper Bound on Sensitivity Computation Process for Cluster Validity Measures. 351-374 - Dipan Lal Shaw, A. S. M. Shohidull Islam, Shuvasish Karmaker, M. Sohel Rahman:
Approximation Algorithms for Three Dimensional Protein Folding. 375-393 - Miaomiao Tian, Lingyan Wang, Hong Zhong, Jie Chen:
Attribute-based Data Integrity Checking for Cloud Storage. 395-411
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.
last updated on 2025-01-21 20:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
