uva.nl

Institute for Logic, Language and Computation

Searchable List of Research Output

Filter Publications
  • Jeub, L.G.S., Colavizza, G., Dong, Xiaowen, Bazzi, Marya, Cucuringu, Mihai (2023) Local2Global: a distributed approach for scaling representation learning on graphs.
    Machine Learning, Vol. 112 (pp 1663-1692)
  • Jeub, Lucas, Colavizza, G., Dong, Xiaowen, Bazzi, Marya, Cucuringu, Mihai (2021) Local2Global: Scaling global representation learning on graphs via local training.
  • Jiang, T., Li, M., Vitányi, P.M.B. (2000) The incompressibility method.
    Lecture Notes in Computer Science, Vol. 1963 (pp 36-53)
    Article | UvA-DARE
  • Jiang, T., Li, M., Vitányi, P.M.B. (2000) A lower bound on the average-case complexity of Shellsort.
    Journal of the Association for Computing Machinery, Vol. 47 (pp 905-911)
  • Jiang, T., Li, M., Vitányi, P.M.B. (2000) Average-case complexity of Stacksort and Queuesort.
    Journal of Computer Science and Technology
    Article | UvA-DARE
  • Jiang, T., Li, M., Vitányi, P.M.B. (2000) Average-case analysis of algorithms using Kolgromov complexity.
    Journal of Computer Science and Technology, Vol. 15 (pp 402-408)
  • Jiang, T., Li, M., Vitányi, P.M.B. (2002) The average-case area of Heilbronn-type triangles.
    Random Structures & Algorithms, Vol. 20 (pp 206-219)
  • Jiang, T., Seiferas, J., Vitányi, P.M.B. (1994) Two heads are better than two tapes.
    In Goodrich (Eds.), Proc. 26th ACM Symp. Theory of Comput. (pp 668-675). ACM.
    Chapter | UvA-DARE
  • Jiang, T., Seiferas, J., Vitányi, P.M.B. (1997) Two heads are better than two tapes.
    Journal of the Association for Computing Machinery (pp 237-256)
    Article | UvA-DARE
  • Jiang, Tao, Li, Ming, Vitányi, P.M.B. (1999) Average-case complexity of shellsort (preliminary version).
    In Automata, Languages and Programming - 26th International Colloquium, ICALP 1999, Proceedings (pp 453-462) (Lecture Notes in Computer Science, Vol. 1644). Springer Verlag.
    Conference contribution | UvA-DARE
  • Jijkoun, V., Kamps, J., Mishne, G.A., Monz, C., de Rijke, M., Schlobach, S., Tsur, O. (2003) The University of Amsterdam at TREC 2003.
    In TREC 2003 Working Notes. National Institute for Standards and Technology
    Conference contribution | UvA-DARE
  • Jijkoun, V., Mishne, G.A., de Rijke, M., Schlobach, S., Ahn, D.D., Müller, K.E. (2004) The University of Amsterdam at qa@clef 2004.
    In Peters, C. Borri, F. (Eds.), Working Notes for the CLEF 2004 Workshop (pp 321-324)
    Conference contribution | UvA-DARE
  • Jijkoun, V., Mishne, G.A., de Rijke, M. (2003) The University of Amsterdam at QA@CLEF 2003.
    In Peters, C. (Eds.), Working notes for the CLEF 2003 Workshop
    Conference contribution | UvA-DARE
  • Jijkoun, V., Mishne, G.A., de Rijke, M. (2003) Preprocessing documents to answer Dutch questions.
    In Proceedings BNAIC'03
    Conference contribution | UvA-DARE
  • Jijkoun, V., Mishne, G.A., de Rijke, M. (2003) Building infrastructure for Dutch question answering.
    In de Vries, A.P. (Eds.), Proceedings DIR 2003
    Conference contribution | UvA-DARE
  • Jijkoun, V., Mishne, G.A., de Rijke, M. (2004) How frogs built the Berlin Wall.
    Lecture Notes in Computer Science, Vol. 3237 (pp 523-534)
    Article | UvA-DARE
  • Jijkoun, V., Mishne, G.A., Monz, C., de Rijke, M., Schlobach, S., Tsur, O. (2003) The University of Amsterdam at the TREC 2003 Question Answering Track.
    In Proceedings TREC 2003 (pp 586-593)
    Conference contribution | UvA-DARE
  • Jijkoun, V. (2003) Finding non-local dependencies: Beyond pattern matching.
    In Kübler, Sandra Funakoshi, Kotaro Otterbacher, Jahna (Eds.), Proceedings of the ACL-2003 Student Research Workshop (pp 37-43)
    Conference contribution | UvA-DARE
  • Jijkoun, V. (2004) Answer Type Classification. Guidelines plus evaluation corpus.
  • Jijkoun, V. (2006) Graph transformations for natural language processing.
    Thesis, fully internal | UvA-DARE
1 ... 147 148 149 150 151 152 153 154 155 ... 308

The data of this list is taken from the Pure database. If you find output is missing from the list, please follow the previous link to find out how to submit to Pure. In case there are mistakes in PURE, please contact