- Carles Creus, Guillem Godoy, Lander Ramos:
Excessively duplicating patterns represent non-regular languages. Inf. Process. Lett. 114(3): 85-93 (2014) - Przemyslaw Dabrowski, Grzegorz Labuzek, Tomasz Rachwalik, Janusz Szmidt:
Searching for nonlinear feedback shift registers with parallel computing. Inf. Process. Lett. 114(5): 268-272 (2014) - Peter Damaschke:
Enumerating maximal bicliques in bipartite graphs with favorable degree sequences. Inf. Process. Lett. 114(6): 317-321 (2014) - Ananda Swarup Das, Prosenjit Gupta, Kishore Kothapalli, Kannan Srinathan:
On reporting the L1 metric closest pair in a query rectangle. Inf. Process. Lett. 114(5): 256-263 (2014) - Bhaskar DasGupta, Devendra Desai
:
On a connection between small set expansions and modularity clustering. Inf. Process. Lett. 114(7): 349-352 (2014) - Marc Demange, Tínaz Ekim
:
Efficient recognition of equimatchable graphs. Inf. Process. Lett. 114(1-2): 66-71 (2014) - Yun-Ping Deng:
Efficient dominating sets in circulant graphs with domination number prime. Inf. Process. Lett. 114(12): 700-702 (2014) - Sebastian Deorowicz
, Szymon Grabowski
:
Efficient algorithms for the longest common subsequence in k-length substrings. Inf. Process. Lett. 114(11): 634-638 (2014) - Jasbir Dhaliwal:
Faster semi-external suffix sorting. Inf. Process. Lett. 114(4): 174-178 (2014) - Pavol Duris, Marek Kosta:
Flip-pushdown automata with k pushdown reversals and E0L systems are incomparable. Inf. Process. Lett. 114(8): 417-420 (2014) - Janusz Dybizbanski
, Andrzej Szepietowski
:
The oriented chromatic number of Halin graphs. Inf. Process. Lett. 114(1-2): 45-49 (2014) - Chen-Ming Fan, Jen-Tse Wang, Cheng-Chih Huang:
Borderedness-preserving homomorphisms. Inf. Process. Lett. 114(10): 529-534 (2014) - Chengfang Fang, Ee-Chien Chang
:
Optimal strategy of coupon subset collection when each package contains half of the coupons. Inf. Process. Lett. 114(12): 703-705 (2014) - Olivier Finkel, Michal Skrzypczak
:
On the topological complexity of ω-languages of non-deterministic Petri nets. Inf. Process. Lett. 114(5): 229-233 (2014) - Michael L. Fredman:
An intuitive and simple bounding argument for Quicksort. Inf. Process. Lett. 114(3): 137-139 (2014) - Kimmo Fredriksson, Emanuele Giaquinta
:
On a compact encoding of the swap automaton. Inf. Process. Lett. 114(7): 392-396 (2014) - Ruyan Fu, Ji Tian, Jinjiang Yuan, Ya Li:
Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan. Inf. Process. Lett. 114(4): 179-184 (2014) - Zhiguo Fu, Fengqin Yang:
Holographic algorithms on bases of rank 2. Inf. Process. Lett. 114(11): 585-590 (2014) - David Galindo
, Srinivas Vivek
:
Limits of a conjecture on a leakage-resilient cryptosystem. Inf. Process. Lett. 114(4): 192-196 (2014) - Delia Garijo
, María Ángeles Garrido
, Clara I. Grima
, Alberto Márquez
, Auxiliadora Moreno-González
, José Ramón Portillo
, Pedro Reyes
, Rafael Robles
, Jesus Valenzuela
:
Monochromatic geometric k-factors for bicolored point sets with auxiliary points. Inf. Process. Lett. 114(1-2): 19-24 (2014) - Raffaella Gentilini:
A note on the approximation of mean-payoff games. Inf. Process. Lett. 114(7): 382-386 (2014) - Ahmed S. Ghiduk
:
Automatic generation of basis test paths using variable length genetic algorithm. Inf. Process. Lett. 114(6): 304-316 (2014) - Alexander Gilbers:
VC-dimension of perimeter visibility domains. Inf. Process. Lett. 114(12): 696-699 (2014) - Alexander Golovnev, Alexander S. Kulikov
, Ivan Mihajlin:
Solving SCS for bounded length strings in fewer than 2n steps. Inf. Process. Lett. 114(8): 421-425 (2014) - Abishek Gopalan, Srinivasan Ramasubramanian:
Corrigendum to: "A counterexample for the proof of implication conjecture on independent spanning trees" [Information Processing Letters 113 (14-16) (2013) 522-526]. Inf. Process. Lett. 114(1-2): 84 (2014) - Cyriac Grigorious
, Sudeep Stephen
, Bharati Rajan, Mirka Miller, Albert William:
On the partition dimension of a class of circulant graphs. Inf. Process. Lett. 114(7): 353-356 (2014) - Mei-Mei Gu
, Rong-Xia Hao
:
3-extra connectivity of 3-ary n-cube networks. Inf. Process. Lett. 114(9): 486-491 (2014) - Gregory Z. Gutin, Mark Jones:
Parameterized algorithms for load coloring problem. Inf. Process. Lett. 114(8): 446-449 (2014) - Marc Gyssens
, Mathias Niepert, Dirk Van Gucht:
On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements. Inf. Process. Lett. 114(11): 628-633 (2014) - Lein Harn, Fuyou Miao:
Multilevel threshold secret sharing based on the Chinese Remainder Theorem. Inf. Process. Lett. 114(9): 504-509 (2014)