Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
100 | Brenda J. Latka |
Antichains of Bounded Size in the Class of Tournaments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 20(2), pp. 109-119, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
subtournament, embedding, tournament, antichain |
72 | Ákos Kisvölcsey |
Flattening Antichains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 26(1), pp. 65-82, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05D05 |
62 | Ahmed Bouajjani, Peter Habermehl, Lukás Holík, Tayssir Touili, Tomás Vojnar |
Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Applications of Automata, 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008. Proceedings, pp. 57-67, 2008, Springer, 978-3-540-70843-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
54 | Péter L. Erdös, Lajos Soukup |
How To Split Antichains In Infinite Posets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 27(2), pp. 147-161, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 06A07, 03E05 |
44 | Erdong Chen, Hao Yuan, Linji Yang |
Longest Increasing Subsequences in Windows Based on Canonical Antichain Partition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 1153-1162, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Martin De Wulf, Laurent Doyen 0001, Thomas A. Henzinger, Jean-François Raskin |
Antichains: A New Algorithm for Checking Universality of Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 18th International Conference, CAV 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings, pp. 17-30, 2006, Springer, 3-540-37406-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
36 | James Cummings 0001, Ernest Schimmerling |
Diamond and antichains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 44(1), pp. 71-76, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Martin Goldstern, Saharon Shelah |
Antichains in Products of Linear Orders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 19(3), pp. 213-222, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
size of antichains, product of chains, pcf theory, Delta system |
28 | Jimmy Leblet, Jean-Xavier Rampon |
Inductive Characterizations of Finite Interval Orders and Semiorders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 26(3), pp. 277-281, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Finite order, Decomposition, Characterization, Partially ordered sets, Interval order, Inductive definition, Antichain, Semiorder |
28 | Andrey O. Matveev |
Relative blocking in posets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 13(4), pp. 379-403, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Blocker, Blocker map, Lattice, Poset, Clutter, Committee, Antichain, Farey sequence |
28 | Maciej Malicki, Aleksander Rutkowski |
On Operations and Linear Extensions of Well Partially Ordered Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 21(1), pp. 7-17, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
well-founded order, partially well order, rank, tree, ordered set, linear extension, width, antichain |
28 | James H. Schmerl |
Obstacles to Extending Mirsky's Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 19(2), pp. 209-211, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
locally finite poset, chain, antichain |
26 | JinHoo Ahn, Joonhee Kim, Junguk Lee |
On the antichain tree property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Math. Log. ![In: J. Math. Log. 23(2), pp. 2250021:1-2250021:36, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Dibyayan Chakraborty, Florent Foucaud |
Isometric path antichain covers: beyond hyperbolic graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2301.00278, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Dmitry I. Ignatov |
Is Canfield Right? On the Asymptotic Coefficients for the Maximum Antichain of Partitions and Related Counting Inequalities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AIST ![In: Analysis of Images, Social Networks and Texts - 11th International Conference, AIST 2023, Yerevan, Armenia, September 28-30, 2023, Revised Selected Papers, pp. 349-361, 2023, Springer, 978-3-031-54533-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Frank a Campo |
A Generalization of a Theorem of Erné about the Number of Posets with a Fixed Antichain. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 39(3), pp. 421-434, October 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Éva Czabarka, Stephen J. Smith, László A. Székely |
An Infinite Antichain of Planar Tanglegrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 39(1), pp. 45-54, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Paul Balister, Emil Powierski, Alex D. Scott, Jane Tan |
A Note on Infinite Antichain Density. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 36(1), pp. 573-577, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Benjamin Gunby, Xiaoyu He, Bhargav Narayanan, Sam Spiro |
Antichain Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2212.08406, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Ivan A. Bochkov, Fedor V. Petrov |
The Bounds for the Number of Linear Extensions Via Chain and Antichain Coverings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 38(2), pp. 323-328, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
26 | Iryna Banakh, Taras O. Banakh, Serhii Bardyla |
A Semigroup Is Finite Iff It Is Chain-Finite and Antichain-Finite. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Axioms ![In: Axioms 10(1), pp. 9, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
26 | Maurice Laveaux, Jan Friso Groote, Tim A. C. Willemse |
Correct and Efficient Antichain Algorithms for Refinement Checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. Methods Comput. Sci. ![In: Log. Methods Comput. Sci. 17(1), 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
26 | Benjamin Braun, Brian Davis |
Antichain Simplices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Integer Seq. ![In: J. Integer Seq. 23(1), pp. 20.1.1, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
26 | Maria Carmela Ceparano, Federico Quartieri |
On Pareto Dominance in Decomposably Antichain-Convex Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Optim. Theory Appl. ![In: J. Optim. Theory Appl. 186(1), pp. 68-85, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
26 | Michael Joseph |
Antichain Toggling and Rowmotion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 26(1), pp. 1, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
26 | Maurice Laveaux, Jan Friso Groote, Tim A. C. Willemse |
Correct and Efficient Antichain Algorithms for Refinement Checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1902.09880, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
26 | Maurice Laveaux, Jan Friso Groote, Tim A. C. Willemse |
Correct and Efficient Antichain Algorithms for Refinement Checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FORTE ![In: Formal Techniques for Distributed Objects, Components, and Systems - 39th IFIP WG 6.1 International Conference, FORTE 2019, Held as Part of the 14th International Federated Conference on Distributed Computing Techniques, DisCoTec 2019, Kongens Lyngby, Denmark, June 17-21, 2019, Proceedings, pp. 185-203, 2019, Springer, 978-3-030-21758-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
26 | Vu Phan |
Syntactic Conditions for Antichain Property in Consistency Restoring Prolog. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1809.09319, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
26 | Bernhard Möller |
Towards Antichain Algebra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RAMiCS ![In: Relational and Algebraic Methods in Computer Science - 15th International Conference, RAMiCS 2015, Braga, Portugal, September 28 - October 1, 2015, Proceedings, pp. 344-361, 2015, Springer, 978-3-319-24703-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
26 | A. Mani |
Antichain Based Semantics for Rough Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSKT ![In: Rough Sets and Knowledge Technology - 10th International Conference, RSKT 2015, held as part of the International Joint Conference on Rough Sets, IJCRS 2015, Tianjin, China, November 20-23, 2015, Proceedings, pp. 335-346, 2015, Springer, 978-3-319-25753-2. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
26 | Olga Podolskaya |
On Circuit Complexity of Parity and Majority Functions in Antichain Basis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1410.2456, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
26 | Alessandro Conflitti, Carlos M. da Fonseca, Ricardo Mamede |
On the Largest Size of an Antichain in the Bruhat Order for A(2k, k). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 30(1), pp. 255-260, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
26 | Stephan Foldes, Russ Woodroofe |
Antichain Cutsets of Strongly Connected Posets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 30(2), pp. 351-361, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
26 | Gilles Geeraerts, Joël Goossens, Markus Lindström |
Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Real Time Syst. ![In: Real Time Syst. 49(2), pp. 171-218, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
26 | Vijay K. Garg |
Maximal Antichain Lattice Algorithms for Distributed Computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCN ![In: Distributed Computing and Networking, 14th International Conference, ICDCN 2013, Mumbai, India, January 3-6, 2013. Proceedings, pp. 240-254, 2013, Springer, 978-3-642-35667-4. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
26 | Alexander Kreuzer |
Primitive Recursion and the Chain Antichain Principle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Notre Dame J. Formal Log. ![In: Notre Dame J. Formal Log. 53(2), pp. 245-265, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
26 | Wouter Kuijper, Michael Weber 0002 |
Generic Programming of Reusable, High Performance Container Types using Automatic Type Hierarchy Inference and Bidirectional Antichain Typing ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1102.3420, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
26 | Thomas Brihaye, Véronique Bruyère, Laurent Doyen 0001, Marc Ducobu, Jean-François Raskin |
Antichain-Based QBF Solving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ATVA ![In: Automated Technology for Verification and Analysis, 9th International Symposium, ATVA 2011, Taipei, Taiwan, October 11-14, 2011. Proceedings, pp. 183-197, 2011, Springer, 978-3-642-24371-4. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
26 | Péter L. Erdös, Lajos Soukup |
No Finite-Infinite Antichain Duality in the Homomorphism Poset of Directed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 27(3), pp. 317-325, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
26 | Bill Sands |
Posets with the Maximal Antichain Property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 27(1), pp. 1-8, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
26 | Laurent Doyen 0001, Jean-François Raskin |
Antichain Algorithms for Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for the Construction and Analysis of Systems, 16th International Conference, TACAS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings, pp. 2-22, 2010, Springer, 978-3-642-12001-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
26 | Emmanuel Filiot, Naiyong Jin, Jean-François Raskin |
An Antichain Algorithm for LTL Realizability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 21st International Conference, CAV 2009, Grenoble, France, June 26 - July 2, 2009. Proceedings, pp. 263-277, 2009, Springer, 978-3-642-02657-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
26 | Alain Quilliot |
Preemptive scheduling and antichain polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 156(17), pp. 3267-3275, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Erdong Chen, Linji Yang, Hao Yuan |
Longest increasing subsequences in windows based on canonical antichain partition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 378(3), pp. 223-236, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Isaac Gorelic |
External cofinalities and the antichain condition in partial orders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 140(1-3), pp. 104-109, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
26 | Guo-Qiang Zhang 0001, Ying Jiang |
On an open problem of Amadio and Curien: The finite antichain condition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 202(1), pp. 87-103, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
26 | Vladimir M. Blinovsky, Lawrence H. Harper |
Size of the Largest Antichain in a Partition Poset. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Probl. Inf. Transm. ![In: Probl. Inf. Transm. 38(4), pp. 347-353, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
26 | Daniel A. Spielman, Miklós Bóna |
An Infinite Antichain of Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 7, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
26 | Gérard D. Cohen, Sylvia B. Encheva, Gilles Zémor |
Antichain Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 18(1/3), pp. 71-80, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
26 | E. Rodney Canfield, Konrad Engel |
An Upper Bound for the Size of the Largest Antichain in the Poset of Partitions of an Integer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 95(1-3), pp. 169-180, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
26 | E. Rodney Canfield |
The Size of the Largest Antichain in the Partition Lattice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 83(2), pp. 188-201, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
26 | Frédéric Maire |
On the flat antichain conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australas. J Comb. ![In: Australas. J Comb. 15, pp. 241-246, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP BibTeX RDF |
|
26 | Changyu Wang, Huishan Zhou |
A Family of Inequalities for Intersecting Antichain of Subsets of an n-set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 17(1), pp. 89-96, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
26 | Michael R. Anderson |
Efficient constructions of antichain cutsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 44, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP BibTeX RDF |
|
26 | Morimasa Tsuchiya |
On antichain intersection numbers, total clique covers and regular graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 127(1-3), pp. 305-318, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
26 | Gerhard Behrendt |
The lattice of antichain cutsets of a partially ordered set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 89(2), pp. 201-202, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
26 | Zbigniew Lonc |
On Complexity of Some Chain and Antichain Partition Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: 17th International Workshop, WG '91, Fischbachau, Germany, June 17-19, 1991, Proceedings, pp. 97-104, 1991, Springer, 3-540-55121-2. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
26 | Peter Frankl |
A lower bound on the size of a complex generated by an antichain. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 76(1), pp. 51-56, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
26 | Konrad Engel, Nikolai N. Kuzjurin |
About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 5(4), pp. 301-309, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
26 | András Frank |
On chain and antichain families of a partially ordered set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 29(2), pp. 176-184, 1980. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
26 | G. F. Clements |
The Minimal Number of Basic Elements in a Multiset Antichain. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 25(2), pp. 153-162, 1978. The full citation details ...](Pics/full.jpeg) |
1978 |
DBLP DOI BibTeX RDF |
|
18 | Maurice Pouzet, Imed Zaguia |
On Minimal Prime Graphs and Posets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 26(4), pp. 357-375, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
AMS Subject Classifications (2000) 06A06, 06A07 |
18 | Wouter Kuijper, Jaco van de Pol |
Computing Weakest Strategies for Safety Games of Imperfect Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for the Construction and Analysis of Systems, 15th International Conference, TACAS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings, pp. 92-106, 2009, Springer, 978-3-642-00767-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Wouter Kuijper, Jaco van de Pol |
Compositional Control Synthesis for Partially Observable Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2009 - Concurrency Theory, 20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009. Proceedings, pp. 431-447, 2009, Springer, 978-3-642-04080-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Gemma C. Garriga, Antti Ukkonen, Heikki Mannila |
Feature Selection in Taxonomies with Applications to Paleontology. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discovery Science ![In: Discovery Science, 11th International Conference, DS 2008, Budapest, Hungary, October 13-16, 2008. Proceedings, pp. 112-123, 2008, Springer, 978-3-540-88410-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Dietmar Berwanger, Krishnendu Chatterjee, Laurent Doyen 0001, Thomas A. Henzinger, Sangram Raje |
Strategy Construction for Parity Games with Imperfect Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2008 - Concurrency Theory, 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008. Proceedings, pp. 325-339, 2008, Springer, 978-3-540-85360-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh |
Completeness and Nondeterminism in Model Checking Transactional Memories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2008 - Concurrency Theory, 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008. Proceedings, pp. 21-35, 2008, Springer, 978-3-540-85360-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Assaf Rinot |
Antichains in partially ordered sets of singular cofinality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 46(5-6), pp. 457-464, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 03E04, 06A07, 03E35 |
18 | Matthias Baumgart 0001, Stefan Eckhardt, Jan Griebsch, Sven Kosub, Johannes Nowak |
All-Pairs Ancestor Problems in Weighted Dags. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESCAPE ![In: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers, pp. 282-293, 2007, Springer, 978-3-540-74449-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Roland Axelsson, Martin Lange |
Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 14th International Conference, LPAR 2007, Yerevan, Armenia, October 15-19, 2007, Proceedings, pp. 62-76, 2007, Springer, 978-3-540-75558-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Bernd S. W. Schröder |
Examples of Powers of Ordered Sets with the Fixed Point Property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 23(2-3), pp. 211-219, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 06A07 |
18 | Sylvia B. Encheva, Sharil Tumin |
Safe Use of Protected Web Resources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Intelligent Information Processing ![In: Intelligent Information Processing III, IFIP TC12 International Conference on Intelligent Information Processing (IIP 2006), September 20-23, Adelaide, Australia, pp. 161-170, 2006, Springer, 978-0-387-44639-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
E-services |
18 | 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 |
|
18 | Paolo Boldi, Sebastiano Vigna |
Efficient Lazy Algorithms for Minimal-Interval Semantics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: String Processing and Information Retrieval, 13th International Conference, SPIRE 2006, Glasgow, UK, October 11-13, 2006, Proceedings, pp. 134-149, 2006, Springer, 3-540-45774-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Milos S. Kurilic |
Mad families, forcing and the Suslin Hypothesis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 44(4), pp. 499-512, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Mad families, The Suslin Hypothesis, Forcing |
18 | Siaw-Lynn Ng |
A Characterisation of Posets that Are nearly Antichains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 21(1), pp. 1-5, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
linear discrepancy, poset |
18 | Richard P. Anstee, Lajos Rónyai, Attila Sali |
Shattering News. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 18(1), pp. 59-73, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
18 | Khaled Al-Agha, Richard Greechie |
The Involutory Dimension of Involution Posets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 18(4), pp. 323-337, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
bounded posets, involution posets, involutory chains, involutory dimension, prime order ideals |
18 | Dietrich Kuske |
Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 5th International Conference, DLT 2001, Vienna, Austria, July 16-21, 2001, Revised Papers, pp. 206-216, 2001, Springer, 3-540-43453-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
18 | Mohamed H. El-Zahar |
On Jump-Critical Posets with Jump-Number Equal to Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 17(1), pp. 93-101, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
jump-number, jump-critical posets, order-critical posets |
18 | Josef Niederle |
Being a Proper Trapezoid Ordered Set Is a Comparability Invariant. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 17(3), pp. 301-308, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
autonomous subset, comparability invariant, interval ordered set, proper interval dimension, trapezoid ordered set |
18 | Peter Kleinschmidt, Christian Rank |
New Heuristics for the Multidimensional Vote Assignment Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 63(4), pp. 405-417, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Vote assignment, set partitioning heuristic, fault tolerance |
18 | Daniel Bleichenbacher, Ueli M. Maurer |
On the Efficiency of One-Time Digital Signatures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT '96, International Conference on the Theory and Applications of Cryptology and Information Security, Kyongju, Korea, November 3-7, 1996, Proceedings, pp. 145-158, 1996, Springer, 3-540-61872-4. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Cryptography, Digital signature, Directed acyclic graph, One-way function, Partially ordered set |
18 | Daniel Bleichenbacher, Ueli M. Maurer |
Optimal Tree-Based One-Time Digital Signature Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings, pp. 363-374, 1996, Springer, 3-540-60922-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Cryptography, trees, partially ordered sets, digital signature schemes |
18 | Cyrille Bareau, Benoît Caillaud, Claude Jard, René Thoraval |
Measuring Concurrency of Regular Distributed Computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAPSOFT ![In: TAPSOFT'95: Theory and Practice of Software Development, 6th International Joint Conference CAAP/FASE, Aarhus, Denmark, May 22-26, 1995, Proceedings, pp. 711-725, 1995, Springer, 3-540-59293-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
18 | Daniel Bleichenbacher, Ueli M. Maurer |
Directed Acyclic Graphs, One-way Functions and Digital Signatures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO '94, 14th Annual International Cryptology Conference, Santa Barbara, California, USA, August 21-25, 1994, Proceedings, pp. 75-82, 1994, Springer, 3-540-58333-5. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|