The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "Inf. Process. Lett."( http://dblp.L3S.de/Venues/Inf._Process._Lett. )

URL (DBLP): http://dblp.uni-trier.de/db/journals/ipl

Publication years (Num. hits)
1971 (18) 1972 (42) 1973 (39) 1974 (26) 1975 (57) 1976 (69) 1977 (56) 1978 (77) 1979 (128) 1980 (116) 1981 (119) 1982 (106) 1983 (111) 1984 (102) 1985 (99) 1986 (120) 1987 (179) 1988 (185) 1989 (205) 1990 (193) 1991 (232) 1992 (238) 1993 (206) 1994 (220) 1995 (237) 1996 (218) 1997 (210) 1998 (206) 1999 (165) 2000 (146) 2001 (127) 2002 (207) 2003 (205) 2004 (189) 2005 (173) 2006 (178) 2007 (184) 2008 (254) 2009 (241) 2010 (219) 2011 (188) 2012 (113)
Publication types (Num. hits)
article(6403)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 6403 publication records. Showing 6403 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Wenjie 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. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1James Aspnes, Yitong Yin Randomized load balancing by joining and splitting bins. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Xiaofan Yang, Lei Wang, Luxing Yang Optimal broadcasting for locally twisted cubes. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Daniel Turetsky A K-trivial set which is not jump traceable at certain orders. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Bart Mennink Increasing the flexibility of the herding attack. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Ilya Sergey, Dave Clarke A correspondence between type checking via reduction and type checking via evaluation. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Fang Tian, Zi-Long Liu Probabilistic single obnoxious facility location with fixed budget. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nili Guttmann-Beck, Refael Hassin Series-parallel orientations preserving the cycle-radius. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Reiko Takehara, Masahiro Hachimori, Maiko Shigeno A comment on pure-strategy Nash equilibria in competitive diffusion games. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Amit Chakrabarti A note on randomized streaming space bounds for the longest increasing subsequence problem. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Qingju Wang, Andrey Bogdanov The provable constructive effect of diffusion switching mechanism in CLEFIA-type block ciphers. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Janusz Dybizbanski, Anna Nenca Oriented chromatic number of grids is greater than 7. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Evgeny R. Gafarov, Alexander A. Lazarev, Frank Werner A note on a single machine scheduling problem with generalized total tardiness objective function. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Zongyang Zhang, Zhenfu Cao Concurrent non-malleable statistically hiding commitment. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Adam O. Kalinich Flipping the winner of a poset game. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Shayan Ehsani, Mohammad Ghodsi, Ahmad Khajenezhad, Hamid Mahini, Afshin Nikzad Optimal online pricing with network externalities. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Florian Sikora On the parameterized complexity of the repetition free longest common subsequence problem. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Michal Kotrbcík A note on disjoint cycles. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Maxim Sviridenko A note on the Kenyon-Remila strip-packing algorithm. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Sheng Yu, Prudence W. H. Wong A note on "An optimal online algorithm for single machine scheduling to minimize total general completion time". Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jinsoo Hwang, Jeankyung Kim, Kichang Kim Analysis of the false-positive error rate of tagged fragment marking scheme. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Sergey Bereg Computing generalized ham-sandwich cuts. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Effat Farhana, M. Sohel Rahman Doubly-Constrained LCS and Hybrid-Constrained LCS problems revisited. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Or Meir On the rectangle method in proofs of robustness of tensor products. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Mereke van Garderen, Giuseppe Liotta, Henk Meijer Universal point sets for 2-coloured trees. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Chen Su, Haining Fan Impact of Intel's new instruction sets on software implementation of GF(2)[x] multiplication. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Indra Rajasingh, Bharati Rajan, R. Sundara Rajan Embedding of hypercubes into necklace, windmill and snake graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Joanna Skowronek-Kaziów Multiplicative vertex-colouring weightings of graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Pavel Hrubes On the nonnegative rank of distance matrices. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Xin Zhang, Guizhen Liu On edge colorings of 1-planar graphs without adjacent triangles. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Reza Dorrigiv, Alejandro López-Ortiz List update with probabilistic locality of reference. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Xie-Bin Chen Paired many-to-many disjoint path covers of hypercubes with faulty edges. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Yu Li, Dachuan Xu, Donglei Du, Naihua Xiu Improved approximation algorithms for the robust fault-tolerant facility location problem. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Robin Houston, Joseph White, Martyn Amos Zen Puzzle Garden is NP-complete. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Clemens Dubslaff, Christel Baier, Manuela Berg Model checking probabilistic systems against pushdown specifications. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Stanley P. Y. Fung, Chung Keung Poon, Duncan K. W. Yung On-line scheduling of equal-length intervals on parallel machines. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting, Joseph Wun-Tat Chan, Xin Han, Ka-Cheong Lam Online call control in cellular networks revisited. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Xiaoni Du, Andrew Klapper, Zhixiong Chen Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Vladimir V. Podolskii Exponential lower bound for bounded depth circuits with few threshold gates. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Beibei Ma, Baoyindureng Wu, Wanping Zhang Proximity and average eccentricity of a graph. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Konstantin Kutzkov An exact exponential time algorithm for counting bipartite cliques. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Qiang Cheng, Feng Chen, Wenli Xu, Song Wang Recursive sum-product algorithm for generalized outer-planar graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Shiying Wang, Lei Zhang, Shangwei Lin A neighborhood condition for graphs to be maximally k-restricted edge connected. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jean-François Couturier, Dieter Kratsch Bicolored independent sets and bicliques. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Yun-Ping Deng, Xiao-Dong Zhang Automorphism groups of the Pancake graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Michael Thomas On the applicability of Post's lattice. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Norichika Matsuki An analytic criterion for CSAT. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Andris Ambainis, Abuzer Yakaryilmaz Superiority of exact quantum automata for promise problems. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1David Clark, Robert M. Hierons Squeeziness: An information theoretic measure for avoiding fault masking. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Mieczyslaw Borowiecki, Jaroslaw Grytczuk, Monika Pilsniak Coloring chip configurations on graphs and digraphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Fabiano C. Botelho, Nicholas C. Wormald, Nivio Ziviani Cores of random r-partite hypergraphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Sebastian Deorowicz Quadratic-time algorithm for a string constrained LCS problem. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Vassilis Giakoumakis Maximum Weight Independent Sets in hole- and co-chair-free graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Alexander Golynski, Alejandro López-Ortiz Optimal strategies for the list update problem under the MRM alternative cost model. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1László Csirmaz Complexity of universal access structures. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Ashley Montanaro The quantum query complexity of learning multilinear polynomials. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jian Wang, Xirong Xu, Dejun Zhu, Liqing Gao, Jun-Ming Xu On the bounds of feedback numbers of (n, k)-star graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Martin Kochol, Riste Skrekovski Brooksʼ Theorem for generalized dart graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Cui Yu, Xiaofan Yang, Luxing Yang, Jing Zhang Routing and wavelength assignment for 3-ary n-cube in array-based optical network. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Robert Crowston, Gregory Gutin, M. Jones, A. Yeo Parameterized Eulerian strong component arc deletion problem on tournaments. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Shay Gueron Speeding up CRC32C computations with Intel CRC32 instruction. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jiyou Li On the average sensitivity of the weighted sum function. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Dorothea Baumeister, Jörg Rothe Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Mingyu Xiao, Hiroshi Nagamochi An FPT algorithm for edge subset feedback edge set. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura Singleton and 2-periodic attractors of sign-definite Boolean networks. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Feng Wang, Wensong Lin Group path covering and L(j, k)-labelings of diameter two graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Liting Zhang, Wenling Wu, Peng Wang, Bo Liang TrCBC: Another look at CBC-MAC. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Tibor Jordán Highly connected molecular graphs are rigid in three dimensions. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Zhengnan Shi A self-stabilizing algorithm to maximal 2-packing with improved complexity. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Gaocai Wang, Guojun Wang, Zhiguang Shan Fault tolerance analysis of mesh networks with uniform versus nonuniform node failure probability. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1A. Ahadi, A. Dehghan, M. Kazemi, E. Mollaahmadi Computation of lucky number of planar graphs is NP-hard. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Rasmus Pagh, Charalampos E. Tsourakakis Colorful triangle counting and a MapReduce implementation. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Robert E. Jamison, Darren A. Narayan Max-optimal and sum-optimal labelings of graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Manfred Schmidt-Schauß, Georg Schnitger Fast equality test for straight-line compressed strings. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Iksoon 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. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Deke 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. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Lukas Moll, Siamak Tazari, Marc Thurley Computing hypergraph width measures exactly. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jan Krajícek A note on SAT algorithms and proof complexity. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Wenhua Li, Zhenkun Zhang, Sufang Yang Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Xiaomin Zhu, Hao Guo, Shaoshuai Liang, Xiaoling Yang An improved security-aware packet scheduling algorithm in real-time wireless networks. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Sonia L. Rueda, Juana Sendra On the performance of the approximate parametrization algorithm for curves. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Phokion G. Kolaitis, Enela Pema A dichotomy in the complexity of consistent query answering for queries with two atoms. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Bogdan Aman, Gabriel Ciobanu Properties of enhanced mobile membranes via coloured Petri nets. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Carla 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. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Chen Yuan, Qian Guo, Haibin Kan A novel elementary construction of matching vectors. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Leena Salmela Average complexity of backward q-gram string matching algorithms. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Edward A. Hirsch, Dmitry Itsykson On an optimal randomized acceptor for graph nonisomorphism. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Amr Elmasry On the size of the subset partial order. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Qiping Lin, Fangguo Zhang Efficient precomputation schemes of kP+IQ. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Chia-Jung Chang, Kun-Mao Chao Efficient algorithms for local ranking. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Eduardo C. Xavier A note on a Maximum k-Subset Intersection problem. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Noga Alon, Amit Weinstein Local correction of juntas. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno Bandwidth of convex bipartite graphs and related graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jing He, Hongyu Liang On rainbow-k-connectivity of random graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Wen-Hung Kuo, Dar-Li Yang A short note on "Proportionate flowshops with general position-dependent processing times". Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Bernardo M. Ábrego, Mario Cetina, Jesús Leaños, Gelasio Salazar Visibility-preserving convexifications using single-vertex moves. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Vince Bárány, Mikolaj Bojanczyk Finite satisfiability for guarded fixpoint logic. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Benjamin Doerr, Carola Winzen Memory-restricted black-box complexity of OneMax. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Sven Oliver Krumke, Clemens Thielen Erratum to "Minimum cost flows with minimum quantities" [Information Processing Letters 111 (11) (2011) 533-537]. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Yoann Dieudonné, Andrzej Pelc Deterministic network exploration by a single agent with Byzantine tokens. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 6403 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.