Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
19 | Vania Bogorny, João Francisco Valiati, Sandro da Silva Camargo, Paulo Martins Engel, Bart Kuijpers, Luis Otávio Alvares |
Mining Maximal Generalized Frequent Geographic Patterns with Knowledge Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006), 18-22 December 2006, Hong Kong, China, pp. 813-817, 2006, IEEE Computer Society, 0-7695-2701-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Jingtao Yu, Pingyi Fan, Kai Cai |
Capacity analysis of maximal flow in ad hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWCMC ![In: Proceedings of the International Conference on Wireless Communications and Mobile Computing, IWCMC 2006, Vancouver, British Columbia, Canada, July 3-6, 2006, pp. 1225-1228, 2006, ACM, 1-59593-306-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
max-flow min-cut, routing, network coding, random graph, network capacity |
19 | Frederik Armknecht, Matthias Krause 0001 |
Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (2) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II, pp. 180-191, 2006, Springer, 3-540-35907-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
matroid union algorithm, boolean functions, algebraic attacks, Cryptographic primitives |
19 | Anirvan DuttaGupta, Arijit Bishnu, Indranil Sengupta 0001 |
Optimisation Problems Based on the Maximal Breach Path Measure for Wireless Sensor Network Coverage. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCIT ![In: Distributed Computing and Internet Technology, Third International Conference, ICDCIT 2006, Bhubaneswar, India, December 20-23, 2006, Proceedings, pp. 27-40, 2006, Springer, 3-540-68379-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Gert Van Dijck, Marc M. Van Hulle |
Onset Detection through Maximal Redundancy Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR (1) ![In: 18th International Conference on Pattern Recognition (ICPR 2006), 20-24 August 2006, Hong Kong, China, pp. 945-949, 2006, IEEE Computer Society, 0-7695-2521-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Carlos E. R. Alves, Edson Norberto Cáceres, Siang Wun Song |
A BSP/CGM Algorithm for Finding All Maximal Contiguous Subsequences of a Sequence of Numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28 - September 1, 2006, Proceedings, pp. 831-840, 2006, Springer, 3-540-37783-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Jan Foniok, Jaroslav Nesetril, Claude Tardif |
Generalised Dualities and Finite Maximal Antichains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers, pp. 27-36, 2006, Springer, 3-540-48381-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Igor Grunsky, Oleksiy Kurganskyy, Igor Potapov |
On a Maximal NFA Without Mergible States. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, First International Symposium on Computer Science in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings, pp. 202-210, 2006, Springer, 3-540-34166-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Xiaoqiu Tan, Min Yao, Jianke Zhang |
Mining Maximal Frequent Access Sequences Based on Improved WAP-tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISDA (1) ![In: Proceedings of the Sixth International Conference on Intelligent Systems Design and Applications (ISDA 2006), October 16-18, 2006, Jinan, China, pp. 616-620, 2006, IEEE Computer Society, 0-7695-2528-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Web Access pattern tree, Restrained sub-tree, Maximum Access Sequence, Web Usage Mining, Sequential pattern mining |
19 | Mohammad El-Hajj, Osmar R. Zaïane |
Parallel Leap: Large-Scale Maximal Pattern Mining in a Distributed Environment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS (1) ![In: 12th International Conference on Parallel and Distributed Systems, ICPADS 2006, Minneapolis, Minnesota, USA, July 12-15, 2006, pp. 135-142, 2006, IEEE Computer Society, 0-7695-2612-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Chau-Yi Chou, Hsi-Ya Chang, Shuen-Tai Wang, Chang-Hsing Wu |
A Semi-Empirical Model for Maximal LINPACK Performance Predictions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCGRID ![In: Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2006), 16-19 May 2006, Singapore, pp. 343-348, 2006, IEEE Computer Society, 0-7695-2585-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Yaochun Huang, Hui Xiong 0001, Weili Wu 0001, Sam Yuan Sung |
Mining Quantitative Maximal Hyperclique Patterns: A Summary of Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD ![In: Advances in Knowledge Discovery and Data Mining, 10th Pacific-Asia Conference, PAKDD 2006, Singapore, April 9-12, 2006, Proceedings, pp. 552-556, 2006, Springer, 3-540-33206-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Gradimir V. Milovanovic, Aleksandar S. Cvetkovic, Marija P. Stanic |
Trigonometric Orthogonal Systems and Quadrature Formulae with Maximal Trigonometric Degree of Exactness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Numerical Methods and Applications ![In: Numerical Methods and Applications, 6th International Conference, NMA 2006, Borovets, Bulgaria, August 20-24, 2006. Revised Papers, pp. 402-409, 2006, Springer, 978-3-540-70940-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Zhongmei Zhou, Zhaohui Wu 0001, Chunshan Wang, Yi Feng 0004 |
Efficiently Mining Maximal Frequent Mutually Associated Patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADMA ![In: Advanced Data Mining and Applications, Second International Conference, ADMA 2006, Xi'an, China, August 14-16, 2006, Proceedings, pp. 110-117, 2006, Springer, 3-540-37025-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Lanju Xu |
Improvement on parameters of Goppa geometry codes from maximal curves using the Vladut-Xing method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 51(6), pp. 2207-2210, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Dumitru Busneag, Dana Piciu |
BL-algebra of fractions and maximal BL-algebra of quotients. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 9(7), pp. 544-555, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
AMS Subject Classification 2000 06D35, 03G25 |
19 | Cinda Heeren, Leonard Pitt |
Maximal boasting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Chicago, Illinois, USA, August 21-24, 2005, pp. 580-585, 2005, ACM, 1-59593-135-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Klaus Schneider 0001, Jens Brandt 0001, Tobias Schüle, Thomas Tuerk |
Maximal Causality Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACSD ![In: Fifth International Conference on Application of Concurrency to System Design (ACSD 2005), 6-9 June 2005, St. Malo, France, pp. 106-115, 2005, IEEE Computer Society, 0-7695-2363-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Jean Cardinal, Martine Labbé, Stefan Langerman, Eythan Levy, Hadrien Mélot |
A Tight Analysis of the Maximal Matching Heuristic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings, pp. 701-709, 2005, Springer, 3-540-28061-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Ping Guo 0003, Yang Zhou 0001, Jun Zhuang, Ting Chen, Yan-Rong Kang |
An Efficient Algorithm for Mining Both Closed and Maximal Frequent Free Subtrees Using Canonical Forms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADMA ![In: Advanced Data Mining and Applications, First International Conference, ADMA 2005, Wuhan, China, July 22-24, 2005, Proceedings, pp. 96-107, 2005, Springer, 3-540-27894-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Nadia Busi |
On the Computational Power of the Mate/Bud/Drip Brane Calculus: Interleaving vs. Maximal Parallelism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Workshop on Membrane Computing ![In: Membrane Computing, 6th International Workshop, WMC 2005, Vienna, Austria, July 18-21, 2005, Revised Selected and Invited Papers, pp. 144-158, 2005, Springer, 3-540-30948-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | János Barát, Alberto Del Fra, Stefano Innamorati, Leo Storme |
Minimal Blocking Sets in PG(2, 8) and Maximal Partial Spreads in PG(3, 8). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 31(1), pp. 15-26, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
finite projective plane, partial spread, non-existence, blocking set |
19 | David A. Drake, Wendy J. Myrvold |
The Non-Existence of Maximal Sets of Four Mutually Orthogonal Latin Squares of Order 8. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 33(1), pp. 63-69, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
mutually orthogonal Latin squares, ovals in nets, projective Hjelmslev plane, net |
19 | Xiaodi Zhang 0001, Norman C. Beaulieu |
SER and outage of threshold-based hybrid selection/maximal-ratio combining over generalized fading channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 52(12), pp. 2143-2153, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Ling Chen 0006, Sourav S. Bhowmick, Liang-Tien Chia |
Mining Maximal Frequently Changing Subtree Patterns from XML Documents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DaWaK ![In: Data Warehousing and Knowledge Discovery, 6th International Conference, DaWaK 2004, Zaragoza, Spain, September 1-3, 2004, Proceedings, pp. 68-76, 2004, Springer, 3-540-22937-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Shuai Ma 0001, Shiwei Tang, Dongqing Yang, Tengjiao Wang 0003, Chanjun Yang |
Incremental Maintenance of Discovered Mobile User Maximal Moving Sequential Patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DASFAA ![In: Database Systems for Advances Applications, 9th International Conference, DASFAA 2004, Jeju Island, Korea, March 17-19, 2004, Proceedings, pp. 824-830, 2004, Springer, 3-540-21047-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Moving sequential pattern, Data mining, Incremental maintenance |
19 | Joel M. Gompert |
Local Search with Maximal Independent Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2004, 10th International Conference, CP 2004, Toronto, Canada, September 27 - October 1, 2004, Proceedings, pp. 795, 2004, Springer, 3-540-23241-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Jitender S. Deogun, Liying Jiang, Vijay V. Raghavan 0001 |
Discovering Maximal Potentially Useful Association Rules Based on Probability Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Rough Sets and Current Trends in Computing ![In: Rough Sets and Current Trends in Computing, 4th International Conference, RSCTC 2004, Uppsala, Sweden, June 1-5, 2004, Proceedings, pp. 274-284, 2004, Springer, 3-540-22117-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Miklós Csürös |
Algorithms for Finding Maximal-Scoring Segment Sets (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: Algorithms in Bioinformatics, 4th International Workshop, WABI 2004, Bergen, Norway, September 17-21, 2004, Proceedings, pp. 62-73, 2004, Springer, 3-540-23018-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan |
Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings, pp. 488-498, 2004, Springer, 3-540-21258-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Jung-Won Lee, Seung-Soo Park |
Finding Maximal Similar Paths Between XML Documents Using Sequential Patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADVIS ![In: Advances in Information Systems, Third International Conference, ADVIS 2004, Izmir, Turkey, October 20-22, 2004, Proceedings, pp. 96-106, 2004, Springer, 3-540-23478-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi |
The Worst-Case Time Complexity for Generating All Maximal Cliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings, pp. 161-170, 2004, Springer, 3-540-22856-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | András Gács, Tamás Szonyi |
On Maximal Partial Spreads in PG(n, q). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 29(1-3), pp. 123-129, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Sandy Ferret, Leo Storme |
Results on Maximal Partial Spreads in PG(3, p3) and on Related Minihypers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 29(1-3), pp. 105-122, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
partial spreads, minihypers, projective geometry |
19 | Raymond Chi-Wing Wong, Ada Wai-Chee Fu, Ke Wang 0001 |
MPIS: Maximal-Profit Item Selection with Cross-Selling Considerations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM 2003), 19-22 December 2003, Melbourne, Florida, USA, pp. 371-378, 2003, IEEE Computer Society, 0-7695-1978-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Yoshiaki Okubo, Makoto Haraguchi |
Creating Abstract Concepts for Classification by Finding Top- N Maximal Weighted Cliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discovery Science ![In: Discovery Science, 6th International Conference, DS 2003, Sapporo, Japan, October 17-19,2003, Proceedings, pp. 418-425, 2003, Springer, 3-540-20293-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Anca I. D. Bucur, Dick H. J. Epema |
The Maximal Utilization of Processor Co-Allocation in Multicluster Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 22-26 April 2003, Nice, France, CD-ROM/Abstracts Proceedings, pp. 60, 2003, IEEE Computer Society, 0-7695-1926-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Hui Wang, Zhiting Xiao, Hongjun Zhang, Shengyi Jiang |
Parallel Algorithm for Mining Maximal Frequent Patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPT ![In: Advanced Parallel Programming Technologies, 5th International Workshop, APPT 2003, Xiamen, China, September 17-19, 2003, Proceedings, pp. 241-248, 2003, Springer, 3-540-20054-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Xinfang Yan, Yugeng Sun, Yanlin Wang |
A Heuristic Algorithm for Minimum Connected Dominating Set with Maximal Weight in Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GCC (2) ![In: Grid and Cooperative Computing, Second International Workshop, GCC 2003, Shanghai, China, December 7-10, 2003, Revised Papers, Part II, pp. 719-722, 2003, Springer, 3-540-21993-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Marcello Pelillo |
Matching Free Trees, Maximal Cliques, and Monotone Game Dynamics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 24(11), pp. 1535-1541, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
combinatorial optimization, dynamical systems, Graph matching, quadratic programming, shape recognition, evolutionary game theory |
19 | Wojciech Rytter |
On Maximal Suffices and Constant-Space Linear-Time Versions of KMP Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2002: Theoretical Informatics, 5th Latin American Symposium, Cancun, Mexico, April 3-6, 2002, Proceedings, pp. 196-208, 2002, Springer, 3-540-43400-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
19 | Irene A. Sharaya |
On Maximal Inner Estimation of the Solution Sets of Linear Systems with Interval Parameters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Reliab. Comput. ![In: Reliab. Comput. 7(5), pp. 409-424, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Gabriella Sanniti di Baja, Stina Svensson |
Detecting Centres of Maximal Geodesic Discs on the Distance Transform of Surfaces in 3D Images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DGCI ![In: Discrete Geometry for Computer Imagery, 9th International Conference, DGCI 2000, Uppsala, Sweden, December 13-15, 2000, Proceedings, pp. 443-452, 2000, Springer, 3-540-41396-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
19 | Gregory J. Reid, Allan D. Wittkopf |
Determination of maximal symmetry groups of classes of differential equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, ISSAC 2000, St. Andrews, United Kingdom, August 6-10, 2000, pp. 272-280, 2000, ACM, 1-58113-218-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
19 | Michael Jünger, Sebastian Leipert, Petra Mutzel |
A note on computing a maximal planar subgraph using PQ-trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 17(7), pp. 609-612, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
19 | Detlef Hühnlein, Michael J. Jacobson Jr., Sachar Paulus, Tsuyoshi Takagi |
A Cryptosystem Based on Non-maximal Imaginary Quadratic Orders with Fast Decryption. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31 - June 4, 1998, Proceeding, pp. 294-307, 1998, Springer, 3-540-64518-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
imaginary quadratic order, trapdoor decryption, factorization, Public key cryptosystem, key escrow |
19 | Jang-Ping Sheu, Yuh-Shyan Chen |
Tolerating Faults in Faulty Hypercubes Using Maximal Fault-Free Subcube-Ring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par '95 Parallel Processing, First International Euro-Par Conference, Stockholm, Sweden, August 29-31, 1995, Proceedings, pp. 661-672, 1995, Springer, 3-540-60247-X. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
19 | Zhi-Zhong Chen |
The Maximal f-Dependent Set Problem for Planar Graphs is in NC. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 20th International Workshop, WG '94, Herrsching, Germany, June 16-18, 1994, Proceedings, pp. 232-241, 1994, Springer, 3-540-59071-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
19 | Martin Loebl |
Efficient Maximal Cubic Graph Cuts (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 18th International Colloquium, ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings, pp. 351-362, 1991, Springer, 3-540-54233-7. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
19 | Takayoshi Shoudai |
Using Maximal Independent Sets to Solve Problems in Parallel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: 17th International Workshop, WG '91, Fischbachau, Germany, June 17-19, 1991, Proceedings, pp. 126-134, 1991, Springer, 3-540-55121-2. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
19 | Chong Jye Rhee, Sudarshan K. Dhall, S. Lakshmivarahan |
An Optimal Parallel Algorithm for the Maximal Element Problem (Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Conference on Computer Science ![In: Proceedings of the ACM 18th Annual Computer Science Conference on Cooperation, CSC '90, Sheraton Washington Hotel, Washington, DC, USA, February 20-22, 1990, pp. 435, 1990, ACM, 0-89791-348-5. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
19 | Valtteri Niemi |
Maximal Dense Intervals of Grammar Forms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 15th International Colloquium, ICALP88, Tampere, Finland, July 11-15, 1988, Proceedings, pp. 424-438, 1988, Springer, 3-540-19488-6. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
19 | Annie Astié-Vidal, J. Chifflet |
Distance-transitive graphs and the problem of maximal subgroups of symmetric groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algorithms and Error-Correcting Codes, 2nd International Conference, AAECC-2, Toulouse, France, October 1-5, 1984, Proceedings, pp. 206-214, 1984, Springer, 3-540-16767-6. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
19 | Sébastien Dechamps, Frédéric Meunier |
Maximal workload, minimal workload, maximal workload difference: optimizing all criteria at once. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.11036, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Yu Zhang, Qinhan Wei, Yongcai Wang, Haodi Ping, Deying Li 0001 |
GPART: Partitioning Maximal Redundant Rigid and Maximal Global Rigid Components in Generic Distance Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Sens. Networks ![In: ACM Trans. Sens. Networks 19(4), pp. 86:1-86:26, November 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Alkida Balliu, Sebastian Brandt 0002, Fabian Kuhn, Dennis Olivetti |
Distributed Maximal Matching and Maximal Independent Set on Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 2632-2676, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Li Qiaochen, Xuguang Bao |
A Spatial Maximal Co-location Pattern Mining Algorithm Based on Maximal Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CyberC ![In: International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2023, Jiangsu, China, November 2-4, 2023, pp. 18-26, 2023, IEEE, 979-8-3503-0869-3. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Samer Al Ghour, Zanyar A. Ameen |
Maximal Soft Compact and Maximal Soft Connected Topologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Comput. Intell. Soft Comput. ![In: Appl. Comput. Intell. Soft Comput. 2022, pp. 9860015:1-9860015:7, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Christian Bingane |
Tight bounds on the maximal perimeter and the maximal width of convex small polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Glob. Optim. ![In: J. Glob. Optim. 84(4), pp. 1033-1051, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Alkida Balliu, Sebastian Brandt 0002, Fabian Kuhn, Dennis Olivetti |
Distributed Maximal Matching and Maximal Independent Set on Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.01945, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Evangelos Bartzos |
Bounds on the maximal number of graph embeddings. (Bornes sur le nombre maximal de plongements de graphes). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2022 |
RDF |
|
19 | Vanha Tran, Lizhen Wang 0001, Hongmei Chen 0003, Qing Xiao |
MCHT: A maximal clique and hash table-based maximal prevalent co-location pattern mining algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 175, pp. 114830, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
19 | Alkida Balliu, Sebastian Brandt 0002, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, Jukka Suomela |
Lower Bounds for Maximal Matchings and Maximal Independent Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 68(5), pp. 39:1-39:30, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
19 | Michael Drmota, Lander Ramos, Clément Requilé, Juanjo Rué |
Maximal Independent Sets and Maximal Matchings in Series-Parallel and Related Graph Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 27(1), pp. 1, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
19 | Sepehr Assadi, Shay Solomon |
When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear-Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2006.07628, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
19 | Kangfeng Zheng, Xiujuan Wang, Bin Wu 0012, Tong Wu |
Feature subset selection combining maximal information entropy and maximal information coefficient. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Intell. ![In: Appl. Intell. 50(2), pp. 487-501, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
19 | Sepehr Assadi, Gillat Kol, Rotem Oshman |
Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: PODC '20: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020, pp. 79-88, 2020, ACM, 978-1-4503-7582-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
19 | Alkida Balliu, Sebastian Brandt 0002, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, Jukka Suomela |
Lower bounds for maximal matchings and maximal independent sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1901.02441, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
19 | Cui Chen, Ze-Hua Zhou, Ya Wang |
A note about maximal almost-invariant subspaces and maximal hyperinvariant subspaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Period. Math. Hung. ![In: Period. Math. Hung. 79(2), pp. 221-226, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
19 | Alkida Balliu, Sebastian Brandt 0002, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, Jukka Suomela |
Lower Bounds for Maximal Matchings and Maximal Independent Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019, pp. 481-497, 2019, IEEE Computer Society, 978-1-7281-4952-3. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
19 | Sepehr Assadi, Shay Solomon |
When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece., pp. 17:1-17:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-109-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
19 | Worachead Sommanee |
The Regular Part of a Semigroup of Full Transformations with Restricted Range: Maximal Inverse Subsemigroups and Maximal Regular Subsemigroups of Its Ideals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Math. Math. Sci. ![In: Int. J. Math. Math. Sci. 2018, pp. 2154745:1-2154745:9, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
19 | Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea |
Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes - Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 62(1), pp. 162-191, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
19 | Michael Drmota, Lander Ramos, Clément Requilé, Juanjo Rué |
Maximal Independent Sets and Maximal Matchings in Series-Parallel and Related Graph Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AofA ![In: 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA 2018, June 25-29, 2018, Uppsala, Sweden, pp. 18:1-18:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-078-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
19 | Yevhen Zelenyuk |
Left Maximal and strongly Right Maximal idempotents in G. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 82(1), pp. 26-34, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
19 | Beniamino Accattoli |
The Maximal MAM, a Reasonable Implementation of the Maximal Strategy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1711.10301, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
19 | Natarajan Meghanathan |
On the Conduciveness of Random Network Graphs for Maximal Assortative or Maximal Dissortative Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Inf. Sci. ![In: Comput. Inf. Sci. 9(1), pp. 21-30, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
19 | Natarajan Meghanathan |
Maximal Assortative Matching and Maximal Dissortative Matching for Complex Network Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. J. ![In: Comput. J. 59(5), pp. 667-684, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
19 | Tingting Zhu, Baoyindureng Wu |
Domination of maximal K4-minor free graphs and maximal K2, 3-minor free graphs, and disproofs of two conjectures on planar graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 194, pp. 147-153, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
19 | Bastien Cazaux, Eric Rivals |
Approximation of Greedy Algorithms for Max-ATSP, Maximal Compression, Maximal Cycle Cover, and Shortest Cyclic Cover of Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stringology ![In: Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, September 1-3, 2014, pp. 148-161, 2014, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, 978-80-01-05547-2. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
19 | Janusz A. Brzozowski, Gareth Davies 0001 |
Maximal Syntactic Complexity of Regular Languages Implies Maximal Quotient Complexities of Atoms ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1302.3906, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
19 | Leonid Barenboim, Michael Elkin, Seth Pettie, Johannes Schneider 0002 |
Fast Distributed Algorithms for Maximal Matching and Maximal Independent Set ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1202.1983, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
19 | Kanes Sutuntivorakoon, Vaneet Aggarwal, Amir Salman Avestimehr, Ashutosh Sabharwal |
Maximal k-Clique Scheduling: A simple algorithm to bound maximal independent graph scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Allerton ![In: 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011, Allerton Park & Retreat Center, Monticello, IL, USA, 28-30 September, 2011, pp. 816-823, 2011, IEEE, 978-1-4577-1817-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
19 | Bill Sands, Jia Shen |
When Will Every Maximal F-free Subposet Contain a Maximal Element? ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 27(1), pp. 23-40, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
19 | David M. Howard 0002, William T. Trotter |
On the size of maximal antichains and the number of pairwise disjoint maximal chains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 310(21), pp. 2890-2894, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
19 | Dwight Duffus, Bill Sands |
On the size of maximal chains and the number of pairwise disjoint maximal antichains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 310(21), pp. 2883-2889, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
19 | Li Lu 0006, Yunhong Gu, Robert L. Grossman |
dMaximalCliques: A Distributed Algorithm for Enumerating All Maximal Cliques and Maximal Clique Distribution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM Workshops ![In: ICDMW 2010, The 10th IEEE International Conference on Data Mining Workshops, Sydney, Australia, 13 December 2010, pp. 1320-1327, 2010, IEEE Computer Society, 978-0-7695-4257-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
19 | Guiping Zhang, Wenjing Lang, Qiaoli Zhou, Dongfeng Cai |
Identification of Maximal-Length Noun Phrases Based on Maximal-Length Preposition Phrases in Chinese. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IALP ![In: International Conference on Asian Language Processing, IALP 2010, Harbin, Heilongjiang, China, 28-30 December 2010, pp. 65-68, 2010, IEEE Computer Society, 978-0-7695-4288-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
19 | Francesco Bernardini, Marian Gheorghe 0001, Maurice Margenstern, Sergey Verlan |
Maximal, Locally-Maximal, and Minimal Parallelism in Networks of Cells. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Unconv. Comput. ![In: Int. J. Unconv. Comput. 5(5), pp. 391-409, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
19 | Shariq Bashir, Abdul Rauf Baig |
FastLMFI: An Efficient Approach for Local Maximal Patterns Propagation and Maximal Patterns Superset Checking ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0904.3310, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
19 | J. Donald Monk |
Maximal irredundance and maximal ideal independence in Boolean algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 73(1), pp. 261-275, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Yijie Han |
Parallel Algorithms for Maximal Independent Set and Maximal Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Parallel Computing ![In: Handbook of Parallel Computing - Models, Algorithms and Applications., 2007, Chapman and Hall/CRC, 978-1-58488-623-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Lance Drager, Jeffrey M. Lee, Clyde F. Martin |
The maximal number of pairwise communicating stations under limitations of maximal and minimal communication distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDC ![In: 46th IEEE Conference on Decision and Control, CDC 2007, New Orleans, LA, USA, December 12-14, 2007, pp. 5334-5340, 2007, IEEE, 978-1-4244-1497-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Shariq Bashir, Abdul Rauf Baig |
FastLMFI: An Efficient Approach for Local Maximal Patterns Propagation and Maximal Patterns Superset Checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AICCSA ![In: 2006 IEEE/ACS International Conference on Computer Systems and Applications (AICCSA 2006), March 8-11, Dubai/Sharjah, UAE, pp. 452-459, 2006, IEEE Computer Society, 1-4244-0211-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Xiaotie Deng, Guojun Li, Wenan Zang |
Corrigendum to Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs: [J. Combin. Theory Ser. B 91 (2004) 301-325]. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 94(2), pp. 352-353, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Xiaotie Deng, Guojun Li, Wenan Zang |
Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 91(2), pp. 301-325, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Dieter Jungnickel, Leo Storme |
Maximal partial spreads in PG(3, 4) and maximal sets of mutually orthogonal latin squares of order 16. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 261(1-3), pp. 361-371, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Harald Niederreiter, Igor E. Shparlinski |
Periodic Sequences with Maximal Linear Complexity and Almost Maximal k-Error Linear Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMACC ![In: Cryptography and Coding, 9th IMA International Conference, Cirencester, UK, December 16-18, 2003, Proceedings, pp. 183-189, 2003, Springer, 3-540-20663-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Dongyang Long, Weijia Jia 0001 |
Optimal maximal and maximal prefix codes equivalent to Huffman codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICASSP ![In: Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2002, May 13-17 2002, Orlando, Florida, USA, pp. 2525-2528, 2002, IEEE, 0-7803-7402-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
19 | Yannick Guesnet |
Maximal circular codes versus maximal codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RAIRO Theor. Informatics Appl. ![In: RAIRO Theor. Informatics Appl. 35(4), pp. 351-365, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|