Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Bastea, S.
and
Duxbury, P. M.
1998.
Ground state structure of random magnets.
Physical Review E,
Vol. 58,
Issue. 4,
p.
4261.
Bastea, S.
1998.
Degeneracy algorithm for random magnets.
Physical Review E,
Vol. 58,
Issue. 6,
p.
7978.
Leung, Debbie W.
Chuang, Isaac L.
Yamaguchi, Fumiko
and
Yamamoto, Yoshihisa
2000.
Efficient implementation of coupled logic gates for quantum computation.
Physical Review A,
Vol. 61,
Issue. 4,
Beutelspacher, Albrecht
and
Zschiegner, Marc-Alexander
2002.
Diskrete Mathematik für Einsteiger.
p.
45.
Singhi, N. M.
Vijayakumar, G. R.
and
Devi, N. Usha
2002.
The Induced Partial Order on the set of Finite Subsets of a Partially Ordered Set.
American Journal of Mathematical and Management Sciences,
Vol. 22,
Issue. 3-4,
p.
227.
Vasic, B.
Kurtas, E.M.
and
Kuznetsov, A.V.
2002.
LDPC codes based on mutually orthogonal latin rectangles and their application in perpendicular magnetic recording.
IEEE Transactions on Magnetics,
Vol. 38,
Issue. 5,
p.
2346.
Beutelspacher, Albrecht
and
Zschiegner, Marc-Alexander
2002.
Diskrete Mathematik für Einsteiger.
p.
163.
Hellerstein, Joseph M.
Koutsoupias, Elias
Miranker, Daniel P.
Papadimitriou, Christos H.
and
Samoladas, Vasilis
2002.
On a model of indexability and its bounds for range queries.
Journal of the ACM,
Vol. 49,
Issue. 1,
p.
35.
Beutelspacher, Albrecht
and
Zschiegner, Marc-Alexander
2002.
Diskrete Mathematik für Einsteiger.
p.
1.
Lindkvist, T.
Lofvenberg, J.
and
Svanstrom, M.
2002.
A class of traceability codes.
IEEE Transactions on Information Theory,
Vol. 48,
Issue. 7,
p.
2094.
Gossner, Olivier
and
Hernández, Penélope
2003.
On the Complexity of Coordination.
Mathematics of Operations Research,
Vol. 28,
Issue. 1,
p.
127.
Itoh, Toshiya
Takei, Yoshinori
and
Tarui, Jun
2003.
On the sample size ofk-restricted min-wise independent permutations and otherk-wise distributions.
p.
710.
Gorokhov, A.
2003.
Bit sharing for layered space-time architectures with ordered signal retrieval.
IEEE Transactions on Communications,
Vol. 51,
Issue. 11,
p.
1809.
Iyengar, V.
Chakrabarty, K.
and
Marinissen, E.J.
2003.
Efficient test access mechanism optimization for system-on-chip.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems,
Vol. 22,
Issue. 5,
p.
635.
Davis, Benjamin Lent
and
Maclagan, Diane
2003.
The card game set.
The Mathematical Intelligencer,
Vol. 25,
Issue. 3,
p.
33.
Kashyap, N.
and
Vardy, A.
2003.
Stopping sets in codes from designs.
p.
122.
Pimentel, C.
and
Uchoa-Filho, B.F.
2003.
A combinatorial approach to finding the capacity of the discrete noiseless channel.
IEEE Transactions on Information Theory,
Vol. 49,
Issue. 8,
p.
2024.
Vasic, B.
and
Milenkovic, O.
2004.
Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding.
IEEE Transactions on Information Theory,
Vol. 50,
Issue. 6,
p.
1156.
Hawkins, Peter
Lagoon, Vitaly
and
Stuckey, Peter J.
2004.
AI 2004: Advances in Artificial Intelligence.
Vol. 3339,
Issue. ,
p.
706.
Raphael, B.
Lung-Tien Liu
and
Varghese, G.
2004.
A uniform projection method for motif discovery in DNA sequences.
IEEE/ACM Transactions on Computational Biology and Bioinformatics,
Vol. 1,
Issue. 2,
p.
91.