Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
109 | Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai |
On Time-Constructible Functions in One-Dimensional Cellular Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 12th International Symposium, FCT '99, Iasi, Romania, August 30 - September 3, 1999, Proceedings, pp. 316-326, 1999, Springer, 3-540-66412-2. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
61 | JunYong Yan, Yi Jin, KaiZhong Zuo |
Decrease-radix design principle for carrying/borrowing free multi-valued and application in ternary optical computer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sci. China Ser. F Inf. Sci. ![In: Sci. China Ser. F Inf. Sci. 51(10), pp. 1415-1426, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
carrying/borrowing free operating units, decrease-radix design, re-constructible, ternary optical computer |
57 | Michael Elkin, David Peleg |
(1+epsilon, beta)-spanner constructions for general graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece, pp. 173-182, 2001, ACM, 1-58113-349-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
52 | Takashi Katoh, Kouichi Hirata |
A Simple Characterization on Serially Constructible Episodes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD ![In: Advances in Knowledge Discovery and Data Mining, 12th Pacific-Asia Conference, PAKDD 2008, Osaka, Japan, May 20-23, 2008 Proceedings, pp. 600-607, 2008, Springer, 978-3-540-68124-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
52 | Jirí Síma, Stanislav Zák |
A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM (1) ![In: SOFSEM 2007: Theory and Practice of Computer Science, 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings, pp. 522-531, 2007, Springer, 978-3-540-69506-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
52 | Michal Koucký 0001 |
Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n4.03). ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001, Proceedings, pp. 11-20, 2001, Springer, 3-540-42494-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
47 | Peter Koepke |
Ordinal Computability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings, pp. 280-289, 2009, Springer, 978-3-642-03072-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Ordinal machines, Infinite Time Register Machines, Constructible sets |
38 | Mitsuru Hamada |
Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 54(12), pp. 5689-5704, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
38 | P. Schapira |
Tomography of Constructible Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 11th International Symposium, AAECC-11, Paris, France, July 17-22, 1995, Proceedings, pp. 427-435, 1995, Springer, 3-540-60114-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
28 | Huaming Zhang, Xin He |
Optimal st -orientations for plane triangulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 17(4), pp. 367-377, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
st-orientation, Plane triangulation |
28 | Omer Reingold |
Undirected connectivity in log-space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 55(4), pp. 17:1-17:24, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
bounded space algorithms, Derandomization, pseudorandom generator |
28 | Eldar Fischer, Johann A. Makowsky |
Linear Recurrence Relations for Graph Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Pillars of Computer Science ![In: Pillars of Computer Science, Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday, pp. 266-279, 2008, Springer, 978-3-540-78126-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Chi Tat Chong, Liang Yu |
Thin Maximal Antichains in the Turing Degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings, pp. 162-168, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Huaming Zhang, Xin He |
Optimal st -Orientations for Plane Triangulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management, Third International Conference, AAIM 2007, Portland, OR, USA, June 6-8, 2007, Proceedings, pp. 296-305, 2007, Springer, 978-3-540-72868-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Changbo Chen, Oleg Golubitsky, François Lemaire, Marc Moreno Maza, Wei Pan 0001 |
Comprehensive Triangular Decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASC ![In: Computer Algebra in Scientific Computing, 10th International Workshop, CASC 2007, Bonn, Germany, September 16-20, 2007, Proceedings, pp. 73-101, 2007, Springer, 978-3-540-75186-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Omer Reingold |
Undirected ST-connectivity in log-space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 376-385, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Frédéric Havet |
On Unavoidability of Trees with kLeaves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 19(1), pp. 101-110, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
28 | Viliam Geffert |
Space Hierarchy Theorem Revised. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings, pp. 387-397, 2001, Springer, 3-540-42496-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Computational complexity, Space complexity |
28 | Rahul Santhanam |
On Separators, Segregators and Time versus Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001, pp. 286-294, 2001, IEEE Computer Society, 0-7695-1053-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
28 | Masahiro Hachimori |
Nonconstructible Simplicial Balls and a Way of Testing Constructibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 22(2), pp. 223-230, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
28 | Kazuo Iwama, Chuzo Iwamoto |
Improved Time and Space Hierarchies of One-Tape Off-Line TMs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings, pp. 580-588, 1998, Springer, 3-540-64827-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
28 | Gilles Lachaud, Jacques Stern |
Polynomial-Time Construction of Spherical Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 9th International Symposium, AAECC-9, New Orleans, LA, USA, October 7-11, 1991, Proceedings, pp. 218-223, 1991, Springer, 3-540-54522-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
28 | Viliam Geffert |
Nondeterministic Computations in Sublogarithmic Space and Space Constructibility. (journal version: SIAM J. Comput. 20(3): 484-498(1991)) ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 17th International Colloquium, ICALP90, Warwick University, England, UK, July 16-20, 1990, Proceedings, pp. 111-124, 1990, Springer, 3-540-52826-1. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
24 | Vadim Lebovici |
Hybrid Transforms of Constructible Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Found. Comput. Math. ![In: Found. Comput. Math. 24(2), pp. 539-585, April 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
24 | Ezra Miller |
Stratifications of real vector spaces from constructible sheaves with conical microsupport. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Appl. Comput. Topol. ![In: J. Appl. Comput. Topol. 7(3), pp. 473-489, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Pierre Schapira |
Constructible sheaves and functions up to infinity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Appl. Comput. Topol. ![In: J. Appl. Comput. Topol. 7(4), pp. 707-739, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Man-Fai Wong, Xintong Qi, Chee Wei Tan 0001 |
EuclidNet: Deep Visual Reasoning for Constructible Problems in Geometry. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Artif. Intell. Mach. Learn. ![In: Adv. Artif. Intell. Mach. Learn. 3(1), pp. 839-853, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Ur Ya'ar |
Iterating the cofinality- Constructible Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 88(4), pp. 1682-1691, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Alessandro Neri 0002, Mima Stanojkovski |
A proof of the Etzion-Silberstein conjecture for monotone and MDS-constructible Ferrers diagrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.16407, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Man-Fai Wong, Xintong Qi, Chee-Wei Tan 0001 |
EuclidNet: Deep Visual Reasoning for Constructible Problems in Geometry. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2301.13007, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Vadim Lebovici |
Two complementary approaches in multi-parameter persistence: interval-decompositions and constructible functions. (Deux approches complémentaires de la persistance multiparamétrique: décompositions en intervalles et fonctions constructibles). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2023 |
RDF |
|
24 | Maria-Romina Ivan, Imre Leader, Mark Walters |
Constructible graphs and pursuit. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 930, pp. 196-208, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
24 | Luis M. Pardo, Daniel Sebastián |
A promenade through correct test sequences I: Degree of constructible sets, Bézout's Inequality and density. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Complex. ![In: J. Complex. 68, pp. 101588, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
24 | Vadim Lebovici |
Hybrid transforms of constructible functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2111.07829, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
24 | Zihan Tan, Liwei Zeng |
Erratum for "On the Inequalities of Projected Volumes and the Constructible Region". ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 34(1), pp. 1000, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
24 | Saskia Chambille, Pablo Cubides Kovacsics, Eva Leenknegt |
Exponential-constructible functions in P-minimal structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Math. Log. ![In: J. Math. Log. 20(2), pp. 2050005:1-2050005:29, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
24 | Thomas Macaulay Ferguson |
Explicit analyses of proof/refutation interaction for constructible falsity and Heyting-Brouwer logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 30(8), pp. 1505-1540, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
24 | Jorge Cely, Michel Raibaut |
On the Commutativity of pull-Back and Push-Forward Functors on Motivic Constructible Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 84(3), pp. 1252-1278, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
24 | Marcia J. Groszek, Joel David Hamkins |
The Implicitly Constructible Universe. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 84(4), pp. 1403-1421, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
24 | Zihan Tan, Liwei Zeng |
On the Inequalities of Projected Volumes and the Constructible Region. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 33(2), pp. 694-711, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
24 | Nicolas Berkouk, Grégory Ginot |
A derived isometry theorem for constructible sheaves on ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1805.09694, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
24 | Merlin Carl, Philipp Schlicht, Philip D. Welch |
Recognizable sets and Woodin cardinals: computation beyond the constructible universe. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 169(4), pp. 312-332, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
24 | Thomas Macaulay Ferguson |
A Gödel-Artemov-Style Analysis of Constructible Falsity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LFCS ![In: Logical Foundations of Computer Science - International Symposium, LFCS 2018, Deerfield Beach, FL, USA, January 8-11, 2018, Proceedings, pp. 154-169, 2018, Springer, 978-3-319-72055-5. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
24 | Robert E. Jamison, Henry Martyn Mulder |
Graphs constructible from cycles and complete graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 340(9), pp. 2301-2306, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
24 | Sean Walsh 0001 |
Fragments of Frege's Grundgesetze and Gödel's Constructible Universe. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 81(2), pp. 605-628, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
24 | Toshiyuki Miyamoto |
Choreography Realization by Re-Constructible Decomposition of Acyclic Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Inf. Syst. ![In: IEICE Trans. Inf. Syst. 99-D(6), pp. 1420-1427, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
24 | Josep M. Brunat, Antonio Montes |
Computing the Canonical Representation of Constructible Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Sci. ![In: Math. Comput. Sci. 10(1), pp. 165-178, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
24 | Mathieu Hoyrup |
The Typical Constructible Object. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Pursuit of the Universal - 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016, Proceedings, pp. 115-123, 2016, Springer, 978-3-319-40188-1. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
24 | Saugata Basu |
A Complexity Theory of Constructible Functions and Sheaves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Found. Comput. Math. ![In: Found. Comput. Math. 15(1), pp. 199-279, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
24 | Nathan R. Holbert, Uri Wilensky |
Constructible Authentic Representations: Designing Video Games that Enable Players to Utilize Knowledge Developed In-Game to Reason About Science. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Technol. Knowl. Learn. ![In: Technol. Knowl. Learn. 19(1-2), pp. 53-79, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
24 | Zihan Tan, Liwei Zeng, Jian Li |
On the Inequalities of Projected Volumes and the Constructible Region. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1410.8663, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
24 | Sayed Jalal Zahabi, Adel Aghajan, Mohammadali Khosravifard |
Sequentially-Constructible Reversible Variable Length Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 62(8), pp. 2605-2614, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
24 | Joel David Hamkins |
Every Countable Model of Set Theory embeds into its Own Constructible Universe. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Math. Log. ![In: J. Math. Log. 13(2), pp. 1350006, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
24 | Saugata Basu |
A complexity theory of constructible functions and sheaves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1309.5905, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
24 | Will Traves |
From Pascal's Theorem to d-Constructible Curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Am. Math. Mon. ![In: Am. Math. Mon. 120(10), pp. 901-915, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
24 | Norihiro Kamide |
Formalizing Inconsistency-Tolerant Relevant Human Reasoning: A Decidable Paraconsistent Relevant Logic with Constructible Falsity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SMC ![In: IEEE International Conference on Systems, Man, and Cybernetics, Manchester, SMC 2013, United Kingdom, October 13-16, 2013, pp. 1865-1870, 2013, IEEE, 978-0-7695-5154-8. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
24 | Colleen Bouey, Christina Graves, Aaron Ostrander, Gregory Palma |
Non-Recursively Constructible Recursive Families of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 19(2), pp. 9, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
24 | Daniel Neilson, Yee-Hong Yang |
A Component-Wise Analysis of Constructible Match Cost Functions for Global Stereopsis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 33(11), pp. 2147-2159, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
global algorithms, match cost functions, stereo matching, stereo correspondence, Stereopsis |
24 | Merlin Carl |
A Computational Approach to an Alternative Working Environment for the Constructible Universe. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Models of Computation in Context - 7th Conference on Computability in Europe, CiE 2011, Sofia, Bulgaria, June 27 - July 2, 2011. Proceedings, pp. 21-30, 2011, Springer, 978-3-642-21874-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
24 | Seiki Akama |
Negative facts and constructible falsity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Reason. based Intell. Syst. ![In: Int. J. Reason. based Intell. Syst. 1(1/2), pp. 85-91, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Mark A. Iwen |
Simple deterministically constructible RIP matrices with sublinear fourier sampling requirements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CISS ![In: 43rd Annual Conference on Information Sciences and Systems, CISS 2009, The John Hopkins University, Baltimore, MD, USA, 18-20 March 2009, pp. 870-875, 2009, IEEE, 978-1-4244-2733-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Changbo Chen, Liyun Li, Marc Moreno Maza, Wei Pan 0001, Yuzhen Xie |
On the representation of constructible sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Commun. Comput. Algebra ![In: ACM Commun. Comput. Algebra 42(3), pp. 162-163, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Christos A. Athanasiadis, Myrto Kallipoliti |
The absolute order on the symmetric group, constructible partially ordered sets and Cohen-Macaulay complexes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 115(7), pp. 1286-1295, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Mor Doron, Saharon Shelah |
Relational structures constructible by quantifier free definable operations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 72(4), pp. 1283-1298, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Claude Sureson |
Rumely Domains with Atomic Constructible Boolean Algebra. An Effective Viewpoint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Notre Dame J. Formal Log. ![In: Notre Dame J. Formal Log. 48(3), pp. 399-423, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Bart Kuijpers, Gabriel M. Kuper, Jan Paredaens, Luc Vandeurzen |
First-Order Languages Expressing Constructible Spatial Database Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 36(6), pp. 1570-1599, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Peter Ullrich |
Closed-form formulas for projecting constructible sets in the theory of algebraically closed fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Commun. Comput. Algebra ![In: ACM Commun. Comput. Algebra 40(2), pp. 45-48, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Moni Naor, Asaf Nussboim, Eran Tromer |
Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC ![In: Theory of Cryptography, Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12, 2005, Proceedings, pp. 66-85, 2005, Springer, 3-540-24573-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Marc Noy, Ares Ribó |
Recursively constructible families of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Appl. Math. ![In: Adv. Appl. Math. 32(1-2), pp. 350-363, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Matteo Viale |
The cumulative hierarchy and the constructible universe of ZFA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 50(1), pp. 99-103, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Norbert Polat |
On dually compact closed classes of graphs and BFS-constructible graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 23(2), pp. 365-381, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
24 | Michal Koucký 0001 |
Log-space constructible universal traversal sequences for cycles of length O(n4.03). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 296(1), pp. 117-144, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
24 | Norbert Polat |
On constructible graphs, locally Helly graphs, and convexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 43(4), pp. 280-298, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
24 | Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai |
Constructible functions in cellular automata and their applications to hierarchy results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 270(1-2), pp. 797-809, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Neil Biehn, Stephen L. Campbell, Ramine Nikoukhah, François Delebecque |
Numerically constructible observers for linear time-varying descriptor systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Autom. ![In: Autom. 37(3), pp. 445-452, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
24 | Richard Ehrenborg, Masahiro Hachimori |
Non-constructible Complexes and the Bridge Index. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 22(4), pp. 475-491, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
24 | Michal Koucký 0001 |
Log-space Constructible Universal Traversal Sequences for Cycles of Length O(n4.03) ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR01, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
24 | Peter Koepke, Marc van Eijmeren |
A refinement of Jensen's constructible hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FotFS ![In: Classical and New Paradigms of Computation and their Complexity Hierarchies, Papers of the conference `Foundations of the Formal Sciences III`, Wien, Asutria, September 21-24, 2001., pp. 159-169, 2001, Springer, 978-1-4020-2775-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
24 | Masahiro Hachimori |
Constructible complexes and recursive division of posets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 235(2), pp. 225-237, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
24 | Pascal Koiran |
The Complexity of Local Dimensions for Constructible Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Complex. ![In: J. Complex. 16(1), pp. 311-323, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
24 | Stefan Treatman, Cameron Wickham |
Constructible Approximations of Regular Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Am. Math. Mon. ![In: Am. Math. Mon. 107(10), pp. 911-922, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
24 | Marc Chastand, François Laviolette, Norbert Polat |
On constructible graphs, infinite bridged graphs and weakly cop-win graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 224(1-3), pp. 61-78, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
24 | Ricardo Caferra, Nicolas Peltier |
Combining Enumeration and Deductive Techniques in order to Increase the Class of Constructible Infinite Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Comput. ![In: J. Symb. Comput. 29(2), pp. 177-211, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
24 | Anna Patterson |
Implicit Programming and the Logic of Constructible Duality ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
1998 |
RDF |
|
24 | Zakaria Bouziane, Alain Finkel |
Cyclic Petri net reachability sets are semi-linear effectively constructible. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFINITY ![In: Second International Workshop on Verification of Infinite State Systems, Infinity 1997, Bologna, Italy, July 11-12, 1997, pp. 15-24, 1997, Elsevier. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
24 | Anatole Khelif |
Existentially Closed Models via Constructible Sets: There are 2aleph0 Existentially Closed Pairwise Non Elementarily Equivalent Existentially Closed Ordered Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 61(1), pp. 277-284, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
24 | François Bergeron, Ulrike Sattler |
Constructible Differentially Finite Algebraic Series in Several Variables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 144(1&2), pp. 59-65, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
24 | Philip D. Welch |
Characterising Subsets of omega1 Constructible from a Real. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 59(4), pp. 1420-1432, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
24 | Lech T. Polkowski, Maria Semeniuk-Polkowska |
On Rough Mereological Constructibility: Anaphorically Constructible Many-Object Events. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mathematical Aspects of Natural and Formal Languages ![In: Mathematical Aspects of Natural and Formal Languages, pp. 393-406, 1994, World Scientific, 978-981-02-1914-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
24 | Christian Schindler |
Constructible hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 91(2), pp. 183-191, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
24 | Danny Dolev, Nir Shavit |
Bounded Concurrent Time-Stamp Systems Are Constructible ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 14-17, 1989, Seattle, Washington, USA, pp. 454-466, 1989, ACM, 0-89791-307-8. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
24 | Sorin Istrail |
Polynomial Universal Traversing Sequences for Cycles Are Constructible (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, USA, pp. 491-503, 1988, ACM, 0-89791-264-0. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
24 | Andrzej Szepietowski |
There are no Fully Space Constructible Functions Between log log n and log n. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 24(6), pp. 361-362, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
24 | Marek Karpinski, Rutger Verbeek |
On the Monte Carlo Space Constructible Functions and Seperation Results for Probabilistic Complexity Classes ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 75(2), pp. 178-189, November 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
24 | Claude Sureson |
ω1-constructible universe and measurable cardinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 30(3), pp. 293-320, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
24 | Ahmad Almukdad, David Nelson |
Constructible Falsity and Inexact Predicates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 49(1), pp. 231-233, 1984. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
24 | Williams Kramer Forrest |
The Theory of Affine Constructible Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 29(3), pp. 97-135, 1983. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|
24 | C. P. Farrington |
Constructible Lattices of c-Degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 47(4), pp. 739-754, 1982. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
|
24 | Evangelos Kranakis |
Definable Ultrafilters and end Extension of Constructible Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 28(27-32), pp. 395-412, 1982. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
|
24 | Ami Litman |
אפיונים קומבינטוריים של תכונות נדירות בעולם הקונסטרוקטיבילי (Combinatorical characterization of definable properties in the Constructible world.). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
1981 |
RDF |
|