default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 112
Volume 112, Numbers 1-2, January 2012
- Mieczyslaw Borowiecki, Jaroslaw Grytczuk
, Monika Pilsniak:
Coloring chip configurations on graphs and digraphs. 1-4 - Mingyu Xiao, Hiroshi Nagamochi:
An FPT algorithm for edge subset feedback edge set. 5-9 - Maxim Sviridenko:
A note on the Kenyon-Remila strip-packing algorithm. 10-12 - Ilya Sergey, Dave Clarke:
A correspondence between type checking via reduction and type checking via evaluation. 13-20 - Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting, Joseph Wun-Tat Chan, Xin Han, Ka-Cheong Lam:
Online call control in cellular networks revisited. 21-25 - Robert E. Jamison, Darren A. Narayan:
Max-optimal and sum-optimal labelings of graphs. 26-31 - Benjamin Doerr, Carola Winzen:
Memory-restricted black-box complexity of OneMax. 32-34 - Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura:
Singleton and 2-periodic attractors of sign-definite Boolean networks. 35-38 - Rani Izsak, Zeev Nutov:
A note on labeling schemes for graph connectivity. 39-43 - Michael D. Barrus:
Havel-Hakimi residues of unigraphs. 44-48 - Pranjal Awasthi, Avrim Blum, Or Sheffet:
Center-based clustering under perturbation stability. 49-54 - Sheng Yu, Prudence W. H. Wong:
A note on "An optimal online algorithm for single machine scheduling to minimize total general completion time". 55-58
Volume 112, Number 3, January 2012
- Reiko Takehara, Masahiro Hachimori, Maiko Shigeno:
A comment on pure-strategy Nash equilibria in competitive diffusion games. 59-60 - Xie-Bin Chen:
Paired many-to-many disjoint path covers of hypercubes with faulty edges. 61-66 - Andreas Brandstädt, Vassilis Giakoumakis:
Maximum Weight Independent Sets in hole- and co-chair-free graphs. 67-71 - Evgeny R. Gafarov, Alexander A. Lazarev, Frank Werner:
A note on a single machine scheduling problem with generalized total tardiness objective function. 72-76 - Phokion G. Kolaitis, Enela Pema:
A dichotomy in the complexity of consistent query answering for queries with two atoms. 77-85 - Adam O. Kalinich:
Flipping the winner of a poset game. 86-89 - Jin-Ghoo Choi:
Analysis of total average queue length in multi-hop wireless networks. 90-94 - Shiying Wang, Lei Zhang, Shangwei Lin:
A neighborhood condition for graphs to be maximally k-restricted edge connected. 95-97 - Bart Mennink:
Increasing the flexibility of the herding attack. 98-105 - Robin Houston, Joseph White, Martyn Amos:
Zen Puzzle Garden is NP-complete. 106-108
Volume 112, Number 4, February 2012
- Arash Ahadi, Ali Dehghan, Mohammad Reza Kazemi, E. Mollaahmadi:
Computation of lucky number of planar graphs is NP-hard. 109-112 - Janusz Dybizbanski, Anna Nenca:
Oriented chromatic number of grids is greater than 7. 113-117 - Shayan Ehsani, Mohammad Ghodsi, Ahmad Khajenezhad, Hamid Mahini, Afshin Nikzad:
Optimal online pricing with network externalities. 118-123 - Feng Wang, Wensong Lin:
Group path covering and L(j, k)-labelings of diameter two graphs. 124-128 - Xiaofan Yang, Lei Wang, Luxing Yang:
Optimal broadcasting for locally twisted cubes. 129-134 - Michal Kotrbcík:
A note on disjoint cycles. 135-137 - Xin Zhang, Guizhen Liu:
On edge colorings of 1-planar graphs without adjacent triangles. 138-142 - Jiyou Li:
On the average sensitivity of the weighted sum function. 143-148 - László Csirmaz:
Complexity of universal access structures. 149-152 - Nili Guttmann-Beck, Refael Hassin:
Series-parallel orientations preserving the cycle-radius. 153-160
Volume 112, Number 5, February 2012
- Bernardo M. Ábrego, Mario Cetina, Jesús Leaños, Gelasio Salazar:
Visibility-preserving convexifications using single-vertex moves. 161-163 - Norichika Matsuki:
An analytic criterion for CSAT. 164-165 - Edward A. Hirsch, Dmitry Itsykson:
On an optimal randomized acceptor for graph nonisomorphism. 166-171 - Sonia L. Rueda, Juana Sendra:
On the performance of the approximate parametrization algorithm for curves. 172-178 - Shay Gueron:
Speeding up CRC32C computations with Intel CRC32 instruction. 179-185 - Dorothea Baumeister, Jörg Rothe:
Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules. 186-190 - Joanna Skowronek-Kaziów:
Multiplicative vertex-colouring weightings of graphs. 191-194 - Fang Tian, Zi-Long Liu:
Probabilistic single obnoxious facility location with fixed budget. 195-199 - Martin Kochol, Riste Skrekovski:
Brooksʼ Theorem for generalized dart graphs. 200-204 - Deke Guo, Guiming Zhu, Hai Jin, Panlong Yang, Yingwen Chen, Xianqing Yi, Junxian Liu:
Möbius-deBruijn: The product of Möbius cube and deBruijn digraph. 205-211
Volume 112, Number 6, March 2012
- Antti Valmari:
Fast brief practical DFA minimization. 213-217 - Alexander Golynski, Alejandro López-Ortiz:
Optimal strategies for the list update problem under the MRM alternative cost model. 218-222 - Noga Alon, Amit Weinstein:
Local correction of juntas. 223-226 - Jinsoo Hwang, Jeankyung Kim, Kichang Kim:
Analysis of the false-positive error rate of tagged fragment marking scheme. 227-232 - Xiaoni Du, Andrew Klapper, Zhixiong Chen:
Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations. 233-237 - Lukas Moll, Siamak Tazari, Marc Thurley:
Computing hypergraph width measures exactly. 238-242 - Bogdan Aman, Gabriel Ciobanu:
Properties of enhanced mobile membranes via coloured Petri nets. 243-248 - Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo:
Parameterized Eulerian strong component arc deletion problem on tournaments. 249-251 - Cui Yu, Xiaofan Yang, Luxing Yang, Jing Zhang:
Routing and wavelength assignment for 3-ary n-cube in array-based optical network. 252-256 - Or Meir:
On the rectangle method in proofs of robustness of tensor products. 257-260
Volume 112, Number 7, March 2012
- Amit Chakrabarti:
A note on randomized streaming space bounds for the longest increasing subsequence problem. 261-263 - Yun-Ping Deng, Xiao-Dong Zhang:
Automorphism groups of the Pancake graphs. 264-266 - Vladimir V. Podolskii:
Exponential lower bound for bounded depth circuits with few threshold gates. 267-271 - Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Florian Sikora:
On the parameterized complexity of the repetition free longest common subsequence problem. 272-276 - Rasmus Pagh, Charalampos E. Tsourakakis:
Colorful triangle counting and a MapReduce implementation. 277-281 - Xiaomin Zhu, Hao Guo, Shaoshuai Liang, Xiaoling Yang:
An improved security-aware packet scheduling algorithm in real-time wireless networks. 282-288 - Andris Ambainis, Abuzer Yakaryilmaz:
Superiority of exact quantum automata for promise problems. 289-291 - Wenhua Li, Zhenkun Zhang, Sufang Yang:
Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead. 292-297 - Iksoon Hwang, Nina Yevtushenko, Ana R. Cavalli:
Tight bound on the length of distinguishing sequences for non-observable nondeterministic Finite-State Machines with a polynomial number of inputs and outputs. 298-301 - Liting Zhang, Wenling Wu, Peng Wang, Bo Liang:
TrCBC: Another look at CBC-MAC. 302-307
Volume 112, Numbers 8-9, April 2012
- James Aspnes, Yitong Yin:
Randomized load balancing by joining and splitting bins. 309-313 - Fabiano C. Botelho, Nicholas C. Wormald, Nivio Ziviani:
Cores of random r-partite hypergraphs. 314-319 - Clemens Dubslaff, Christel Baier, Manuela Berg:
Model checking probabilistic systems against pushdown specifications. 320-328 - Jean-François Couturier, Dieter Kratsch:
Bicolored independent sets and bicliques. 329-334 - David Clark, Robert M. Hierons:
Squeeziness: An information theoretic measure for avoiding fault masking. 335-340 - Manfred Schmidt-Schauß, Georg Schnitger:
Fast equality test for straight-line compressed strings. 341-345 - Mereke van Garderen, Giuseppe Liotta, Henk Meijer:
Universal point sets for 2-coloured trees. 346-350 - Oded Goldreich, Or Meir:
The tensor product of two good codes is not necessarily robustly testable. 351-355 - Tibor Jordán:
Highly connected molecular graphs are rigid in three dimensions. 356-359
Volume 112, Number 10, May 2012
- Yu Li, Dachuan Xu, Donglei Du, Naihua Xiu:
Improved approximation algorithms for the robust fault-tolerant facility location problem. 361-364 - Masao Kumamoto, Eiji Miyano:
Optimal distortion embedding of complete binary trees into lines. 365-370 - Vince Bárány, Mikolaj Bojanczyk:
Finite satisfiability for guarded fixpoint logic. 371-375 - Stanley P. Y. Fung, Chung Keung Poon, Duncan K. W. Yung:
On-line scheduling of equal-length intervals on parallel machines. 376-379 - João Pedro Barreto, Luís Veiga, Paulo Ferreira:
Hash challenges: Stretching the limits of compare-by-hash in distributed data deduplication. 380-385 - Michael Thomas:
On the applicability of Post's lattice. 386-391 - Beibei Ma, Baoyindureng Wu, Wanping Zhang:
Proximity and average eccentricity of a graph. 392-395 - Gaocai Wang, Guojun Wang, Zhiguang Shan:
Fault tolerance analysis of mesh networks with uniform versus nonuniform node failure probability. 396-401 - Hechao Wang, Erfang Shan, Wei Wang:
On the super connectivity of Kronecker products of graphs. 402-405 - Jing He, Hongyu Liang:
On rainbow-k-connectivity of random graphs. 406-410
Volume 112, Number 11, June 2012
- Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno:
Bandwidth of convex bipartite graphs and related graphs. 411-417 - Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, Katharina Anna Zweig:
Drawing trees in a streaming model. 418-422 - Sebastian Deorowicz:
Quadratic-time algorithm for a string constrained LCS problem. 423-426 - Qingju Wang, Andrey Bogdanov:
The provable constructive effect of diffusion switching mechanism in CLEFIA-type block ciphers. 427-432 - Leena Salmela:
Average complexity of backward q-gram string matching algorithms. 433-437 - Ashley Montanaro:
The quantum query complexity of learning multilinear polynomials. 438-442 - Zongyang Zhang, Zhenfu Cao:
Concurrent non-malleable statistically hiding commitment. 443-448 - Qiang Cheng, Feng Chen, Wenli Xu, Song Wang:
Recursive sum-product algorithm for generalized outer-planar graphs. 449-456 - Pavel Hrubes:
On the nonnegative rank of distance matrices. 457-461 - Qiping Lin, Fangguo Zhang:
Efficient precomputation schemes of kP+IQ. 462-466
Volume 112, Number 12, June 2012
- Yoann Dieudonné, Andrzej Pelc:
Deterministic network exploration by a single agent with Byzantine tokens. 467-470 - Eduardo C. Xavier:
A note on a Maximum k-Subset Intersection problem. 471-472 - Jian Wang, Xirong Xu, Dejun Zhu, Liqing Gao, Jun-Ming Xu:
On the bounds of feedback numbers of (n, k)-star graphs. 473-478 - Wen-Hung Kuo, Dar-Li Yang:
A short note on "Proportionate flowshops with general position-dependent processing times". 479-480 - Noam Goldberg, Jonathan Eckstein:
Sparse weighted voting classifier selection and its linear programming relaxations. 481-486 - Amr Elmasry:
On the size of the subset partial order. 487-489 - Jan Krajícek:
A note on SAT algorithms and proof complexity. 490-493 - Chen Yuan, Qian Guo, Haibin Kan:
A novel elementary construction of matching vectors. 494-496 - Chen Su, Haining Fan:
Impact of Intel's new instruction sets on software implementation of GF(2)[x] multiplication. 497-502 - Wenjie Li, Zhenkun Zhang, Hailing Liu, Jinjiang Yuan:
Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs. 503-508 - Indra Rajasingh, Bharati Rajan, R. Sundara Rajan:
Embedding of hypercubes into necklace, windmill and snake graphs. 509-515
Volume 112, Number 13, July 2012
- Chia-Jung Chang, Kun-Mao Chao:
Efficient algorithms for local ranking. 517-522 - Sven Oliver Krumke, Clemens Thielen:
Erratum to "Minimum cost flows with minimum quantities" [Information Processing Letters 111 (11) (2011) 533-537]. 523-524 - Zhengnan Shi:
A self-stabilizing algorithm to maximal 2-packing with improved complexity. 525-531 - Sergey Bereg:
Computing generalized ham-sandwich cuts. 532-534 - Konstantin Kutzkov:
An exact exponential time algorithm for counting bipartite cliques. 535-539 - Reza Dorrigiv, Alejandro López-Ortiz:
List update with probabilistic locality of reference. 540-543 - Daniel Turetsky:
A K-trivial set which is not jump traceable at certain orders. 544-547 - Xingyu Yang, Weiguo Zhang, Yong Zhang, Weijun Xu:
Optimal randomized algorithm for a generalized ski-rental with interest rate. 548-551 - B. S. Panda, Preeti Goel:
L(2,1)-labeling of dually chordal graphs and strongly orderable graphs. 552-556 - Anna Fiedorowicz, Mariusz Haluszczak:
Acyclic chromatic indices of fully subdivided graphs. 557-561 - Effat Farhana, M. Sohel Rahman:
Doubly-Constrained LCS and Hybrid-Constrained LCS problems revisited. 562-565
Volume 112, Numbers 14-15, August 2012
- Petra Sparl, Rafal Witkowski, Janez Zerovnik:
A linear time algorithm for 7-[3]coloring triangle-free hexagonal graphs. 567-571 - Daniel Reidenbach, Markus L. Schmid:
On multi-head automata with restricted nondeterminism. 572-577 - Dimitri Isaak, Christof Löding:
Efficient inclusion testing for simple classes of unambiguous ω-automata. 578-582 - Indra Rajasingh, Micheal Arockiaraj, Bharati Rajan, Paul D. Manuel:
Minimum wirelength of hypercubes into n-dimensional grid networks. 583-586 - Min Xie, Libin Wang:
One-round identity-based key exchange with Perfect Forward Security. 587-591 - S. Akshay, Blaise Genest, Loïc Hélouët, Shaofa Yang:
Regular set of representatives for time-constrained MSC graphs. 592-598 - Qiang Dong, Junlin Zhou, Yan Fu, Xiaofan Yang:
Embedding a mesh of trees in the crossed cube. 599-603 - Xiaoni Du, Zhixiong Chen, Lei Hu:
Linear complexity of binary sequences derived from Euler quotients with prime-power modulus. 604-609 - Pavel Pudlák:
A lower bound on the size of resolution proofs of the Ramsey theorem. 610-611 - B. Srivathsan, Igor Walukiewicz:
An alternate proof of Statman's finite completeness theorem. 612-616
Volume 112, Number 16, August 2012
- David Duris:
Some characterizations of γ and β-acyclicity of hypergraphs. 617-620 - Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Hao Jiang, Ken Kennedy, Alice A. McRae:
A self-stabilizing algorithm for optimally efficient sets in graphs. 621-623 - Marine Minier, María Naya-Plasencia:
A related key impossible differential attack against 22 rounds of the lightweight block cipher LBlock. 624-629 - Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Yoshio Okamoto, Andreas Spillner:
Vertex angle and crossing angle resolution of leveled tree drawings. 630-635 - Ryo Yoshinaka, Jun Kawahara, Shuhei Denzumi, Hiroki Arimura, Shin-ichi Minato:
Counterexamples to the long-standing conjecture on the complexity of BDD binary operations. 636-640 - Yuxin Wang, Attila Benko, Xin Chen, György Dósa, He Guo, Xin Han, Cecilia Sik-Lányi:
Online scheduling with one rearrangement at the end: Revisited. 641-645 - Pinhui Ke, Shengyuan Zhang:
New classes of quaternary cyclotomic sequence of length 2pm with high linear complexity. 646-650 - Max Dietrich, Catherine McCartin, Charles Semple:
Bounding the maximum size of a minimal definitive set of quartets. 651-655 - José Miguel Cañete Valdeón:
Annotating problem diagrams with architectural tactics for reasoning on quality requirements. 656-661
Volume 112, Numbers 17-18, September 2012
- Claire Mathieu, Olga Ohrimenko:
Lower bounds for randomized algorithms for online chain partitioning. 663-666 - Oriol Farràs, Ignacio Gracia, Sebastià Martín Molleví, Carles Padró:
Linear threshold multisecret sharing schemes. 667-673 - Eddie Cheng, László Lipták, Ke Qiu, Zhizhang Shen:
On deriving conditional diagnosability of interconnection networks. 674-677 - Yun Feng, Wensong Lin:
A proof of a conjecture on multiset coloring the powers of cycles. 678-682 - Hong Lai, Jinghua Xiao, Lixiang Li, Yixian Yang:
Recursive hiding of biometrics-based secret sharing scheme using adversary structure. 683-687 - Tongquan Zhang, Ying Yin:
The minimum spanning tree problem with non-terminal set. 688-690 - Ning Xu:
Complexity of minimum corridor guarding problems. 691-696 - Olivier Baudon, Jakub Przybylo, Mariusz Wozniak:
On minimal arbitrarily partitionable graphs. 697-700 - Xing Chen, Juan Liu, Jixiang Meng:
λ-Optimality of Bipartite Digraphs. 701-705 - Sunil Mathew, M. S. Sunitha:
A characterization of partial blocks in weighted graphs. 706-710
Volume 112, Number 19, October 2012
- Hideo Bannai, Travis Gagie, Tomohiro I, Shunsuke Inenaga, Gad M. Landau, Moshe Lewenstein:
An efficient algorithm to test square-freeness of strings compressed by straight-line programs. 711-714 - Franck van Breugel:
On behavioural pseudometrics and closure ordinals. 715-718 - Janusz Januszewski:
On-line algorithms for 2-space bounded 2-dimensional bin packing. 719-722 - Min-Zheng Shieh, Shi-Chun Tsai, Ming-Chuan Yang:
On the inapproximability of maximum intersection problems. 723-727 - Hongli Zhu:
A two stage scheduling with transportation and batching. 728-731 - Y. Xie, S. Tang, C. Tang, X. Huang:
An efficient algorithm for parameterizing HsMM with Gaussian and Gamma distributions. 732-737 - Federico Della Croce, Christos Koulamas:
A note on minimizing the sum of quadratic completion times on two identical parallel machines. 738-742 - Enrique Gerstl, Gur Mosheiov:
Scheduling on parallel identical machines with job-rejection and position-dependent processing times. 743-747 - Matias Korman:
Minimizing interference in ad hoc networks with bounded communication radius. 748-752 - Chandrashekhar Meshram, Suchitra A. Meshram, Mingwu Zhang:
An ID-based cryptographic mechanisms based on GDLP and IFP. 753-758
Volume 112, Number 20, October 2012
- Qiaoping Guo, Shengjia Li, Ruijuan Li, Gaokui Xu:
Pancyclic out-arcs of a vertex in oriented graphs. 759-761 - Baruch Mor, Gur Mosheiov:
Batch scheduling of identical jobs on parallel identical machines. 762-766 - Hong-Yu Chen, Jian-Ming Qi:
The linear arboricity of planar graphs with maximum degree at least 5. 767-771 - Stasys Jukna:
Clique problem, cutting plane proofs and communication complexity. 772-777 - Justin Iwerks, Joseph S. B. Mitchell:
The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices. 778-782 - Jaeheung Lee, Seokhyun Kim, Yookun Cho, Yoojin Chung, Yongsu Park:
HORSIC: An efficient one-time signature scheme for wireless sensor networks. 783-787 - Yi-Wei Ci, Zhan Zhang, De-Cheng Zuo, Zhibo Wu, Xiao-Zong Yang:
A multi-cycle checkpointing protocol that ensures strict 1-rollback. 788-793 - Seung Geol Choi, Hoeteck Wee:
Lossy trapdoor functions from homomorphic reproducible encryption. 794-798 - Mehrnoush Malekesmaeili, Cédric Chauve, Tamon Stephen:
A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix. 799-803
Volume 112, Number 21, November 2012
- Miodrag J. Mihaljevic, Sugata Gangopadhyay, Goutam Paul, Hideki Imai:
Internal state recovery of keystream generator LILI-128 based on a novel weakness of the employed Boolean function. 805-810 - Enes Pasalic, Wei-Guo Zhang:
On multiple output bent functions. 811-815 - Dinabandhu Pradhan:
Algorithmic aspects of k-tuple total domination in graphs. 816-822 - GuiPing Wang, Shuyu Chen, Xiaoqin Zhang, Zhen Zhou:
Topological ordering algorithm for LDAG. 823-828 - Raquel S. F. Bravo, Sulamita Klein, Loana Tito Nogueira, Fábio Protti, Rudini Menezes Sampaio:
Partitioning extended P4-laden graphs into cliques and stable sets. 829-834 - Ming Liu, Feifeng Zheng, Chengbin Chu, Yinfeng Xu:
Single-machine scheduling with past-sequence-dependent delivery times and release times. 835-838 - Hsun Su, Yuan-Kang Shih, Shin-Shin Kao:
On the 1-fault hamiltonicity for graphs satisfying Ore's theorem. 839-843 - Radek Slíva:
Antimagic labeling graphs with a regular dominating subgraph. 844-847
Volume 112, Number 22, November 2012
- Willy Picard:
Membership(s) and compliance(s) with class-based graphs. 849-855 - Shashank Agrawal:
Verifiable secret sharing in a total of three rounds. 856-859 - Jyhjong Lin:
Enhancing customer relationships by semantic consumer support systems. 860-868 - Qichun Wang, Chik How Tan:
A note on the algebraic immunity of the Maiorana-McFarland class of bent functions. 869-871 - Qunxiong Zheng, Wenfeng Qi, Tian Tian:
On the distinctness of modular reductions of primitive sequences modulo square-free odd integers. 872-875 - Da-Zhi Sun, Jin-Peng Huai, Jian-Xin Li:
A note on asynchronous multi-exponentiation algorithm using binary representation. 876-879 - Chunli Cai, Dezheng Xie, Wenjuan Yang:
A result on linear coloring of planar graphs. 880-884 - Angsuman Das, Avishek Adhikari:
An efficient IND-CCA2 secure Paillier-based cryptosystem. 885-888 - Ioannis Koutis:
Constrained multilinear detection for faster functional motif discovery. 889-892
Volume 112, Number 23, December 2012
- Seth Pettie:
A simple reduction from maximum weight matching to maximum cardinality matching. 893-898 - Edyta Szymanska:
H-colorings of dense hypergraphs. 899-902 - Martin Olsen, Lars Bækgaard, Torben Tambo:
On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities. 903-907 - Xiaoguang Bao, Zhaohui Liu:
An improved approximation algorithm for the clustered traveling salesman problem. 908-910 - Hiroshi Fujiwara, Yoshiyuki Sekiguchi:
An improved analysis of SRPT scheduling algorithm on the basis of functional optimization. 911-915 - Shiwei Yu, Ting-Zhu Huang, Xiaoyun Liu, Wufan Chen:
Information measures based on fractional calculus. 916-921 - Apurv Nakade, Somenath Biswas:
Effect of increasing the energy gap between the two lowest energy states on the mixing time of the Metropolis algorithm. 922-927 - Dietmar Berwanger, Olivier Serre:
Parity games on undirected graphs. 928-932 - Dimitrios I. Diochnos, Robert H. Sloan, György Turán:
On multiple-instance learning of halfspaces. 933-936
Volume 112, Number 24, December 2012
- Jakarin Chawachat, Jittat Fakcharoenphol, Wattana Jindaluang:
The non-uniform Bounded Degree Minimum Diameter Spanning Tree problem with an application in P2P networking. 937-941 - Martin Kochol:
Non-extendible latin parallelepipeds. 942-943 - Peter Dankelmann, David Erwin, Wayne Goddard, Simon Mukwembi, Henda C. Swart:
Eccentric counts, connectivity and chordality. 944-947 - Mitre Costa Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter:
Characterization and recognition of Radon-independent sets in split graphs. 948-952 - Oliver Schaudt, Rainer Schrader:
The complexity of connected dominating sets and total dominating sets with specified induced subgraphs. 953-957 - Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis:
Computing all subtree repeats in ordered trees. 958-962 - Paul Gastin, Nathalie Sznajder:
Decidability of well-connectedness for distributed synthesis. 963-968 - Maurice Jansen:
Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing. 969-975 - Alexandros V. Gerbessiotis:
An improved reliability bound of a probabilistic parallel integer sorting algorithm. 976-979
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-12-19 22:13 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:
