Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
100 | Brenda J. Latka |
Antichains of Bounded Size in the Class of Tournaments. |
Order |
2003 |
DBLP DOI BibTeX RDF |
subtournament, embedding, tournament, antichain |
72 | Ákos Kisvölcsey |
Flattening Antichains. |
Comb. |
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. |
CIAA |
2008 |
DBLP DOI BibTeX RDF |
|
54 | Péter L. Erdös, Lajos Soukup |
How To Split Antichains In Infinite Posets. |
Comb. |
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. |
ISAAC |
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. |
CAV |
2006 |
DBLP DOI BibTeX RDF |
|
36 | James Cummings 0001, Ernest Schimmerling |
Diamond and antichains. |
Arch. Math. Log. |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Martin Goldstern, Saharon Shelah |
Antichains in Products of Linear Orders. |
Order |
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. |
Order |
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. |
J. Comb. Optim. |
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. |
Order |
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. |
Order |
2002 |
DBLP DOI BibTeX RDF |
locally finite poset, chain, antichain |
26 | JinHoo Ahn, Joonhee Kim, Junguk Lee |
On the antichain tree property. |
J. Math. Log. |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Dibyayan Chakraborty, Florent Foucaud |
Isometric path antichain covers: beyond hyperbolic graphs. |
CoRR |
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. |
AIST |
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. |
Order |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Éva Czabarka, Stephen J. Smith, László A. Székely |
An Infinite Antichain of Planar Tanglegrams. |
Order |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Paul Balister, Emil Powierski, Alex D. Scott, Jane Tan |
A Note on Infinite Antichain Density. |
SIAM J. Discret. Math. |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Benjamin Gunby, Xiaoyu He, Bhargav Narayanan, Sam Spiro |
Antichain Codes. |
CoRR |
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. |
Order |
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. |
Axioms |
2021 |
DBLP DOI BibTeX RDF |
|
26 | Maurice Laveaux, Jan Friso Groote, Tim A. C. Willemse |
Correct and Efficient Antichain Algorithms for Refinement Checking. |
Log. Methods Comput. Sci. |
2021 |
DBLP BibTeX RDF |
|
26 | Benjamin Braun, Brian Davis |
Antichain Simplices. |
J. Integer Seq. |
2020 |
DBLP BibTeX RDF |
|
26 | Maria Carmela Ceparano, Federico Quartieri |
On Pareto Dominance in Decomposably Antichain-Convex Sets. |
J. Optim. Theory Appl. |
2020 |
DBLP DOI BibTeX RDF |
|
26 | Michael Joseph |
Antichain Toggling and Rowmotion. |
Electron. J. Comb. |
2019 |
DBLP DOI BibTeX RDF |
|
26 | Maurice Laveaux, Jan Friso Groote, Tim A. C. Willemse |
Correct and Efficient Antichain Algorithms for Refinement Checking. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
26 | Maurice Laveaux, Jan Friso Groote, Tim A. C. Willemse |
Correct and Efficient Antichain Algorithms for Refinement Checking. |
FORTE |
2019 |
DBLP DOI BibTeX RDF |
|
26 | Vu Phan |
Syntactic Conditions for Antichain Property in Consistency Restoring Prolog. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
26 | Bernhard Möller |
Towards Antichain Algebra. |
RAMiCS |
2015 |
DBLP DOI BibTeX RDF |
|
26 | A. Mani |
Antichain Based Semantics for Rough Sets. |
RSKT |
2015 |
DBLP DOI BibTeX RDF |
|
26 | Olga Podolskaya |
On Circuit Complexity of Parity and Majority Functions in Antichain Basis. |
CoRR |
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). |
Order |
2013 |
DBLP DOI BibTeX RDF |
|
26 | Stephan Foldes, Russ Woodroofe |
Antichain Cutsets of Strongly Connected Posets. |
Order |
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. |
Real Time Syst. |
2013 |
DBLP DOI BibTeX RDF |
|
26 | Vijay K. Garg |
Maximal Antichain Lattice Algorithms for Distributed Computations. |
ICDCN |
2013 |
DBLP DOI BibTeX RDF |
|
26 | Alexander Kreuzer |
Primitive Recursion and the Chain Antichain Principle. |
Notre Dame J. Formal Log. |
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 |
CoRR |
2011 |
DBLP BibTeX RDF |
|
26 | Thomas Brihaye, Véronique Bruyère, Laurent Doyen 0001, Marc Ducobu, Jean-François Raskin |
Antichain-Based QBF Solving. |
ATVA |
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. |
Order |
2010 |
DBLP DOI BibTeX RDF |
|
26 | Bill Sands |
Posets with the Maximal Antichain Property. |
Order |
2010 |
DBLP DOI BibTeX RDF |
|
26 | Laurent Doyen 0001, Jean-François Raskin |
Antichain Algorithms for Finite Automata. |
TACAS |
2010 |
DBLP DOI BibTeX RDF |
|
26 | Emmanuel Filiot, Naiyong Jin, Jean-François Raskin |
An Antichain Algorithm for LTL Realizability. |
CAV |
2009 |
DBLP DOI BibTeX RDF |
|
26 | Alain Quilliot |
Preemptive scheduling and antichain polyhedra. |
Discret. Appl. Math. |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Erdong Chen, Linji Yang, Hao Yuan |
Longest increasing subsequences in windows based on canonical antichain partition. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Isaac Gorelic |
External cofinalities and the antichain condition in partial orders. |
Ann. Pure Appl. Log. |
2006 |
DBLP DOI BibTeX RDF |
|
26 | Guo-Qiang Zhang 0001, Ying Jiang |
On an open problem of Amadio and Curien: The finite antichain condition. |
Inf. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
26 | Vladimir M. Blinovsky, Lawrence H. Harper |
Size of the Largest Antichain in a Partition Poset. |
Probl. Inf. Transm. |
2002 |
DBLP DOI BibTeX RDF |
|
26 | Daniel A. Spielman, Miklós Bóna |
An Infinite Antichain of Permutations. |
Electron. J. Comb. |
2000 |
DBLP DOI BibTeX RDF |
|
26 | Gérard D. Cohen, Sylvia B. Encheva, Gilles Zémor |
Antichain Codes. |
Des. Codes Cryptogr. |
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. |
Discret. Appl. Math. |
1999 |
DBLP DOI BibTeX RDF |
|
26 | E. Rodney Canfield |
The Size of the Largest Antichain in the Partition Lattice. |
J. Comb. Theory, Ser. A |
1998 |
DBLP DOI BibTeX RDF |
|
26 | Frédéric Maire |
On the flat antichain conjecture. |
Australas. J Comb. |
1997 |
DBLP BibTeX RDF |
|
26 | Changyu Wang, Huishan Zhou |
A Family of Inequalities for Intersecting Antichain of Subsets of an n-set. |
Eur. J. Comb. |
1996 |
DBLP DOI BibTeX RDF |
|
26 | Michael R. Anderson |
Efficient constructions of antichain cutsets. |
Ars Comb. |
1996 |
DBLP BibTeX RDF |
|
26 | Morimasa Tsuchiya |
On antichain intersection numbers, total clique covers and regular graphs. |
Discret. Math. |
1994 |
DBLP DOI BibTeX RDF |
|
26 | Gerhard Behrendt |
The lattice of antichain cutsets of a partially ordered set. |
Discret. Math. |
1991 |
DBLP DOI BibTeX RDF |
|
26 | Zbigniew Lonc |
On Complexity of Some Chain and Antichain Partition Problems. |
WG |
1991 |
DBLP DOI BibTeX RDF |
|
26 | Peter Frankl |
A lower bound on the size of a complex generated by an antichain. |
Discret. Math. |
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. |
Comb. |
1985 |
DBLP DOI BibTeX RDF |
|
26 | András Frank |
On chain and antichain families of a partially ordered set. |
J. Comb. Theory, Ser. B |
1980 |
DBLP DOI BibTeX RDF |
|
26 | G. F. Clements |
The Minimal Number of Basic Elements in a Multiset Antichain. |
J. Comb. Theory, Ser. A |
1978 |
DBLP DOI BibTeX RDF |
|
18 | Maurice Pouzet, Imed Zaguia |
On Minimal Prime Graphs and Posets. |
Order |
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. |
TACAS |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Wouter Kuijper, Jaco van de Pol |
Compositional Control Synthesis for Partially Observable Systems. |
CONCUR |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Gemma C. Garriga, Antti Ukkonen, Heikki Mannila |
Feature Selection in Taxonomies with Applications to Paleontology. |
Discovery Science |
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. |
CONCUR |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh |
Completeness and Nondeterminism in Model Checking Transactional Memories. |
CONCUR |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Assaf Rinot |
Antichains in partially ordered sets of singular cofinality. |
Arch. Math. Log. |
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. |
ESCAPE |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Roland Axelsson, Martin Lange |
Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic. |
LPAR |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Bernd S. W. Schröder |
Examples of Powers of Ordered Sets with the Fixed Point Property. |
Order |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 06A07 |
18 | Sylvia B. Encheva, Sharil Tumin |
Safe Use of Protected Web Resources. |
Intelligent Information Processing |
2006 |
DBLP DOI BibTeX RDF |
E-services |
18 | Jan Foniok, Jaroslav Nesetril, Claude Tardif |
Generalised Dualities and Finite Maximal Antichains. |
WG |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Paolo Boldi, Sebastiano Vigna |
Efficient Lazy Algorithms for Minimal-Interval Semantics. |
SPIRE |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Milos S. Kurilic |
Mad families, forcing and the Suslin Hypothesis. |
Arch. Math. Log. |
2005 |
DBLP DOI BibTeX RDF |
Mad families, The Suslin Hypothesis, Forcing |
18 | Siaw-Lynn Ng |
A Characterisation of Posets that Are nearly Antichains. |
Order |
2004 |
DBLP DOI BibTeX RDF |
linear discrepancy, poset |
18 | Richard P. Anstee, Lajos Rónyai, Attila Sali |
Shattering News. |
Graphs Comb. |
2002 |
DBLP DOI BibTeX RDF |
|
18 | Khaled Al-Agha, Richard Greechie |
The Involutory Dimension of Involution Posets. |
Order |
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. |
Developments in Language Theory |
2001 |
DBLP DOI BibTeX RDF |
|
18 | Mohamed H. El-Zahar |
On Jump-Critical Posets with Jump-Number Equal to Width. |
Order |
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. |
Order |
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. |
Computing |
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. |
ASIACRYPT |
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. |
STACS |
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. |
TAPSOFT |
1995 |
DBLP DOI BibTeX RDF |
|
18 | Daniel Bleichenbacher, Ueli M. Maurer |
Directed Acyclic Graphs, One-way Functions and Digital Signatures. |
CRYPTO |
1994 |
DBLP DOI BibTeX RDF |
|