Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 114
Volume 114, Numbers 1-2, January - February 2014
- Lei Nie, Jingjie Liu, Haicang Zhang, Zhiwei Xu:
On the inapproximability of minimizing cascading failures under the deterministic threshold model. 1-4 - Yong Yu
, Yi Mu, Willy Susilo, Man Ho Au:
Security pitfalls of an efficient threshold proxy signature scheme for mobile agents. 5-8 - Mingjie Liu, Xiaoyun Wang, Guangwu Xu, Xuexin Zheng:
A note on BDD problems with λ2-gap. 9-12 - Sarah Bastkowski, Andreas Spillner, Vincent Moulton:
Fishing for minimum evolution trees with Neighbor-Nets. 13-18 - 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. 19-24 - Xin-Wei Yao, Wan-Liang Wang, Teng-cao Wu, Xiao-min Yao, Shuang-Hua Yang:
A Novel Hybrid Slot Allocation Mechanism for 802.11e EDCA Protocol. 25-30 - Jean-Luc Baril, Jean Marcel Pallo:
Motzkin subposets and Motzkin geodesics in Tamari lattices. 31-37 - Carsten Witt:
Fitness levels with tail bounds for the analysis of randomized search heuristics. 38-41 - Bruno Courcelle:
Clique-width and edge contraction. 42-44 - Janusz Dybizbanski, Andrzej Szepietowski:
The oriented chromatic number of Halin graphs. 45-49 - Nima Norouzi, Yung H. Tsin:
A simple 3-edge connected component algorithm revisited. 50-55 - Weidong Li, Jianping Li, Li Guan:
Approximation algorithms for the ring loading problem with penalty cost. 56-59 - Kazuya Yamashita, Yasuaki Nishitani, Sadaki Hirose, Satoshi Okawa, Nobuyasu Osato:
The firing squad synchronization problem with sub-generals. 60-65 - Marc Demange, Tínaz Ekim:
Efficient recognition of equimatchable graphs. 66-71 - Aleksy Schubert, Ken-etsu Fujita:
A note on subject reduction in (→, ∃)-Curry with respect to complete developments. 72-75 - Dmitry N. Krasnoshchekov, Valentin Polishchuk:
Order-k α-hulls and α-shapes. 76-83 - 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]. 84
Volume 114, Number 3, March 2014
- Carles Creus, Guillem Godoy, Lander Ramos:
Excessively duplicating patterns represent non-regular languages. 85-93 - Wojciech Wawrzyniak:
A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs. 94-98 - Faisal N. Abu-Khzam:
Maximum common induced subgraph parameterized by vertex cover. 99-103 - Peter Lofgren:
On the complexity of the Monte Carlo method for incremental PageRank. 104-106 - Peter Nose:
Security weaknesses of a signature scheme and authenticated key agreement protocols. 107-115 - Jiqiang Lu, Wun-She Yap, Matt Henricksen, Swee-Huay Heng:
Differential attack on nine rounds of the SEED block cipher. 116-123 - Beate Bollig:
A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm. 124-129 - Xuehou Tan, Bo Jiang:
Optimum sweeps of simple polygons with two guards. 130-136 - Michael L. Fredman:
An intuitive and simple bounding argument for Quicksort. 137-139 - Xiao-ning Xie, Gongliang Chen, Yin Li:
Novel bit-parallel multiplier for GF(2m) defined by all-one polynomial using generalized Karatsuba algorithm. 140-146 - Branislav Rovan, Marek Zeman:
Modeling time criticality of information. 147-151 - Debapriyay Mukhopadhyay, Subhas C. Nandy:
Efficient multiple-precision integer division algorithm. 152-157
Volume 114, Number 4, April 2014
- Sandi Klavzar, Meijie Ma:
The domination number of exchanged hypercubes. 159-162 - Bang Ye Wu:
On approximating metric 1-median in sublinear time. 163-166 - Yixin Cao, Jianer Chen, Jia-Hao Fan:
An O(1.84k) parameterized algorithm for the multiterminal cut problem. 167-173 - Jasbir Dhaliwal:
Faster semi-external suffix sorting. 174-178 - Ruyan Fu, Ji Tian, Jinjiang Yuan, Ya Li:
Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan. 179-184 - Salvatore Pontarelli, Pedro Reviriego, Michael Mitzenmacher:
Improving the performance of Invertible Bloom Lookup Tables. 185-191 - David Galindo, Srinivas Vivek:
Limits of a conjecture on a leakage-resilient cryptosystem. 192-196 - Patrick Cégielski, Serge Grigorieff, Irène Guessarian:
On lattices of regular sets of natural integers closed under decrementation. 197-202 - Sven Schewe:
Distributed synthesis is simply undecidable. 203-207 - Lukasz Mikulski, Maciej Koutny:
Folded Hasse diagrams of combined traces. 208-216 - Fang Yang, Xiang'en Chen, Chunyan Ma:
On the vertex-distinguishing proper edge coloring of composition of complete graph and star. 217-221 - Samed Bajric, Enes Pasalic, Amela Muratovic-Ribic, Sugata Gangopadhyay:
On generalized bent functions with Dillon's exponents. 222-227
Volume 114, Number 5, May 2014
- Olivier Finkel, Michal Skrzypczak:
On the topological complexity of ω-languages of non-deterministic Petri nets. 229-233 - Santanu Sarkar:
Proving empirical key-correlations in RC4. 234-238 - R. Hildenbrandt:
A k-server problem with parallel requests and unit distances. 239-246 - Matthew Andrews, Lisa Zhang:
Rate-adaptive weighted fair queueing for energy-aware scheduling. 247-251 - Mohsen Shakiba, Mohammad Dakhilalian, Hamid Mala:
On computational complexity of impossible differential cryptanalysis. 252-255 - Ananda Swarup Das, Prosenjit Gupta, Kishore Kothapalli, Kannan Srinathan:
On reporting the L1 metric closest pair in a query rectangle. 256-263 - Petteri Kaski, Mikko Koivisto, Janne H. Korhonen, Igor S. Sergeev:
Fast monotone summation over disjoint sets. 264-267 - Przemyslaw Dabrowski, Grzegorz Labuzek, Tomasz Rachwalik, Janusz Szmidt:
Searching for nonlinear feedback shift registers with parallel computing. 268-272 - Christos Boutsidis, Malik Magdon-Ismail:
A note on sparse least-squares regression. 273-276
Volume 114, Number 6, June 2014
- Marcos A. Kiwi, Pablo Moisset de Espanés, Ivan Rapaport, Sergio Rica, Guillaume Theyssier:
Strict Majority Bootstrap Percolation in the r-wheel. 277-281 - Nabila Abdessaied, Mathias Soeken, Michael Kirkedal Thomsen, Rolf Drechsler:
Upper bounds for reversible circuits based on Young subgroups. 282-286 - Yangyang Li, Shixia Feng, Xiangrong Zhang, Licheng Jiao:
SAR image segmentation based on quantum-inspired multiobjective evolutionary clustering algorithm. 287-293 - Hunter R. Johnson:
Some new maximum VC classes. 294-298 - Ferucio Laurentiu Tiplea, Constantin Catalin Dragan:
A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme. 299-303 - Ahmed S. Ghiduk:
Automatic generation of basis test paths using variable length genetic algorithm. 304-316 - Peter Damaschke:
Enumerating maximal bicliques in bipartite graphs with favorable degree sequences. 317-321 - Long Wen, Meiqin Wang, Andrey Bogdanov, Huaifeng Chen:
Multidimensional zero-correlation attacks on lightweight block cipher HIGHT: Improved cryptanalysis of an ISO standard. 322-330 - Young In Cho, Nam Su Chang, Seokhie Hong:
Formulas for cube roots in F3m using shifted polynomial basis. 331-337
Volume 114, Number 7, July 2014
- Yacine Belhoul, Saïd Yahiaoui, Hamamache Kheddouci:
Efficient self-stabilizing algorithms for minimal total k-dominating sets in graphs. 339-343 - Yongjie Yang:
Towards optimal kernel for edge-disjoint triangle packing. 344-348 - Bhaskar DasGupta, Devendra Desai:
On a connection between small set expansions and modularity clustering. 349-352 - Cyriac Grigorious, Sudeep Stephen, Bharati Rajan, Mirka Miller, Albert William:
On the partition dimension of a class of circulant graphs. 353-356 - Andreas Brandstädt, Van Bang Le:
A note on efficient domination in a superclass of P5-free graphs. 357-359 - Cosmin Bonchis, Gabriel Istrate:
Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem. 360-364 - Arindam Khan, Prasad Raghavendra:
On mimicking networks representing minimum terminal cuts. 365-371 - Jooyoung Lee, Daesung Kwon:
Security of permutation-based compression function Ip231. 372-381 - Raffaella Gentilini:
A note on the approximation of mean-payoff games. 382-386 - Pawel Rzazewski:
Exact algorithm for graph homomorphism and locally injective graph homomorphism. 387-391 - Kimmo Fredriksson, Emanuele Giaquinta:
On a compact encoding of the swap automaton. 392-396
Volume 114, Number 8, August 2014
- Andrzej Tarlecki:
Władysław Marek Turski (1938-2013). 397-398
- Xianyu Yu, Yulin Zhang, Kai Huang:
Multi-machine scheduling with general position-based deterioration to minimize total load revisited. 399-404 - Hans Raj Tiwary:
On the largest convex subsets in Minkowski sums. 405-407 - Grgur Petric Maretic, Mohammad Torabi Dashti, David A. Basin:
LTL is closed under topological closure. 408-413 - Christos Levcopoulos, Andrzej Lingas:
A note on a QPTAS for maximum weight triangulation of planar point sets. 414-416 - Pavol Duris, Marek Kosta:
Flip-pushdown automata with k pushdown reversals and E0L systems are incomparable. 417-420 - Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Solving SCS for bounded length strings in fewer than 2n steps. 421-425 - Riham AlTawy, Amr M. Youssef:
Integral distinguishers for reduced-round Stribog. 426-431 - Erwan Le Merrer, Nicolas Le Scouarnec, Gilles Trédan:
Heuristical top-k: fast estimation of centralities in complex networks. 432-436 - Jérémy Barbay, Timothy M. Chan, Gonzalo Navarro, Pablo Pérez-Lantero:
Maximum-weight planar boxes in O(n2) time (and better). 437-445 - Gregory Z. Gutin, Mark Jones:
Parameterized algorithms for load coloring problem. 446-449 - Zan-Bo Zhang, Xiaoyan Zhang:
Triangle strings: Structures for augmentation of vertex-disjoint triangle sets. 450-456
Volume 114, Number 9, September 2014
- Eduardo A. Canale, Héctor Cancela, Franco Robledo, Pablo Sartor:
The complexity of computing the 2-K-reliability in networks. 457-461 - Victor Lagerkvist:
Weak bases of Boolean co-clones. 462-468 - Ying Ma, Shunzhi Zhu, Ke Qin, Guangchun Luo:
Combining the requirement information for software defect estimation in design time. 469-474 - Huijuan Wang, Jianliang Wu, Bin Liu, Hongyu Chen:
On the linear arboricity of graphs embeddable in surfaces. 475-479 - Xiaowang Zhang, Jan Van den Bussche:
On the primitivity of operators in SPARQL. 480-485 - Mei-Mei Gu, Rong-Xia Hao:
3-extra connectivity of 3-ary n-cube networks. 486-491 - Yumin Yuan, Chenhui Wang:
Certificateless signature scheme with security enhanced in the standard model. 492-499 - Keramat Hasani, Svetlana A. Kravchenko, Frank Werner:
Minimizing total weighted completion time approximately for the parallel machine problem with a single server. 500-503 - Lein Harn, Fuyou Miao:
Multilevel threshold secret sharing based on the Chinese Remainder Theorem. 504-509 - Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Peter Rossmanith, Guan-Han Wu:
Exact algorithms for problems related to the densest k-set problem. 510-513
Volume 114, Number 10, October 2014
- Well Y. Chiu, Chiuyuan Chen, Shih-Yu Tsai:
A 4n-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon. 515-518 - Boris Aronov, Muriel Dulieu, Ferran Hurtado:
Mutual witness proximity graphs. 519-523 - Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
Fast algorithms for some dominating induced matching problems. 524-528 - Chen-Ming Fan, Jen-Tse Wang, Cheng-Chih Huang:
Borderedness-preserving homomorphisms. 529-534 - Franz Aurenhammer, Günter Paulini:
On shape Delaunay tessellations. 535-541 - Felix Joos, Christian Löwenstein, Fabiano de S. Oliveira, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Graphs of interval count two with a given partition. 542-546 - Mohammad Ali Orumiehchiha, Josef Pieprzyk, Ron Steinfeld:
Practical attack on NLM-MAC scheme. 547-550 - Colette Johnen:
Fast, silent self-stabilizing distance-k independent dominating set construction. 551-555 - Tomasz Kociumaka, Marcin Pilipczuk:
Faster deterministic Feedback Vertex Set. 556-560 - Xiaoping Liu, Zhilan Dang, Baoyindureng Wu:
The hub number, girth and Mycielski graphs. 561-563 - Adi Akavia:
Explicit small sets with ε-discrepancy on Bohr sets. 564-567 - Min-Sheng Lin, Sheng-Huang Su:
Counting maximal independent sets in directed path graphs. 568-572 - Huibo Chen, Wenge Zhang, Feng Ding:
Data filtering based least squares iterative algorithm for parameter identification of output error autoregressive systems. 573-578 - Tsuyoshi Ito:
Parallelization of entanglement-resistant multi-prover interactive proofs. 579-583
Volume 114, Number 11, November 2014
- Zhiguo Fu, Fengqin Yang:
Holographic algorithms on bases of rank 2. 585-590 - Mike Holenderski, Reinder J. Bril, Johan J. Lukkien:
Red-black trees with relative node keys. 591-596 - Jianfeng Lu, Dewu Xu, Lei Jin, Jianmin Han, Hao Peng:
On the complexity of role updating feasibility problem in RBAC. 597-602 - Moonju Park, Xuefeng Piao:
Enhanced utilization bound of Rate-Monotonic scheduling in Controller Area Networks. 603-606 - Hedong Yang, Lijie Wen, Jianmin Wang, Raymond K. Wong:
CPL+: An improved approach for evaluating the local completeness of event logs. 607-610 - Tomoyuki Yamakami:
Constant-space quantum interactive proofs against multiple provers. 611-619 - Kwanghoon Choi, Byeong-Mo Chang:
A type and effect system for activation flow of components in Android programs. 620-627 - Marc Gyssens, Mathias Niepert, Dirk Van Gucht:
On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements. 628-633 - Sebastian Deorowicz, Szymon Grabowski:
Efficient algorithms for the longest common subsequence in k-length substrings. 634-638 - Petra Berenbrink, Bruce Krayenhoff, Frederik Mallmann-Trenn:
Estimating the number of connected components in sublinear time. 639-642 - Jack H. Lutz:
The frequent paucity of trivial strings. 643-645 - Andrzej Lingas, Leonidas Palios, Agnieszka Wasylewicz, Pawel Zylinski:
Corrigendum to "Note on covering monotone orthogonal polygons" [Inf. Process. Lett. 104(6) (2007) 220-227]. 646-654
Volume 114, Number 12, December 2014
- Zongyue Wang, Hongbo Yu, Xiaoyun Wang:
Cryptanalysis of GOST R hash function. 655-662 - Richard Müller, Christian Stahl, Walter Vogler:
Undecidability of accordance for open systems with unbounded message queues. 663-669 - Zahra Moezkarimi, Alireza Bagheri:
A PTAS for geometric 2-FTP. 670-675 - Xing Huang:
Hamilton cycles in implicit claw-heavy graphs. 676-679 - David A. Basin, Carlos Cotrini Jiménez, Felix Klaedtke, Eugen Zalinescu:
Deciding safety and liveness in TPTL. 680-688 - Dezheng Xie, Huanhuan Xiao, Zhihong Zhao:
Star coloring of cubic graphs. 689-691 - Song-Song Li, Yu-Zhong Zhang:
Serial batch scheduling on uniform parallel machines to minimize total completion time. 692-695 - Alexander Gilbers:
VC-dimension of perimeter visibility domains. 696-699 - Yun-Ping Deng:
Efficient dominating sets in circulant graphs with domination number prime. 700-702 - Chengfang Fang, Ee-Chien Chang:
Optimal strategy of coupon subset collection when each package contains half of the coupons. 703-705 - Tomomi Matsui, Noriyoshi Sukegawa, Atsushi Miyauchi:
Fractional programming formulation for the vertex coloring problem. 706-709 - Jinfei Liu, Li Xiong, Xiaofeng Xu:
Faster output-sensitive skyline computation algorithm. 710-713 - Shuichi Miyazaki:
On the advice complexity of online bipartite matching and online stable marriage. 714-717 - Yung-Tsung Hou, Dar-Li Yang, Wen-Hung Kuo:
Lot scheduling on a single machine. 718-722 - Lei Zhang, Wenling Wu:
Differential analysis of the Extended Generalized Feistel Networks. 723-727 - Chen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
Testing the irreducibility of nonsquare Perron-Frobenius systems. 728-733 - Jou-Ming Chang, Jhen-Ding Wang, Jinn-Shyong Yang, Kung-Jui Pai:
A comment on "Independent spanning trees in crossed cubes". 734-739
a service of 
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 2024-04-18 20:20 CEST 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:
