masteraka's no-tag [57 articles] Export

Recent papers added to masteraka's library classified by the tag no-tag. You can also see everyone's no-tag.

	Path Systems: Constructions, Solutions and Applications [My Copy] SIAM Journal on Computing, Vol. 9, No. 2. (1980), pp. 348-374. by Eitan M. Gurari, Oscar H. Ibarra posted to no-tag by masteraka on 2009-12-11 04:53:34 as
	On the Tape Complexity of Deterministic Context-Free Languages [My Copy] J. ACM, Vol. 25, No. 3. (1978), pp. 405-414. by I. H. Sudborough posted to no-tag by masteraka on 2009-11-09 15:57:59 as
	Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity [My Copy] (04 January 1994) posted to no-tag by masteraka on 2009-11-06 16:52:01 as
	Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem [My Copy] Journal of Algorithms, Vol. 5, No. 4. (December 1984), pp. 531-546. by E. Gurari, I. Sudborough posted to no-tag by masteraka on 2009-10-09 03:41:54 as
	The Core of a Countably Categorical Structure [My Copy] STACS 2005 (2005), pp. 110-120. by Manuel Bodirsky posted to no-tag by masteraka on 2009-10-08 22:07:05 as
	On Limited Nondeterminism and the Complexity of the V-C Dimension [My Copy] Journal of Computer and System Sciences, Vol. 53, No. 2. (October 1996), pp. 161-170. by C. Papadimitriou posted to no-tag by masteraka on 2009-09-09 21:38:26 as
	On the complexity of the containment problem for conjunctive queries with built-in predicates [My Copy] In PODS '98: Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1998), pp. 197-204. by Phokion G. Kolaitis, David L. Martin, Madhukar N. Thakur posted to no-tag by masteraka on 2009-06-19 19:52:31 as
	Query evaluation via tree-decompositions [My Copy] J. ACM, Vol. 49, No. 6. (2002), pp. 716-752. by Jörg Flum, Markus Frick, Martin Grohe posted to no-tag by masteraka on 2009-06-19 19:42:26 as
	Conjunctive-Query Containment and Constraint Satisfaction [My Copy] In Journal of Computer and System Sciences, Vol. 61 (1998), pp. 205-213. by Phokion G. Kolaitis, Moshe Y. Vardi posted to no-tag by masteraka on 2009-06-19 19:37:37 as
	Parameterized complexity for the database theorist [My Copy] SIGMOD Rec., Vol. 31, No. 4. (2002), pp. 86-96. by Martin Grohe posted to no-tag by masteraka on 2009-06-19 19:31:51 as along with 1 person sebis
	The complexity of acyclic conjunctive queries revisited [My Copy] (2 May 2006) by Arnaud Durand, Etienne Grandjean posted to no-tag by masteraka on 2009-06-19 19:17:26 as
	Heuristic Methods for Hypertree Decomposition [My Copy] MICAI 2008: Advances in Artificial Intelligence (2008), pp. 1-11. by Artan Dermaku, Tobias Ganzow, Georg Gottlob, Ben McMahan, Nysret Musliu, Marko Samer posted to no-tag by masteraka on 2009-06-04 21:38:52 as
	Data Exchange and Schema Mappings [My Copy] (September 2007) by Andreas Pieris posted to no-tag by masteraka on 2009-06-04 19:07:57 as
	The complexity of path problems in graphs and path systems of bounded bandwidth [My Copy] Graphtheoretic Concepts in Computer Science (1981), pp. 293-305. by I. Sudborough posted to no-tag by masteraka on 2009-05-25 15:40:59 as
	Time and space bounded complexity classes and bandwidth constrained problems [My Copy] Mathematical Foundations of Computer Science 1981 (1981), pp. 78-93. by Burkhard Monien, Ivan Sudborough posted to no-tag by masteraka on 2009-05-25 15:39:15 as
	Efficient algorithms for path system problems and applications to alternating and time-space complexity classes [My Copy] Foundations of Computer Science, 1980., 21st Annual Symposium on In Foundations of Computer Science, 1980., 21st Annual Symposium on (1980), pp. 62-73. by Ivan H. Sudborough posted to no-tag by masteraka on 2009-05-25 15:36:53 as
	Refining Nondeterminism in Relativizations of Complexity Classes [My Copy] J. ACM, Vol. 30, No. 3. (1983), pp. 677-685. by Xu M. Rui, John E. Doner, Ronald V. Book posted to no-tag by masteraka on 2009-05-25 15:30:57 as
	Time–Space Tradeoffs for Satisfiability [My Copy] Journal of Computer and System Sciences, Vol. 60, No. 2. (April 2000), pp. 337-353. by L. Fortnow posted to no-tag by masteraka on 2009-05-25 15:29:21 as
	Nondeterministic polynomial time versus nondeterministic logarithmic space: time-space tradeoffs for satisfiability [My Copy] Computational Complexity, 1997. Proceedings., Twelfth Annual IEEE Conference on (Formerly: Structure in Complexity Theory Conference) In Computational Complexity, 1997. Proceedings., Twelfth Annual IEEE Conference on (Formerly: Structure in Complexity Theory Conference) (1997), pp. 52-60. by L. Fortnow posted to no-tag by masteraka on 2009-05-25 15:17:10 as
	Relativizing time and space [My Copy] Foundations of Computer Science, 1981. SFCS '81. 22nd Annual Symposium on In Foundations of Computer Science, 1981. SFCS '81. 22nd Annual Symposium on (1981), pp. 254-259. by Ronald V. Book, Christopher B. Wilson, Mei-Rui Xu posted to no-tag by masteraka on 2009-05-25 15:16:19 as
	Bounding the bandwidth of NP-complete problems [My Copy] Graphtheoretic Concepts in Computer Science (1981), pp. 279-292. by Burkhard Monien, Ivan Sudborough posted to no-tag by masteraka on 2009-05-25 15:02:30 as
	Bandwidth constraints on problems complete for polynomial time [My Copy] Theoretical Computer Science, Vol. 26, No. 1-2. (September 1983), pp. 25-52. by I. Sudborough posted to no-tag by masteraka on 2009-05-19 13:58:50 as
	Relations among simultaneous complexity classes of nondeterministic and alternating Turing machines [My Copy] Acta Informatica, Vol. 30, No. 3. (1 March 1993), pp. 267-278. by Shigeki Iwata, Takumi Kasai, Etsuro Moriya posted to no-tag by masteraka on 2009-05-19 13:11:34 as
	Bandwidth constrained NP-Complete problems [My Copy] In STOC '81: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981), pp. 207-217. by Burkhard Monien, Ivan H. Sudborough posted to no-tag by masteraka on 2009-05-18 18:00:12 as
	Complete problems for space bounded subclasses of NP [My Copy] Acta Informatica, Vol. 22, No. 4. (1 October 1985), pp. 379-395. by Moon J. Chung, Michael W. Evangelist, Ivan H. Sudborough posted to no-tag by masteraka on 2009-05-18 17:59:16 as
	Dichotomic Search Protocols for Constrained Optimization [My Copy] Principles and Practice of Constraint Programming (2008), pp. 251-265. by Meinolf Sellmann, Serdar Kadioglu posted to no-tag by masteraka on 2009-03-19 16:39:16 as along with 1 person and 1 group nojhan Optimization
	Using Decision Procedures Efficiently for Optimization [My Copy] In Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling (27 June 2007) by Matthew Streeter, Stephen F. Smith posted to no-tag by masteraka on 2009-02-17 22:44:51 as
	Monotone Complexity Michelangelo Grigni [My Copy] by Michael Sipser posted to no-tag by masteraka on 2009-02-05 22:39:13 as
	Graph isomorphism problem [My Copy] Journal of Mathematical Sciences, Vol. 29, No. 4. (1 May 1985), pp. 1426-1481. by V. N. Zemlyachenko, N. M. Korneenko, R. I. Tyshkevich posted to no-tag by masteraka on 2009-01-27 20:28:38 as
	Understanding tractable decompositions for constraint satisfaction [My Copy] (2008) by Zoltan Miklos posted to no-tag by masteraka on 2008-08-01 15:46:13 as
	On the Parallel Complexity of Structural CSP Decomposition Methods [My Copy] (2007) by Zoltan Miklos posted to no-tag by masteraka on 2008-08-01 15:42:25 as
	Genetic algorithms for generalised hypertree decompositions [My Copy] European Journal of Industrial Engineering, Vol. 1, No. 3. (2007), pp. 317-340. by Nysret Musliu, Werner Schafhauser posted to no-tag by masteraka on 2008-08-01 15:33:58 as
	Tabu Search for Generalized Hypertree Decompositions [My Copy] In The Seventh Metaheuristics International Conference (MIC) (25-29 June 2007) by Nysret Musliu posted to no-tag by masteraka on 2008-08-01 15:26:36 as
	Generation of Tree Decompositions by Iterated Local Search [My Copy] Evolutionary Computation in Combinatorial Optimization (2007), pp. 130-141. by Nysret Musliu posted to no-tag by masteraka on 2008-08-01 15:23:41 as
	Constraint Satisfaction with Bounded Treewidth Revisited [My Copy] Principles and Practice of Constraint Programming - CP 2006 (2006), pp. 499-513. by Marko Samer, Stefan Szeider posted to no-tag by masteraka on 2008-08-01 15:22:51 as along with 1 person radsz
	Local Search Algorithm for Unicost Set Covering Problem [My Copy] Advances in Applied Artificial Intelligence (2006), pp. 302-311. by Nysret Musliu posted to no-tag by masteraka on 2008-08-01 15:21:49 as
	Pure Nash equilibria: hard and easy games [My Copy] In TARK '03: Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge (2003), pp. 215-230. by Georg Gottlob, Gianluigi Greco, Francesco Scarcello posted to no-tag by masteraka on 2008-08-01 15:19:40 as along with 1 person Scis0000002
	The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions [My Copy] In International Joint Conference on Artificial Intelligence (2005) by Georg Gottlob, Gianluigi Greco, Francesco Scarcello posted to no-tag by masteraka on 2008-08-01 15:18:15 as
	Generalized Hypertree Decompositions based on Hypergraph Partitioning [My Copy] (2007) by Artan Dermaku posted to no-tag by masteraka on 2008-08-01 15:13:43 as
	New Heuristic Methods for Tree Decompositions and Generalized Hypertree Decompositions [My Copy] (2006) by Werner Schafhauser edited by Georg Gottlob, Nysret Musliu posted to no-tag by masteraka on 2008-08-01 15:05:54 as
	Parallel Scientific Computation: A Structured Approach Using BSP and MPI [My Copy] (04 March 2004) by Rob Bisseling posted to no-tag by masteraka on 2008-07-10 17:48:21 as
	Efficient Graph Representations (Fields Institute Monographs, 19) [My Copy] (01 June 2003) by Jeremy P. Spinrad posted to no-tag by masteraka on 2008-07-10 00:44:16 as
	Practical Foundations of Mathematics (Cambridge Studies in Advanced Mathematics) [My Copy] (13 May 1999) by Paul Taylor posted to no-tag by masteraka on 2008-06-25 04:38:44 as along with 2 people robertjohnsimmons mstone
	Topoi: The Categorial Analysis of Logic (Dover Books on Mathematics) [My Copy] (28 April 2006) by Robert Goldblatt posted to no-tag by masteraka on 2008-06-25 04:36:28 as along with 2 people brecknell robotact
	Computational Category Theory (Prentice-Hall International Series in Computer Science) [My Copy] (01 June 1988) by D. E. Rydeheard, Burstall posted to no-tag by masteraka on 2008-06-25 04:16:28 as along with 2 people spl scis0000001
	Computational category theory [My Copy] (1988) by David E. Rydeheard, Rod M. Burstall posted to no-tag by masteraka on 2008-06-25 03:57:01 as along with 1 person mcclurmc
	Fast hypergraph partition [My Copy] In DAC '89: Proceedings of the 26th ACM/IEEE conference on Design automation (1989), pp. 762-766. by A. B. Kahng posted to no-tag by masteraka on 2008-05-27 18:33:15 as
	Parallel Hypergraph Partitioning for Scientific Computing [My Copy] by Karen Devine, Erik G. Boman, Robert Heaphy, Rob Bisseling, Umit Catalyurek posted to no-tag by masteraka on 2008-05-27 18:30:53 as
	An Empirical Comparison of CSP Decomposition Methods [My Copy] by Sathiamoorthy Subbarayan posted to no-tag by masteraka on 2008-05-27 18:24:16 as
	H.R.: Backtracking procedures for hypertree, hyperspread and connected hypertree decomposition of CSPs - CiteSeerX [My Copy] posted to no-tag by masteraka on 2008-05-27 18:22:08 as

Note: You may cite this page as: http://www.citeulike.org/user/masteraka/tag/no-tag

Result page: 1 2 Next

confirmation	33
transfer	25
pods10	23
category_theory	22
databases	17
data_exchange	12
caesar_paper	11
institutions	10
hypertree_decomposition	10
complexity	9
game_theory	8
reading_list	6
atm	5
model_theory	4
universal_algebra	4
data_integration	4
decompositions	4
parallel_computation	4
hypergraphs	3
cores	3
computation	2
mpi	2
bcq	1
inverses	1
htd	1
music	1
coalgebra	1
haskell	1
xml	1
separators	1
auxpda	1
tree_decomposition	1
logic	1

masteraka's no-tag [57 articles] Export

masteraka's tags