TDG
Scholar
Committed to research!
Version 1.7
Home
|
Bibliography
|
Writers
|
Journals
|
Conferences
|
Publishers
Help
|
News
Bibliography
Refine on click
|
Report
|
Share
More than 125 records were found in 1.094 seconds
Fetch
|
Report
|
Google
Deterministic improved round-trip spanners
Chun Jiang Zhu
,
Kam-yiu Lam
Inf. Process. Lett.
,
12957-60
,
2018
Fetch
|
Report
|
Google
Research on dynamic heuristic scanning technique and the application of the malicious code detection model
Bo Zhang
,
Qianmu Li
,
Yuanyuan Ma
Inf. Process. Lett.
,
11719-24
,
2017
Fetch
|
Report
|
Google
Rating prediction using review texts with underlying sentiments
Dongjin Yu
,
Yunlei Mu
,
Yike Jin
Inf. Process. Lett.
,
11710-18
,
2017
Fetch
|
Report
|
Google
Simple DFS on the complement of a graph and on partially complemented digraphs
Benson L. Joeris
,
Nathan Lindzey
,
Ross M. McConnell
,
Nissa Osheim
Inf. Process. Lett.
,
11735-39
,
2017
Fetch
|
Report
|
Google
The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs
Keaitsuda Maneeruk Nakprasit
,
Kittikorn Nakprasit
Inf. Process. Lett.
,
11740-44
,
2017
Fetch
|
Report
|
Google
Non-cooperative capacitated facility location games
Félix Carvalho Rodrigues
,
Eduardo Candido Xavier
Inf. Process. Lett.
,
11745-53
,
2017
Fetch
|
Report
|
Google
Clique-heavy subgraphs and pancyclicity of 2-connected graphs
Wojciech Widel
Inf. Process. Lett.
,
1176-9
,
2017
Fetch
|
Report
|
Google
Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling
Georg von der Bruggen
,
Jian-Jia Chen
,
Robert I. Davis
,
Wen-Hung Huang
Inf. Process. Lett.
,
1171-5
,
2017
Fetch
|
Report
|
Google
A novel adaptive feature selector for supervised classification
S. Sasikala
,
S. Appavu alias Balamurugan
,
S. Geetha
Inf. Process. Lett.
,
11725-34
,
2017
Fetch
|
Report
|
Google
The clique-transversal set problem in {claw, K
4
}-free planar graphs
Zuosong Liang
,
Erfang Shan
,
Liying Kang
Inf. Process. Lett.
,
11864-68
,
2017
Fetch
|
Report
|
Google
Optimal suffix sorting and LCP array construction for constant alphabets
Felipe Alves da Louza
,
Simon Gog
,
Guilherme P. Telles
Inf. Process. Lett.
,
11830-34
,
2017
Fetch
|
Report
|
Google
Merging almost sorted sequences yields a 24-sorter
Thorsten Ehlers
Inf. Process. Lett.
,
11817-20
,
2017
Fetch
|
Report
|
Google
Equivariant algorithms for constraint satisfaction problems over coset templates
Slawomir Lasota
Inf. Process. Lett.
,
11844-52
,
2017
Fetch
|
Report
|
Google
A note on Thue games
Robert Mercas
,
Dirk Nowotka
Inf. Process. Lett.
,
11875-77
,
2017
Fetch
|
Report
|
Google
Energy efficient modular exponentiation for public-key cryptography based on bit forwarding techniques
Satyanarayana Vollala
,
Natarajan Ramasubramanian
Inf. Process. Lett.
,
11925-38
,
2017
Fetch
|
Report
|
Google
PTAS for minimum k-path vertex cover in ball graph
Zhao Zhang
,
Xiaoting Li
,
Yishuo Shi
,
Hongmei Nie
,
Yuqing Zhu
Inf. Process. Lett.
,
1199-13
,
2017
Fetch
|
Report
|
Google
Good self-dual generalized quasi-cyclic codes exist
Minjia Shi
,
Liqin Qian
,
Yan Liu
,
Patrick Solé
Inf. Process. Lett.
,
11821-24
,
2017
Fetch
|
Report
|
Google
Upper and lower bounds for the q-entropy of network models with application to network model selection
Mostafa Haghir Chehreghani
,
Talel Abdessalem
Inf. Process. Lett.
,
1191-8
,
2017
Fetch
|
Report
|
Google
A polynomial-time algorithm for computing low CP-rank decompositions
Khaled M. Elbassioni
,
Trung Thanh Nguyen 0004
Inf. Process. Lett.
,
11810-14
,
2017
Fetch
|
Report
|
Google
Checking strict positivity of Kraus maps is NP-hard
Stéphane Gaubert
,
Zheng Qu
Inf. Process. Lett.
,
11835-43
,
2017
Fetch
|
Report
|
Google
On pattern matching with k mismatches and few don't cares
Marius Nicolae
,
Sanguthevar Rajasekaran
Inf. Process. Lett.
,
11878-82
,
2017
Fetch
|
Report
|
Google
A short note on Merlin-Arthur protocols for subset sum
Jesper Nederlof
Inf. Process. Lett.
,
11815-16
,
2017
Fetch
|
Report
|
Google
On the two largest distance eigenvalues of graph powers
Rundan Xing
,
Bo Zhou
Inf. Process. Lett.
,
11939-43
,
2017
Fetch
|
Report
|
Google
Periodicity in rectangular arrays
Guilhem Gamard
,
Gwénaël Richomme
,
Jeffrey Shallit
,
Taylor J. Smith
Inf. Process. Lett.
,
11858-63
,
2017
Fetch
|
Report
|
Google
Fully polynomial-time computation of maximum likelihood trajectories in Markov chains
Yuri Grinberg
,
Theodore J. Perkins
Inf. Process. Lett.
,
11853-57
,
2017
Fetch
|
Report
|
Google
A revised result on chasing tree patterns under schema graphs
Junhu Wang
,
Jeffrey Xu Yu
,
Jixue Liu
,
Chaoyi Pang
Inf. Process. Lett.
,
11919-24
,
2017
Fetch
|
Report
|
Google
A distributed leader election algorithm in crash-recovery and omissive systems
Christian Fernández-Campusano
,
Mikel Larrea
,
Roberto Cortiñas
,
Michel Raynal
Inf. Process. Lett.
,
118100-104
,
2017
Fetch
|
Report
|
Google
Ciphertext-only attack on d × d Hill in O(d13
d
)
Shahram Khazaei
,
Siavash Ahmadi
Inf. Process. Lett.
,
11825-29
,
2017
Fetch
|
Report
|
Google
Refined algorithms for hitting many intervals
Peter Damaschke
Inf. Process. Lett.
,
118117-122
,
2017
Fetch
|
Report
|
Google
Residuation for bipolar preferences in soft constraints
Fabio Gadducci
,
Francesco Santini
Inf. Process. Lett.
,
11869-74
,
2017
Fetch
|
Report
|
Google
Group-based collective keyword querying in road networks
Sen Su
,
Sen Zhao
,
Xiang Cheng
,
Rong Bi
,
Xin Cao
,
Jie Wang 0002
Inf. Process. Lett.
,
11883-90
,
2017
Fetch
|
Report
|
Google
Diagnosable evaluation of enhanced optical transpose interconnection system networks
Chang-Hsiung Tsai
,
Jheng-Cheng Chen
Inf. Process. Lett.
,
118105-109
,
2017
Fetch
|
Report
|
Google
A characterization of trees with equal independent domination and secure domination numbers
Zepeng Li
,
Jin Xu
Inf. Process. Lett.
,
11914-18
,
2017
Fetch
|
Report
|
Google
The emptiness problem for tree automata with at least one global disequality constraint is NP-hard
Pierre-Cyrille Héam
,
Vincent Hugot
,
Olga Kouchnarenko
Inf. Process. Lett.
,
1186-9
,
2017
Fetch
|
Report
|
Google
Area-universal drawings of biconnected outerplane graphs
Yi-Jun Chang
,
Hsu-Chun Yen
Inf. Process. Lett.
,
1181-5
,
2017
Fetch
|
Report
|
Google
Inexact feasibility pump for mixed integer nonlinear programming
M. Li
,
Q. Liu
Inf. Process. Lett.
,
118110-116
,
2017
Fetch
|
Report
|
Google
Computing the clique-separator graph for an interval graph in linear time
Louis Ibarra
Inf. Process. Lett.
,
12421-25
,
2017
Fetch
|
Report
|
Google
Improved improbable differential attacks on ISO standard CLEFIA: Expansion technique revisited
Cihangir Tezcan
,
Ali Aydin Selçuk
Inf. Process. Lett.
,
116(2):136-143
,
2016
Fetch
|
Report
|
Google
The (non-)existence of perfect codes in Fibonacci cubes
Ali Reza Ashrafi
,
Jernej Azarija
,
Azam Babai
,
Khadijeh Fathalikhani
,
Sandi Klavzar
Inf. Process. Lett.
,
116(5):387-390
,
2016
Fetch
|
Report
|
Google
Paired 2-disjoint path covers of multidimensional torus networks with faulty edges
Xie-Bin Chen
Inf. Process. Lett.
,
116(2):107-110
,
2016
Fetch
|
Report
|
Google
Generalized MitM attacks on full TWINE
Mohamed Tolba
,
Amr M. Youssef
Inf. Process. Lett.
,
116(2):128-135
,
2016
Fetch
|
Report
|
Google
Capacity and delay analysis in delay tolerant network with multiple communities
Yahui Wu
,
Su Deng
,
Hongbin Huang
Inf. Process. Lett.
,
116(4):310-315
,
2016
Fetch
|
Report
|
Google
Breaking an ID-based encryption based on discrete logarithm and factorization problems
Chik How Tan
,
Theo Fanuela Prabowo
,
Duc-Phong Le
Inf. Process. Lett.
,
116(2):116-119
,
2016
Fetch
|
Report
|
Google
Improving counting Bloom filter performance with fingerprints
Salvatore Pontarelli
,
Pedro Reviriego
,
Juan Antonio Maestro
Inf. Process. Lett.
,
116(4):304-309
,
2016
Fetch
|
Report
|
Google
Black-box complexity: Advantages of memory usage
Tobias Storch
Inf. Process. Lett.
,
116(6):428-432
,
2016
Fetch
|
Report
|
Google
On security analysis of an after-the-fact leakage resilient key exchange protocol
Zheng Yang
,
Shuangqing Li
Inf. Process. Lett.
,
116(1):33-40
,
2016
Fetch
|
Report
|
Google
A bounded space algorithm for online circle packing
Pedro Hokama
,
Flávio Keidi Miyazawa
,
Rafael C. S. Schouery
Inf. Process. Lett.
,
116(5):337-342
,
2016
Fetch
|
Report
|
Google
Sufficient conditions for triangle-free graphs to be super k-restricted edge-connected
Jun Yuan
,
Aixia Liu
Inf. Process. Lett.
,
116(2):163-167
,
2016
Fetch
|
Report
|
Google
On the semantics of Strategy Logic
Patricia Bouyer
,
Patrick Gardy
,
Nicolas Markey
Inf. Process. Lett.
,
116(2):75-79
,
2016
Fetch
|
Report
|
Google
A randomized algorithm for long directed cycle
Meirav Zehavi
Inf. Process. Lett.
,
116(6):419-422
,
2016
Fetch
|
Report
|
Google
Amortized rotation cost in AVL trees
Mahdi Amani
,
Kevin A. Lai
,
Robert E. Tarjan
Inf. Process. Lett.
,
116(5):327-330
,
2016
Fetch
|
Report
|
Google
Extension of the edge tracing algorithm to disconnected Voronoi skeletons
Martin Manak
,
Ivana Kolingerová
Inf. Process. Lett.
,
116(2):85-92
,
2016
Fetch
|
Report
|
Google
On the efficiency of localized work stealing
Warut Suksompong
,
Charles E. Leiserson
,
Tao B. Schardl
Inf. Process. Lett.
,
116(2):100-106
,
2016
Fetch
|
Report
|
Google
Enhance fuzzy vault security using nonrandom chaff point generator
Minh Tan Nguyen
,
Quang Hai Truong
,
Tran Khanh Dang
Inf. Process. Lett.
,
116(1):53-64
,
2016
Fetch
|
Report
|
Google
NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting
Robert Bredereck
,
Nimrod Talmon
Inf. Process. Lett.
,
116(2):147-152
,
2016
Fetch
|
Report
|
Google
A note on graph proper total colorings with many distinguishing constraints
Chao Yang
,
Bing Yao
,
Han Ren
Inf. Process. Lett.
,
116(6):396-400
,
2016
Fetch
|
Report
|
Google
Compact representations of automata for regular expression matching
Meng Zhang
,
Yi Zhang
,
Chen Hou
Inf. Process. Lett.
,
116(12):750-756
,
2016
Fetch
|
Report
|
Google
Palindromic rich words and run-length encodings
Chuan Guo
,
Jeffrey Shallit
,
Arseny M. Shur
Inf. Process. Lett.
,
116(12):735-738
,
2016
Fetch
|
Report
|
Google
Signed digit data hiding scheme
Wen-Chung Kuo
,
Chun-Cheng Wang
,
Hong-Ching Hou
Inf. Process. Lett.
,
116(2):183-191
,
2016
Fetch
|
Report
|
Google
Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths
Florian Barbero
,
Gregory Gutin
,
Mark Jones
,
Bin Sheng
,
Anders Yeo
Inf. Process. Lett.
,
116(6):433-436
,
2016
Fetch
|
Report
|
Google
Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs
Yuki Kobayashi
,
Yuya Higashikawa
,
Naoki Katoh
,
Adnan Sljoka
Inf. Process. Lett.
,
116(2):175-178
,
2016
Fetch
|
Report
|
Google
The super connectivity of exchanged crossed cube
Wantao Ning
Inf. Process. Lett.
,
116(2):80-84
,
2016
Fetch
|
Report
|
Google
On the complexity of exchanging
Xavier Molinero
,
Martin Olsen
,
Maria J. Serna
Inf. Process. Lett.
,
116(6):437-441
,
2016
Fetch
|
Report
|
Google
Linear cryptanalysis of reduced-round SPECK
Yu Liu
,
Kai Fu
,
Wei Wang 0035
,
Ling Sun
,
Meiqin Wang
Inf. Process. Lett.
,
116(3):259-266
,
2016
Fetch
|
Report
|
Google
Flower Pollination Algorithm with Bee Pollinator for cluster analysis
Rui Wang
,
Yongquan Zhou
,
Shilei Qiao
,
Kang Huang
Inf. Process. Lett.
,
116(1):1-14
,
2016
Fetch
|
Report
|
Google
On the construction of all shortest node-disjoint paths in star networks
Cheng-Nan Lai
Inf. Process. Lett.
,
116(4):299-303
,
2016
Fetch
|
Report
|
Google
Bounds on 2-query Locally Testable Codes with affine tests
Gillat Kol
,
Ran Raz
Inf. Process. Lett.
,
116(8):521-525
,
2016
Fetch
|
Report
|
Google
Faster algorithms for single machine scheduling with release dates and rejection
Jinwen Ou
,
Xueling Zhong
,
Chung-Lun Li
Inf. Process. Lett.
,
116(8):503-507
,
2016
Fetch
|
Report
|
Google
Testing whether the uniform distribution is a stationary distribution
Sourav Chakraborty 0001
,
Akshay Kamath
,
Rameshwar Pratap
Inf. Process. Lett.
,
116(7):475-480
,
2016
Fetch
|
Report
|
Google
Efficient multi-party concurrent signature from lattices
Xinyin Xiang
,
Hui Li
,
Mingyu Wang
,
Xingwen Zhao
Inf. Process. Lett.
,
116(8):497-502
,
2016
Fetch
|
Report
|
Google
Generalizing fixed-priority scheduling for better schedulability in mixed-criticality systems
Yao Chen
,
Kang G. Shin
,
Huagang Xiong
Inf. Process. Lett.
,
116(8):508-512
,
2016
Fetch
|
Report
|
Google
Finding a chain graph in a bipartite permutation graph
Masashi Kiyomi
,
Yota Otachi
Inf. Process. Lett.
,
116(9):569-573
,
2016
Fetch
|
Report
|
Google
Simultaneous image fusion and demosaicing via compressive sensing
Bin Yang
,
Jie Luo
,
Ling Guo
,
Fang Cheng
Inf. Process. Lett.
,
116(7):447-454
,
2016
Fetch
|
Report
|
Google
On purely tree-colorable planar graphs
Jin Xu
,
Zepeng Li
,
Enqiang Zhu
Inf. Process. Lett.
,
116(8):532-536
,
2016
Fetch
|
Report
|
Google
(EC)DSA lattice attacks based on Coppersmith's method
Konstantinos A. Draziotis
Inf. Process. Lett.
,
116(8):541-545
,
2016
Fetch
|
Report
|
Google
A faster fixed parameter algorithm for two-layer crossing minimization
Yasuaki Kobayashi
,
Hisao Tamaki
Inf. Process. Lett.
,
116(9):547-549
,
2016
Fetch
|
Report
|
Google
Static analysis of navigational XPath over graph databases
Egor V. Kostylev
,
Juan L. Reutter
,
Domagoj Vrgoc
Inf. Process. Lett.
,
116(7):467-474
,
2016
Fetch
|
Report
|
Google
A Hybrid Biased Random Key Genetic Algorithm for the Quadratic Assignment Problem
Eduardo Lalla-Ruiz
,
Christopher Expósito Izquierdo
,
Belén Melián-Batista
,
J. Marcos Moreno-Vega
Inf. Process. Lett.
,
116(8):513-520
,
2016
Fetch
|
Report
|
Google
Correlation lower bounds from correlation upper bounds
Shiteng Chen
,
Periklis A. Papakonstantinou
Inf. Process. Lett.
,
116(8):537-540
,
2016
Fetch
|
Report
|
Google
Topological orderings of weighted directed acyclic graphs
Dániel Gerbner
,
Balázs Keszegh
,
Cory Palmer
,
Dömötör Pálvölgyi
Inf. Process. Lett.
,
116(9):564-568
,
2016
Fetch
|
Report
|
Google
A note on the size of prenex normal forms
Frederik Harwath
Inf. Process. Lett.
,
116(7):443-446
,
2016
Fetch
|
Report
|
Google
Scalable generation of scale-free graphs
Peter Sanders 0001
,
Christian Schulz 0003
Inf. Process. Lett.
,
116(7):489-491
,
2016
Fetch
|
Report
|
Google
The g-good-neighbor conditional diagnosability of n-dimensional hypercubes under the MM
⁎
model
Shiying Wang
,
Weiping Han
Inf. Process. Lett.
,
116(9):574-577
,
2016
Fetch
|
Report
|
Google
A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs
Kenjiro Takazawa
Inf. Process. Lett.
,
116(9):550-553
,
2016
Fetch
|
Report
|
Google
Hamiltonian decomposition of generalized recursive circulant graphs
Y-Chuang Chen
,
Tsung-Han Tsai
Inf. Process. Lett.
,
116(9):585-589
,
2016
Fetch
|
Report
|
Google
Locally exchanged twisted cubes: Connectivity and super connectivity
Jou-Ming Chang
,
Xiang-Rui Chen
,
Jinn-Shyong Yang
,
Ro-Yu Wu
Inf. Process. Lett.
,
116(7):460-466
,
2016
Fetch
|
Report
|
Google
Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
Yang Fang
,
Xiwen Lu
Inf. Process. Lett.
,
116(8):526-531
,
2016
Fetch
|
Report
|
Google
Improved balanced flow computation using parametric flow
Omar Darwish
,
Kurt Mehlhorn
Inf. Process. Lett.
,
116(9):560-563
,
2016
Fetch
|
Report
|
Google
MMH
⁎
with arbitrary modulus is always almost-universal
Khodakhast Bibak
,
Bruce M. Kapron
,
Venkatesh Srinivasan
Inf. Process. Lett.
,
116(7):481-483
,
2016
Fetch
|
Report
|
Google
An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification
Mehdy Roayaei
,
Mohammadreza Razzazi
Inf. Process. Lett.
,
116(9):590-594
,
2016
Fetch
|
Report
|
Google
Enumeration of balanced finite group valued functions on directed graphs
Yonah Cherniavsky
,
Avraham Goldstein
,
Vadim E. Levit
,
Robert Shwartz
Inf. Process. Lett.
,
116(7):484-488
,
2016
Fetch
|
Report
|
Google
Faster approximation algorithms for maximizing a monotone submodular function subject to a b-matching constraint
Kaito Fujii
Inf. Process. Lett.
,
116(9):578-584
,
2016
Fetch
|
Report
|
Google
Computing Roman domatic number of graphs
Haisheng Tan
,
Hongyu Liang
,
Rui Wang
,
Jipeng Zhou
Inf. Process. Lett.
,
116(9):554-559
,
2016
Fetch
|
Report
|
Google
Improved neural dynamics for online Sylvester equations solving
Ke Chen
Inf. Process. Lett.
,
116(7):455-459
,
2016
Fetch
|
Report
|
Google
Cryptanalysis of a CP-ABE scheme with policy in normal forms
Syh-Yuan Tan
,
Wun-She Yap
Inf. Process. Lett.
,
116(7):492-495
,
2016
Fetch
|
Report
|
Google
Activity testing model for automatic correction of hand pointing
Yalin Song
,
Yaoru Sun
,
Hong Zhang
,
Fang Wang
Inf. Process. Lett.
,
116(11):653-659
,
2016
Fetch
|
Report
|
Google
Vertex-transitivity on folded crossed cubes
Kung-Jui Pai
,
Jou-Ming Chang
,
Jinn-Shyong Yang
Inf. Process. Lett.
,
116(11):689-693
,
2016
Fetch
|
Report
|
Google
Degree condition for completely independent spanning trees
Xia Hong
,
Qinghai Liu
Inf. Process. Lett.
,
116(10):644-648
,
2016
Fetch
|
Report
|
Google
Program synthesis by model finding
Alexandre Mota
,
Juliano Iyoda
,
Heitor Maranhão
Inf. Process. Lett.
,
116(11):701-705
,
2016
Fetch
|
Report
|
Google
Fan-type implicit-heavy subgraphs for hamiltonicity of implicit claw-heavy graphs
Junqing Cai
,
Yuzhong Zhang
Inf. Process. Lett.
,
116(11):668-673
,
2016
Fetch
|
Report
|
Google
On the algorithmic complexity of zero-sum edge-coloring
Ali Dehghan 0001
,
Mohammad-Reza Sadeghi 0001
Inf. Process. Lett.
,
116(11):660-667
,
2016
Fetch
|
Report
|
Google
Hardness of peeling with stashes
Michael Mitzenmacher
,
Vikram Nathan
Inf. Process. Lett.
,
116(11):682-688
,
2016
Fetch
|
Report
|
Google
Security analysis of an RFID tag search protocol
Hoda Jannati
,
Behnam Bahrak
Inf. Process. Lett.
,
116(10):618-622
,
2016
Fetch
|
Report
|
Google
Zhang neural networks for a set of linear matrix inequalities with time-varying coefficient matrix
Jia Sun
,
Shiheng Wang
,
Ke Wang
Inf. Process. Lett.
,
116(10):603-610
,
2016
Fetch
|
Report
|
Google
Improved hardness results for unique shortest vector problem
Divesh Aggarwal
,
Chandan K. Dubey
Inf. Process. Lett.
,
116(10):631-637
,
2016
Fetch
|
Report
|
Google
The metric dimension for resolving several objects
Tero Laihonen
Inf. Process. Lett.
,
116(11):694-700
,
2016
Fetch
|
Report
|
Google
Marking shortest paths on pushdown graphs does not preserve MSO decidability
Arnaud Carayol
,
Olivier Serre
Inf. Process. Lett.
,
116(10):638-643
,
2016
Fetch
|
Report
|
Google
A technique for the concept-based detection of functional modules in an interaction network
Jong-Min Park
,
Hyung-Jeong Yang
,
Jae-Dong Yang
,
Dong-Hoon Choi
Inf. Process. Lett.
,
116(10):611-617
,
2016
Fetch
|
Report
|
Google
An extension of Hall's theorem for partitioned bipartite graphs
Ehab Morsy
Inf. Process. Lett.
,
116(11):706-709
,
2016
Fetch
|
Report
|
Google
On some special cases of the restricted assignment problem
Chao Wang
,
René Sitters
Inf. Process. Lett.
,
116(11):723-728
,
2016
Fetch
|
Report
|
Google
The (nested) word problem
Christopher S. Henry
Inf. Process. Lett.
,
116(11):729-734
,
2016
Fetch
|
Report
|
Google
Combining local and global information for product feature extraction in opinion documents
Liang Yang
,
Bin Liu 0001
,
Hongfei Lin
,
Yuan Lin
Inf. Process. Lett.
,
116(10):623-627
,
2016
Fetch
|
Report
|
Google
On the displacement for covering a unit interval with randomly placed sensors
Rafal Kapelko
,
Evangelos Kranakis
Inf. Process. Lett.
,
116(11):710-717
,
2016
Fetch
|
Report
|
Google
Genetic algorithm-based parameter selection approach to single image defogging
Fan Guo
,
Hui Peng
,
Jin Tang
Inf. Process. Lett.
,
116(10):595-602
,
2016
Fetch
|
Report
|
Google
A pseudorandom bit generator based on new multi-delayed Chebyshev map
Lingfeng Liu
,
Suoxia Miao
,
Mengfan Cheng
,
Xiaojing Gao
Inf. Process. Lett.
,
116(11):674-681
,
2016
Fetch
|
Report
|
Google
Complexity of a disjoint matching problem on bipartite graphs
Gregory J. Puleo
Inf. Process. Lett.
,
116(10):649-652
,
2016
Fetch
|
Report
|
Google
A note on the complexity of computing the number of reachable vertices in a digraph
Michele Borassi
Inf. Process. Lett.
,
116(10):628-630
,
2016
Fetch
|
Report
|
Google
A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation
Anke van Zuylen
,
James Bieron
,
Frans Schalekamp
,
Gexin Yu
Inf. Process. Lett.
,
116(11):718-722
,
2016
Fetch
|
Report
|
Google
On the expressive power of Kleene algebra with domain
Georg Struth
Inf. Process. Lett.
,
116(4):284-288
,
2016
Fetch
|
Report
|
Google
Complexity of problem
TF
2|v=1, c=2|C
max
Yan Lan
,
Xin Han
,
Zongtao Wu
,
He Guo
,
Xin Chen
Inf. Process. Lett.
,
116(1):65-69
,
2016
Fetch
|
Report
|
Google
Hamiltonicity of hypercubes with faulty vertices
Xie-Bin Chen
Inf. Process. Lett.
,
116(5):343-346
,
2016
Fetch
|
Report
|
Google
VNP=VP in the multilinear world
Meena Mahajan
,
Nitin Saurabh
,
Sébastien Tavenas
Inf. Process. Lett.
,
116(2):179-182
,
2016
Fetch
|
Report
|
Google
2D Hash Chain robust Random Key Distribution scheme
Mohammad Ehdaie
,
Nikos Alexiou
,
Mahmoud Ahmadian-Attari
,
Mohammad Reza Aref
,
Panos Papadimitratos
Inf. Process. Lett.
,
116(5):367-372
,
2016
Fetch
|
Report
|
Google
Robust edge detector based on anisotropic diffusion-driven process
Baraka Jacob Maiseli
,
Huijun Gao
Inf. Process. Lett.
,
116(5):373-378
,
2016
Fetch
|
Report
|
Google
The simplified weighted sum function and its average sensitivity
Jiyou Li
,
Chu Luo
Inf. Process. Lett.
,
116(5):331-336
,
2016
Fetch
|
Report
|
Google
Sufficient conditions for edit-optimal clusters
Peter Damaschke
Inf. Process. Lett.
,
116(4):267-272
,
2016