Pascal and Francis Bibliographic Databases

Help

Search results

Your search

ct.\*:("Theoretical computing")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 64360

  • Page / 2575

Export

Selection :

  • and

A polynomial nominal unification algorithmCALVES, Christophe; FERNANDEZ, Maribel.Theoretical computer science. 2008, Vol 403, Num 2-3, pp 285-306, issn 0304-3975, 22 p.Article

Adaptive star grammars and their languagesDREWES, Frank; HOFFMANN, Berthold; JANSSENS, Dirk et al.Theoretical computer science. 2010, Vol 411, Num 34-36, pp 3090-3109, issn 0304-3975, 20 p.Article

Amalgamating sessions and methods in object-oriented languages with genericsCAPECCHI, Sara; COPPO, Mario; DEZANI-CIANCAGLINI, Mariangiola et al.Theoretical computer science. 2009, Vol 410, Num 2-3, pp 142-167, issn 0304-3975, 26 p.Article

Productivity of stream definitionsENDRULLIS, Jörg; GRABMAYER, Clemens; HENDRIKS, Dimitri et al.Theoretical computer science. 2010, Vol 411, Num 4-5, pp 765-782, issn 0304-3975, 18 p.Conference Paper

Vector Connectivity in GraphsBOROS, Endre; HEGGERNES, Pinar; VAN'T HOF, Pim et al.Networks (New York, NY). 2014, Vol 63, Num 4, pp 277-285, issn 0028-3045, 9 p.Article

Computing the Map of Geometric Minimal CutsJINHUI XU; LEI XU; PAPADOPOULOU, Evanthia et al.Algorithmica. 2014, Vol 68, Num 4, pp 805-834, issn 0178-4617, 30 p.Article

Improved Approximation Algorithms for the Average-Case Tree Searching ProblemCICALESE, Ferdinando; JACOBS, Tobias; LABER, Eduardo et al.Algorithmica. 2014, Vol 68, Num 4, pp 1045-1074, issn 0178-4617, 30 p.Article

On the Complexity of Time-Dependent Shortest PathsFOSCHINI, Luca; HERSHBERGER, John; SURI, Subhash et al.Algorithmica. 2014, Vol 68, Num 4, pp 1075-1097, issn 0178-4617, 23 p.Article

Parameterized Complexity of Eulerian Deletion ProblemsCYGAN, Marek; MARX, Dániel; PILIPCZUK, Marcin et al.Algorithmica. 2014, Vol 68, Num 1, pp 41-61, issn 0178-4617, 21 p.Article

Ranking-Based Black-Box ComplexityDOERR, Benjamin; WINZEN, Carola.Algorithmica. 2014, Vol 68, Num 3, pp 571-609, issn 0178-4617, 39 p.Article

Parameterized Complexity of Induced Graph Matching on Claw-Free GraphsHERMELIN, Danny; MNICH, Matthias; VAN LEEUWEN, Erik Jan et al.Algorithmica. 2014, Vol 70, Num 3, pp 513-560, issn 0178-4617, 48 p.Article

Online Coloring of Bipartite Graphs with and without AdviceBIANCHI, Maria Paola; BÖCKENHAUER, Hans-Joachim; HROMKOVIC, Juraj et al.Algorithmica. 2014, Vol 70, Num 1, pp 92-111, issn 0178-4617, 20 p.Conference Paper

Route-Enabling Graph Orientation ProblemsITO, Takehiro; MIYAMOTO, Yuichiro; ONO, Hirotaka et al.Algorithmica. 2013, Vol 65, Num 2, pp 317-338, issn 0178-4617, 22 p.Article

Step semantics of boolean netsKLEIJN, Jetty; KOUTNY, Maciej; PIETKIEWICZ-KOUTNY, Marta et al.Acta informatica. 2013, Vol 50, Num 1, pp 15-39, issn 0001-5903, 25 p.Article

Controllability and Observability of Boolean Control Networks With Time-Variant Delays in StatesLIJUN ZHANG; KUIZE ZHANG.IEEE transactions on neural networks and learning systems (Print). 2013, Vol 24, Num 9, pp 1478-1484, issn 2162-237X, 7 p.Article

On the Complexity of Inference and Completion of Boolean Networks from Given Singleton AttractorsJIANG, Hao; TAMURA, Takeyuki; CHING, Wai-Ki et al.IEICE transactions on fundamentals of electronics, communications and computer science. 2013, Vol 96, Num 11, pp 2265-2274, issn 0916-8508, 10 p.Article

Small Vertex Cover makes Petri Net Coverability and Boundedness EasierPRAVEEN, M.Algorithmica. 2013, Vol 65, Num 4, pp 713-753, issn 0178-4617, 41 p.Article

On the (Non-)Existence of Polynomial Kernels for Pl-Free Edge Modification ProblemsGUILLEMOT, Sylvain; HAVET, Frédéric; PAUL, Christophe et al.Algorithmica. 2013, Vol 65, Num 4, pp 900-926, issn 0178-4617, 27 p.Article

Formulating the template ILP consistency problem as a constraint satisfaction problemBARTAK, Roman; CERNOCH, Radomir; KUZELKA, Ondrej et al.Constraints (Dordrecht). 2013, Vol 18, Num 2, pp 144-165, issn 1383-7133, 22 p.Conference Paper

A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk GraphsPIRWANI, Imran A; SALAVATIPOUR, Mohammad R.Algorithmica. 2012, Vol 62, Num 3-4, pp 1050-1072, issn 0178-4617, 23 p.Article

An Improved Ant-Based Algorithm for the Degree-Constrained Minimum Spanning Tree ProblemBUI, Thang N; XIANGHUA DENG; ZRNCIC, Catherine M et al.IEEE transactions on evolutionary computation. 2012, Vol 16, Num 2, pp 266-278, issn 1089-778X, 13 p.Article

Approximating Node-Connectivity Augmentation ProblemsNUTOV, Zeev.Algorithmica. 2012, Vol 63, Num 1-2, pp 398-410, issn 0178-4617, 13 p.Article

Maximum Satisfiability: Anatomy of the Fitness Landscape for a Hard Combinatorial Optimization ProblemPRÜGEL-BENNETT, Adam; TAYARANI-NAJARAN, Mohammad-Hassan.IEEE transactions on evolutionary computation. 2012, Vol 16, Num 3, pp 319-338, issn 1089-778X, 20 p.Article

Nonterminal complexity of one-sided random context grammarsMEDUNA, Alexander; ZEMEK, Petr.Acta informatica. 2012, Vol 49, Num 2, pp 55-68, issn 0001-5903, 14 p.Article

The Parameterized Complexity of Stabbing RectanglesDOM, Michael; FELLOWS, Michael R; ROSAMOND, Frances A et al.Algorithmica. 2012, Vol 62, Num 1-2, pp 564-594, issn 0178-4617, 31 p.Article

  • Page / 2575