Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 111
Volume 111, Number 1, December 2010
- Chin-Yang Lin, Ting-Wei Hou:
An efficient approach to cyclic reference counting based on a coarse-grained search. 1-10 - Pascal Schweitzer, Patrick Schweitzer:
Connecting face hitting sets in planar graphs. 11-15 - Harry Buhrman, David García-Soriano
, Arie Matsliah:
Learning parities in the mistake-bound model. 16-21 - Jin-Xin Zhou, Yan-Quan Feng:
Super-connected but not super edge-connected graphs. 22-25 - Chenghua Li, Xinfang Zhang, H. Jin, Wen Xiang:
E-passport EAC scheme based on Identity-Based Cryptography. 26-30 - Jessen T. Havill:
Online malleable job scheduling for m<=3. 31-35 - Xindong Zhang, Juan Liu, Xing Chen, Jixiang Meng:
Domination number of Cartesian products of directed cycles. 36-39 - Chi Zhang:
An improved lower bound on query complexity for quantum PAC learning. 40-45 - Jean Marcel Pallo:
Root-restricted Kleenean rotations. 46-50
Volume 111, Number 2, December 2010
- Juliano B. Lima, Daniel Panario, Ricardo M. Campello de Souza:
Public-key encryption based on Chebyshev polynomials over GF(q). 51-56 - Akash Lal, G. Ramalingam:
Reference count analysis with shallow aliasing. 57-63 - Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff:
Exact exponential-time algorithms for finding bicliques. 64-67 - Luca Aceto, Anna Ingólfsdóttir, Joshua Sack:
Resource bisimilarity and graded bisimilarity coincide. 68-76 - Byung-Cheon Choi, Joseph Y.-T. Leung, Michael L. Pinedo:
A note on makespan minimization in proportionate flow shops. 77-81 - Haifeng Qian, Shouhuai Xu:
Non-interactive multisignatures in the plain public-key model with efficient verification. 82-89 - Yiyuan Luo, Xuejia Lai, Zheng Gong:
Pseudorandomness analysis of the (extended) Lai-Massey scheme. 90-96 - Abdel Aziz Farrag:
Developing fault-tolerant distributed loops. 97-101
Volume 111, Number 3, January 2011
- Matthew J. Katz, Gila Morgenstern:
Settling the bound on the rectilinear link radius of a simple rectilinear polygon. 103-106 - Zoltán Ésik:
An undecidable property of context-free linear orders. 107-109 - Ján Katrenic, Ingo Schiermeyer:
Improved approximation bounds for the minimum rainbow subgraph problem. 110-114 - XueLin Xu, Zongsheng Gao, Ke Xu:
A tighter upper bound for random MAX 2-SAT. 115-119 - Van Bang Le, Nguyen Ngoc Tuy:
A good characterization of squares of strongly chordal split graphs. 120-123 - Xin Zhang, Jianliang Wu:
On edge colorings of 1-planar graphs. 124-128 - Rafael M. Duarte, Alexandre Mota, Augusto Sampaio:
Introducing concurrency in sequential Java via laws. 129-134 - Jae-Yoon Jung, Chang-Ho Chin, Jorge Cardoso:
An entropy-based uncertainty measure of process models. 135-141 - Fedor V. Fomin, Petr A. Golovach, Erik Jan van Leeuwen:
Spanners of bounded degree graphs. 142-144 - Mariano Zelke:
Intractability of min- and max-cut in streaming graphs. 145-150
Volume 111, Number 4, January 2011
- Beate Bollig, Marc Gillé:
Randomized OBDDs for the most significant bit of multiplication need exponential space. 151-155 - Ruilin Li, Bing Sun, Chao Li, Jianxiong You:
Differential Fault Analysis on SMS4 using a single fault. 156-163 - Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková:
Matrix reduction in a combinatorial computation. 164-168 - Tomás Feder, Carlos S. Subi:
Maximum gap labelings of graphs. 169-173 - Gur Mosheiov:
Proportionate flowshops with general position-dependent processing times. 174-177 - Paul Dütting, Monika Henzinger, Ingmar Weber:
Offline file assignments for online load balancing. 178-183 - Eyal Even-Dar, Asaf Shapira:
A note on maximizing the spread of influence in social networks. 184-187 - Erjie Yang, Xiaofan Yang, Qiang Dong, Jing Li:
Conditional diagnosability of hypermeshes under the comparison model. 188-193 - Sergio Arévalo, Ernesto Jiménez, Mikel Larrea, Luis Mengual:
Communication-efficient and crash-quiescent Omega with unknown membership. 194-199
Volume 111, Number 5, February 2011
- Taehyung Lee, Joong Chae Na, Kunsoo Park:
On-line construction of parameterized suffix trees for large alphabets. 201-207 - Bertrand M. T. Lin, F. J. Hwang:
Total completion time minimization in a 2-stage differentiation flowshop with fixed sequences per job type. 208-212 - Anna Gál, Jing-Tang Jang:
The size and depth of layered Boolean circuits. 213-217 - Hiroki Morizumi:
Improved approximation algorithms for minimum AND-circuits problem via k-set cover. 218-221 - Stephan Dominique Andres, Winfried Hochstättler:
The game chromatic number and the game colouring number of classes of oriented cactuses. 222-226 - Benjamin Doerr, Mahmoud Fouz:
Quasi-random rumor spreading: Reducing randomness can be costly. 227-230 - Francesco M. Malvestuto, Mauro Mezzini, Marina Moscarini:
Computing simple-path convex hulls in hypergraphs. 231-234 - Xie-Bin Chen:
Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs. 235-238 - Pilu Crescenzi, Miriam Di Ianni, Andrea Marino, Donatella Merlini, Gianluca Rossi, Paola Vocca:
Smooth movement and Manhattan path based Random Waypoint mobility. 239-246 - Kishan Chand Gupta, Yassir Nawaz, Guang Gong:
Upper bound for algebraic immunity on a subclass of Maiorana McFarland class of bent functions. 247-249
Volume 111, Number 6, February 2011
- N. S. Narayanaswamy, C. R. Subramanian:
Dominating set based exact algorithms for 3-coloring. 251-255 - Yong Zhang, Weiguo Zhang, Weijun Xu, Hongyi Li:
A risk-reward model for the on-line leasing of depreciable equipment. 256-261 - Iratxe Soraluze Arriola, Roberto Cortiñas, Alberto Lafuente, Mikel Larrea, Felix C. Freiling:
Communication-efficient failure detection and consensus in omission environments. 262-268 - Guofeng Yan, Jianxin Wang, Shuhong Chen:
Performance analysis for (X, S)-bottleneck cell in large-scale wireless networks. 269-277 - Francisco Ortin, Miguel García:
Union and intersection types to support both dynamic and static typing. 278-286 - Anna Fiedorowicz:
Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices. 287-290 - Maxime Crochemore, German Tischler:
Computing Longest Previous non-overlapping Factors. 291-295 - Guy Even, Guy Kortsarz, Zeev Nutov:
A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. 296-300
Volume 111, Number 7, March 2011
- Heeheon Kim, Yookun Cho:
A new fair scheduling algorithm for periodic tasks on multiprocessors. 301-309 - Paolo Boldi, Sebastiano Vigna:
E=I+T: The internal extent formula for compacted tries. 310-313 - Dustin Moody:
Using 5-isogenies to quintuple points on elliptic curves. 314-317 - Yung-Hsing Peng, Chang-Biau Yang, Chiou-Ting Tseng, Chiou-Yi Hor:
The indexing for one-dimensional proportionally-scaled strings. 318-322 - Raphaël Clifford, Alexandru Popa:
Maximum subset intersection. 323-325 - Therese Biedl, Stephane Durocher, Holger H. Hoos, Shuang Luan, Jared Saia, Maxwell Young:
A note on improving the performance of approximation algorithms for radiation therapy. 326-333 - Moonju Park:
Comments on "Generalized rate monotonic schedulability bounds using relative period ratios". 334-337 - Martin Lange:
P-hardness of the emptiness problem for visibly pushdown languages. 338-341 - Adam Roman:
The NP-completeness of the Road Coloring Problem. 342-347 - Liyu Zhang:
Proof system representations of degrees of disjoint NP-pairs. 348-351
Volume 111, Number 8, March 2011
- T. Shafiei, Mohammad Reza Hoseiny Farahabady, Ali Movaghar, Hamid Sarbazi-Azad:
On pancyclicity properties of OTIS-mesh. 353-359 - Meijie Ma, Liying Zhu:
The super connectivity of exchanged hypercubes. 360-364 - Satoshi Hanamura, Shigeki Iwata:
Posets with seven linear extensions sortable by three comparisons. 365-369 - Jing Li, Shiying Wang, Di Liu:
Pancyclicity of ternary n-cube networks under the conditional fault model. 370-374 - Ping-Ying Tsai:
A note on an optimal result on fault-tolerant cycle-embedding in alternating group graphs. 375-378 - Jehn-Ruey Jiang:
Nondominated local coteries for resource allocation in grids and clouds. 379-384 - Petros Drineas, Anastasios Zouzias:
A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality. 385-389 - Yin Li, Gongliang Chen, Jianhua Li:
Speedup of bit-parallel Karatsuba multiplier in GF(2m) generated by trinomials. 390-394 - Ha Quang Minh:
The regularized least squares algorithm and the problem of learning halfspaces. 395-401
Volume 111, Number 9, April 2011
- Sizhong Zhou, Jiashang Jiang:
Toughness and (a, b, k)-critical graphs. 403-407 - Luca Aceto, David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Anna Ingólfsdóttir:
Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet. 408-413 - Dragana Bajic, Alister G. Burr:
Comments on "Integer SEC-DED codes for low power communications" [Inform. Process. Lett. 110 (2010) 518-520]. 414-415 - Fan Yang, Xiangwen Li:
Nowhere-zero 3-flows in dihedral Cayley graphs. 416-419 - Narad Rampersad, Jeffrey O. Shallit, Ming-wei Wang:
Inverse star, borders, and palstars. 420-422 - Xiao Min, Jing Liu, Yuqing Wang:
Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines. 423-428 - Philippe Moser:
A zero-one SUBEXP-dimension law for BPP. 429-432 - Madars Virza:
Sensitivity versus block sensitivity of Boolean functions. 433-435 - Tomás Kulich, Miroslava Kemenová:
On the paper of Pascal Schweitzer concerning similarities between incompressibility methods and the Lovász Local Lemma. 436-439 - Min Gao, Zhongfu Wu, Feng Jiang:
Userrank for item-based collaborative filtering recommendation. 440-446 - Ajay D. Kshemkalyani:
Repeated detection of conjunctive predicates in distributed executions. 447-452
Volume 111, Number 10, April 2011
- Javier Herranz, Fabien Laguillaumie, Carla Ràfols:
Relations between semantic security and anonymity in identity-based encryption. 453-460 - Xu An Wang, Jian Weng, Xiaoyuan Yang, Yanjiang Yang:
Cryptanalysis of an identity based broadcast encryption scheme without random oracles. 461-464 - Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai:
An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem. 465-468 - Fanica Gavril:
Algorithms for induced biclique optimization problems. 469-473 - Jaechul Sung:
Differential cryptanalysis of eight-round SEED. 474-478 - Klaus Jansen, Roberto Solis-Oba:
A simple OPT+1 algorithm for cutting stock under the modified integer round-up property assumption. 479-482 - Carles Martínez-García, Guillermo Navarro-Arribas, Joan Borrell:
Fuzzy Role-Based Access Control. 483-487 - Tiancheng Lou, Xiaoming Sun, Christophe Tartary:
Bounds and trade-offs for Double-Base Number Systems. 488-493 - Chunming Tang, Maozhi Xu, Yanfeng Qi:
Faster pairing computation on genus 2 hyperelliptic curves. 494-499 - Daniel Kirsten, Karin Quaas:
Recognizability of the support of recognizable series over the semiring of the integers is undecidable. 500-502
Volume 111, Number 11, May 2011
- Meijiao Duan, Jing Xu:
An efficient location-based compromise-tolerant key management scheme for sensor networks. 503-507 - Anne Berry, Romain Pogorelcnik:
A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph. 508-511 - Jean-Philippe Aumasson, Raphael C.-W. Phan:
On the cryptanalysis of the hash function Fugue: Partitioning and inside-out distinguishers. 512-515 - Szymon Grabowski, Simone Faro, Emanuele Giaquinta:
String matching with inversions and translocations in linear average time (most of the time). 516-520 - Alberto Apostolico, Manuel Barbares, Cinzia Pizzi:
Speedup for a periodic subgraph miner. 521-523 - Xixian Han, Jianzhong Li, Donghua Yang:
Supporting early pruning in top-k query processing on massive data. 524-532 - Sven Oliver Krumke, Clemens Thielen:
Minimum cost flows with minimum quantities. 533-537 - Xiaozhou Li, Atri Rudra, Ram Swaminathan:
Flexible coloring. 538-540 - Toufik Mansour, Ghalib Nassar, Vincent Vajnovszki:
Loop-free Gray code algorithm for the e-restricted growth functions. 541-544 - Li Yan, Marek Chrobak:
Approximation algorithms for the Fault-Tolerant Facility Placement problem. 545-549 - Víctor Lavín Puente:
Learning a subclass of k-quasi-Horn formulas with membership queries. 550-555
Volume 111, Number 12, June 2011
- Zheng-Zhong Du, Jun-Ming Xu:
A note on cycle embedding in hypercubes with faulty vertices. 557-560 - Wujun Zhou, Jianxi Fan, Xiaohua Jia, Shukui Zhang:
The spined cube: A new hypercube variant with smaller diameter. 561-567 - Alexander Thomasian, Jun Xu:
X-code double parity array operation with two disk failures. 568-574 - Shisheng Li, Jinjiang Yuan, Baoqiang Fan:
Unbounded parallel-batch scheduling with family jobs and delivery coordination. 575-582 - Sajjad Mahmood, Azhar Khan:
An industrial study on the importance of software component documentation: A system integratorʼs perspective. 583-590 - Ruy Fabila Monroy, Clemens Huemer, Dolores Lara:
A combinatorial property on angular orders of plane point sets. 591-594 - Takashi Saso, Kojiro Kobayashi, Atsuyoshi Nakamura:
On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation. 595-599 - Alan Joseph J. Caceres, Samantha Daley, John DeJesus, Michael Hintze, Diquan Moore, Katherine St. John:
Walks in phylogenetic treespace. 600-604 - Eugen Zalinescu:
Shorter strings containing all k-element permutations. 605-608 - Jianghan Zhu, Xiaomin Zhu, Jianqing Jiang:
Improving adaptivity and fairness of processing real-time tasks with QoS requirements on clusters through dynamic scheduling. 609-613 - Javier Esparza, Pierre Ganty, Stefan Kiefer, Michael Luttenberger:
Parikhʼs theorem: A simple and direct automaton construction. 614-619
Volume 111, Number 13, July 2011
- Feng Wang, Wensong Lin:
Group path covering and distance two labeling of graphs. 621-625 - Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke:
Abstract processes of place/transition systems. 626-633 - Yongge Wang, Yvo Desmedt:
Edge-colored graphs with applications to homogeneous faults. 634-641 - Jeroen Ketema:
Counterexamples in infinitary rewriting with non-fully-extended rules. 642-646 - Yian Xu:
On acyclic edge coloring of toroidal graphs. 647-649 - Vincent Vajnovszki, Rémi Vernay:
Restricted compositions and permutations: From old to new Gray codes. 650-655 - Andrey Bogdanov, Kyoji Shibutani:
Analysis of 3-line generalized Feistel networks with double SD-functions. 656-660 - Han-Yu Lin, Chien-Lung Hsu, Shih-Kun Huang:
Improved convertible authenticated encryption scheme with provable security. 661-666 - Katarína Cechlárová, Eva Jelínková:
An efficient implementation of the equilibrium algorithm for housing markets with duplicate houses. 667-670
Volume 111, Number 14, July 2011
- Oren Weimann, David Peleg:
A note on exact distance labeling. 671-673 - Mikhail J. Atallah, Timothy W. Duket:
Pattern matching in the Hamming distance with thresholds. 674-677 - Wenming Zhang, Yinfeng Xu, Feifeng Zheng, Ming Liu:
Online algorithms for the general k-search problem. 678-682 - Jianhua Tu, Wenli Zhou:
A factor 2 approximation algorithm for the vertex cover P3 problem. 683-686 - Peter Nose:
Security weaknesses of authenticated key agreement protocols. 687-696 - Konstanty Junosza-Szaniawski, Pawel Rzazewski:
On the complexity of exact algorithm for L(2, 1)-labeling of graphs. 697-701 - Jinshan Zhang, Heng Liang, Fengshan Bai:
Approximating partition functions of the two-state spin system. 702-710 - Manfred Schmidt-Schauß, David Sabel, Elena Machkasova:
Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec. 711-716 - Sebastian Böcker, Peter Damaschke:
Even faster parameterized cluster deletion and cluster editing. 717-721
Volume 111, Number 15, August 2011
- Debajyoti Bera:
A lower bound method for quantum circuits. 723-726 - Marek Cygan, Lukasz Kowalik:
Channel assignment via fast zeta transform. 727-730 - Marek Adamczyk:
Improved analysis of the greedy algorithm for stochastic matching. 731-737 - Olivia Oanea:
Boundedness of adaptive nets is decidable. 738-743 - Qiang Tang, Liqun Chen:
Extended KCI attack against two-party key establishment protocols. 744-747 - Hervé Hocquard:
Graphs with maximum degree 6 are acyclically 11-colorable. 748-753 - Foto N. Afrati, Sara Cohen, Gabriel M. Kuper:
On the complexity of tree pattern containment with arithmetic comparisons. 754-760 - Chen Yuan, Haibin Kan:
Holographic reduction for some counting problems. 761-766 - Qian Wu, Qiuli Lu, Yingqian Wang:
(Δ+1)-total-colorability of plane graphs of maximum degree Δ≥6 with neither chordal 5-cycle nor chordal 6-cycle. 767-772
Volume 111, Number 16, August 2011
- Yong Zhang, Zhuo Chang, Francis Y. L. Chin, Hing-Fung Ting, Yung H. Tsin:
Uniformly inserting points on square grid. 773-779 - Chenfu Yi, Yuhuan Chen, Zhongliang Lu:
Improved gradient-based neural networks for online solution of Lyapunov matrix equation. 780-786 - Alberto Policriti, Alexandru I. Tomescu:
Counting extensional acyclic digraphs. 787-791 - S. Geetha, V. Kabilan, S. P. Chockalingam, N. Kamaraj:
Varying radix numeral system based adaptive image steganography. 792-797 - Cuixia Miao, Yuzhong Zhang, Zhigang Cao:
Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs. 798-803 - Matei David, Periklis A. Papakonstantinou, Anastasios Sidiropoulos:
How strong is Nisanʼs pseudo-random generator? 804-808 - Mengshi Li, W. J. Tang, Q. H. Wu, Jon R. Saunders:
Paired-bacteria optimiser - A simple and fast algorithm. 809-813 - Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Subexponential algorithms for partial cover problems. 814-818 - Giorgio Lucarelli, Ioannis Milis:
Improved approximation algorithms for the Max Edge-Coloring problem. 819-823
Volume 111, Number 17, September 2011
- Christos Koukouvinos, Veronika Pillwein, Dimitris E. Simos, Zafeirakis Zafeirakopoulos:
On the average complexity for the verification of compatible sequences. 825-830 - Haifeng Xu, Lin Chen, Deshi Ye, Guochuan Zhang:
Scheduling on two identical machines with a speed-up resource. 831-835 - Jianfeng Hou, Nicolas Roussel, Jianliang Wu:
Acyclic chromatic index of planar graphs with triangles. 836-840 - Hoda Taheri, Peyman Neamatollahi, Mahmoud Naghibzadeh:
A hybrid token-based distributed mutual exclusion algorithm using wraparound two-dimensional array logical topology. 841-847 - Alan M. Frieze, Páll Melsted:
Randomly coloring simple hypergraphs. 848-853 - Domingo Gómez, Jaime Gutierrez, Álvar Ibeas:
On the linear complexity of the Naor-Reingold sequence. 854-856 - Yu Zong, Guandong Xu, Ping Jin, Yanchun Zhang, Enhong Chen:
HC_AB: A new heuristic clustering algorithm based on Approximate Backbone. 857-863 - Rena Bakhshi, Jörg Endrullis, Wan J. Fokkink, Jun Pang:
Fast leader election in anonymous rings with bounded expected delay. 864-870 - Weifeng Gao, Sanyang Liu:
Improved artificial bee colony algorithm for global optimization. 871-882
Volume 111, Number 18, September 2011
- Zhenfu Cao, Ivan Visconti, Zongyang Zhang:
On constant-round concurrent non-malleable proof systems. 883-890 - Hirotoshi Honma, Kodai Abe, Shigeru Masuyama:
Erratum and addendum to "A linear time algorithm for finding all hinge vertices of a permutation graph" [Information Processing Letters 59 (2) (1996) 103-107]. 891-894 - Yuval Filmus:
Lower bounds for context-free grammars. 895-898 - Xiang-Lan Cao, Spela Brglez, Simon Spacapan, Elkin Vumar:
On edge connectivity of direct products of graphs. 899-902 - Guiqing Zhang, Chung Keung Poon, Yinfeng Xu:
The ski-rental problem with multiple discount options. 903-906 - Wenhua Li, Jinjiang Yuan:
Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time. 907-911 - Shlomi Dolev, Swan Dubois, Maria Potop-Butucaru, Sébastien Tixeuil:
Stabilizing data-link over non-FIFO channels with optimal fault-resilience. 912-920 - Micheal Arockiaraj, Paul D. Manuel, Indra Rajasingh, Bharati Rajan:
Wirelength of 1-fault hamiltonian graphs into wheels and fans. 921-925 - Haizhong Shi, Pan-feng Niu, Jian-bo Lu:
One conjecture of bubble-sort graphs. 926-929 - Verónica Becher, Pablo Ariel Heiber:
On extending de Bruijn sequences. 930-932
Volume 111, Number 19, October 2011
- Gerold Jäger, Marcin Peczarski:
The number of pessimistic guesses in Generalized Black-peg Mastermind. 933-940 - Rafael Grimson, Joos Heintz, Bart Kuijpers:
Efficient evaluation of specific queries in constraint databases. 941-944 - Palash Sarkar:
Tweakable enciphering schemes using only the encryption function of a block cipher. 945-955 - Dae Hyun Yum, Pil Joong Lee:
On the average cost of order-preserving encryption based on hypergeometric distribution. 956-959 - R. B. Sandeep:
Perfectly colorable graphs. 960-961 - Daniel Oron:
Scheduling a batching machine with convex resource consumption functions. 962-967 - Víctor Lavín Puente, Montserrat Hermo:
Negative results on learning multivalued dependencies with queries. 968-972 - Ching-Lueh Chang:
Triggering cascades on undirected connected graphs. 973-978 - Zhenpeng Xu, Chaoguang Men, Weiwei Li, Xiang Li:
Checkpoint scheduling model for optimality. 979-984
Volume 111, Number 20, October 2011
- Chunyan Zhao, Zhiming Zheng:
Threshold behaviors of a random constraint satisfaction problem with exact phase transitions. 985-988 - Mnacho Echenim, Nicolas Peltier:
Modular instantiation schemes. 989-993 - Manoj G. Dixit, S. Ramesh, Pallab Dasgupta:
Some results on Parametric Temporal Logic. 994-998 - Barnaby Martin:
Low-level dichotomy for quantified constraint satisfaction problems. 999-1003 - Xia Zhang, Guizhen Liu:
On edge covering colorings of graphs. 1004-1006 - Helmut Seidl, Andreas Reuß:
Extending H1-clauses with disequalities. 1007-1013 - Chih-Jen Wu, Yu-Wei Chen, Yue-Li Wang:
The minimum bandwidth required at each time slot of the fast broadcasting scheme. 1014-1018 - Bing Wang, Jianliang Wu:
Total coloring of planar graphs with maximum degree 7. 1019-1021 - Kejia Zhang, Hong Gao, Jianzhong Li:
Finding multiple induced disjoint paths in general graphs. 1022-1026 - Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro:
How many oblivious robots can explore a line. 1027-1031
Volume 111, Numbers 21-22, November 2011
- Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Covering and packing in linear space. 1033-1036 - Shuming Zhou, Jun-Ming Xu:
Conditional fault tolerance of arrangement graphs. 1037-1043 - Che Wun Chiou, Chiou-Yng Lee, Yun-Chi Yeh:
Multiplexer implementation of low-complexity polynomial basis multiplier in GF(m2) using all one polynomial. 1044-1047 - Ji Tian, Ruyan Fu, Jinjiang Yuan:
An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times. 1048-1053 - Rudolf Fleischer, Xiaoming Xu:
Computing minimum diameter color-spanning sets is hard. 1054-1056 - Raphael Yuster:
A shortest cycle for each vertex of a graph. 1057-1061 - Hao Fan, Hal A. Kierstead, Guizhen Liu, Theodore Molla, Jianliang Wu, Xin Zhang:
A note on relaxed equitable coloring of graphs. 1062-1066 - Bo-Yi Wang, Hsueh-I Lu:
Two-dimensional homing sort. 1067-1071 - Richard S. Bird:
A simple division-free algorithm for computing determinants. 1072-1074 - Jens Vygen:
Faster algorithm for optimum Steiner trees. 1075-1079
Volume 111, Numbers 23-24, December 2011
- Kazuyuki Amano:
Minterm-transitive functions with asymptotically smallest block sensitivity. 1081-1084 - Hong-Jian Lai, Hao Li, Ping Li, Yanting Liang, Senmei Yao:
Mod (2p+1)-orientations in line graphs. 1085-1088 - Michael Lampis:
A kernel of order 2 k-c log k for vertex cover. 1089-1091 - Erlin Yao, Yungang Bao, Mingyu Chen:
What Hill-Marty model learn from and break through Amdahlʼs law? 1092-1095 - Guillaume Chapuy, Ines Klimann:
On the supports of recognizable series over a field and a single letter alphabet. 1096-1098 - Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk:
Capacitated domination faster than O(n2). 1099-1103 - Zuosong Liang, Erfang Shan:
Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs. 1104-1107 - Maria Patricia Dobson, Valeria A. Leoni, Graciela L. Nasini:
The multiple domination and limited packing problems in graphs. 1108-1113 - Marzieh Malekimajd, Mohammad Reza Hoseiny Farahabady, Ali Movaghar, Hamid Sarbazi-Azad:
Pancyclicity of OTIS (swapped) networks based on properties of the factor graph. 1114-1119 - Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
Low-interference networks in metric spaces of bounded doubling dimension. 1120-1123 - Xiaofeng Gu, Hong-Jian Lai, Senmei Yao:
Characterization of minimally (2, l)-connected graphs. 1124-1129
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-16 20:19 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:
