Pages without language links

Jump to: navigation, search

The following pages do not link to other language versions.

Showing below up to 50 results in range #1 to #50.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

  1. A practical approach to efficiently store 100 billions small objects in Ceph
  2. Add sources to the project search engine (GSoC task)
  3. Ambassadors onboarding
  4. Archive Team
  5. Archive search query language (internship)
  6. Best practices using metadata
  7. CVS loader (internship)
  8. Ceph Cluster
  9. ClearlyDefinedObject
  10. CodeMeta
  11. Code citation
  12. Code hosters
  13. Code of conduct
  14. Code scanner (internship)
  15. Code search
  16. Coding guidelines
  17. Compression ratio
  18. Content archiver blueprint
  19. Contributor License Agreement
  20. Crawling project metadata (internship)
  21. Create a browser extension (GSoC task)
  22. Create embeddable widgets (GSoC task)
  23. Create graphql query cost calculator (GSoC task)
  24. Create search ranking (GSoC task)
  25. Create status counters (GSoC task)
  26. Darcs loader (internship)
  27. Dashboard UI for the Code Scanner (GSoC task)
  28. Dell MD3460
  29. Differential
  30. Distributed self-healing object storage (internship)
  31. EGI
  32. Easy hacks
  33. European projects
  34. Expand archive coverage to Debian-based distros (internship)
  35. Expand archive coverage to other popular code hosting platforms (internship)
  36. Expand package metadata coverage (internship)
  37. External contribution integration
  38. Fine-grained tracking of source code provenance (internship)
  39. GHTorrent
  40. GitHub
  41. GitTorrent
  42. Git remote support for Software Heritage (internship)
  43. Git repositories
  44. Glossary
  45. Google Season of Docs 2019
  46. Google Season of Docs 2021
  47. Google Summer of Code 2019
  48. Google Summer of Code 2019/Graph compression
  49. Google Summer of Code 2019/Graph compression/Commit list
  50. Google Summer of Code 2019/Increase archive coverage

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)